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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kogan, K., Khmelnitsky, E. (2000). Parallel Machine Problems. In: Scheduling: Control-Based Theory and Polynomial-Time Algorithms. Applied Optimization, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4675-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4675-7_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7116-8
Online ISBN: 978-1-4615-4675-7
eBook Packages: Springer Book Archive