Serial Machine Problems

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


This book is devoted to classifying and solving scheduling problems in the production systems of simple machine configurations. Although such configurations as job-shop, open-shop, and re-entrant lines are not within the book’s scope, the maximum principle applied to scheduling problems in complex machine configurations may still result in efficient combinatorial algorithms. This chapter deals with scheduling of multiple tandem machines with limited production capacity and demand concentrated at a due date. Among the various scheduling problems, this one is chosen to illustrate the solution methodology suggested in this book for those cases when configuration of the production system is not as simple as a parallel-machine cell.


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