2004-03-01
Improved lower bounds for the capacitated lot sizing problem with setup times
Publication
Publication
Operations Research Letters , Volume 32 - Issue 2 p. 185- 195
We present new lower bounds for the capacitated lot sizing problem, applying decomposition to the network reformulation. The demand constraints are the linking constraints and the problem decomposes into subproblems per period containing the capacity and setup constraints. Computational results and a comparison to other lower bounds are presented.
| Additional Metadata | |
|---|---|
| , , , | |
| doi.org/10.1016/j.orl.2003.06.001, hdl.handle.net/1765/76437 | |
| Operations Research Letters | |
| Organisation | Erasmus Research Institute of Management |
|
Jans, R.& Degraeve, Z. (2004). Improved lower bounds for the capacitated lot sizing problem with setup times. Operations Research Letters, 32(2), 185–195.https://doi.org/10.1016/j.orl.2003.06.001 |
|