One-Machine Problems

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


Scheduling multiple product types with unlimited production capacity is straightforwardly decomposed into a number of problems, each of which deals with a single product. The number of such problems is equal to the number of products to be scheduled. Such one-machine, one-product-type problems have been discussed in the previous part of the book. In contrast, scheduling multiple product types, with limited capacity, cannot be decomposed. This is because different products compete for the common capacity in a different, changing-in-time manner Because the multi-product, capacitated scheduling problem is much harder than the problems considered in the previous chapters, the objective of this chapter is to study the optimal behavior of production systems under only linear performance measures.


Planning Horizon Product Type Switching Point Maximum Production Rate Feedback Rule 
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.


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