The Single Item DLSP
- 71 Downloads
In this chapter we consider the single item Discrete Lotsizing and Scheduling Problems (DLSP) with general cost structures and zero setup times. This problem is denoted by 1/1/TD/G/A in the standard problem notation, introduced in Chapter 3.
KeywordsSetup Cost Valid Inequality Dynamic Programming Approach Minimal Total Cost Network Flow Problem
Unable to display preview. Download preview PDF.