Advertisement

Parallel Machine Problems

  • Konstantin Kogan
  • Eugene Khmelnitsky
Chapter
  • 272 Downloads
Part of the Applied Optimization book series (APOP, volume 43)

Abstract

This chapter deals with scheduling of multiple machines and products under both limited and unlimited production capacity. Since the unlimited capacity problems can be decomposed into a number of one-machine, one-product problems, they are considered only in Section 6.1, for general demands over a finite planning horizon. Because the capacitated, multi-machine, scheduling problems are much harder to solve than the problems considered in the previous chapters, the objective of this chapter is to study the optimal behavior for only some special cases of scheduling parallel machines with a linear performance measure.

Keywords

Schedule Problem Planning Horizon Single Machine Linear Algebraic Equation Uniform Speed 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2000

Authors and Affiliations

  • Konstantin Kogan
    • 1
  • Eugene Khmelnitsky
    • 2
  1. 1.Department of Computer ScienceCenter for Technological EducationHolonIsrael
  2. 2.Department of Industrial EngineeringTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations