The Discrete Lotsizing and Scheduling Problem (DLSP)
- 72 Downloads
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.
KeywordsSetup Time Parallel Machine Setup Cost Feasibility Problem Feasible Schedule
Unable to display preview. Download preview PDF.