Abstract
This section addresses the scheduling problems characterized by demand as a function of time specified over a finite planning horizon. The problems differ by inventory-related constraints that allow or disallow backlogs and by the form of the objective function.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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). Unlimited Capacity 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_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4675-7_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7116-8
Online ISBN: 978-1-4615-4675-7
eBook Packages: Springer Book Archive