Abstract
In this chapter we consider some extensions and generalizations of the Discrete Lotsizing and Scheduling Problem (DLSP), introduced in Chapter 2. These extensions and generalizations may prove useful in practice, and include problems with sequence dependent setup costs, problems with sequence dependent setup times, and parallel machine problems. Moreover, for all problems defined in this chapter, computational complexity results are derived. These results do not only provide an interesting theoretical insight in the “hardness” of the DLSP problem, but may also serve as a good indicator for the computational behaviour of algorithms.
Keywords
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.
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
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Salomon, M. (1991). The Discrete Lotsizing and Scheduling Problem (DLSP). In: Deterministic Lotsizing Models for Production Planning. Lecture Notes in Economics and Mathematical Systems, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51649-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-51649-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53701-4
Online ISBN: 978-3-642-51649-8
eBook Packages: Springer Book Archive