| Article ID: | iaor20043291 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 2 |
| Start Page Number: | 185 |
| End Page Number: | 195 |
| Publication Date: | Mar 2004 |
| Journal: | Operations Research Letters |
| Authors: | Degraeve Zeger, Jans Raf |
| Keywords: | lot sizing |
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.