Journal
OR SPECTRUM
Volume 32, Issue 2, Pages 231-261Publisher
SPRINGER
DOI: 10.1007/s00291-008-0150-7
Keywords
Dynamic capacitated lot-sizing; MLCLSP; CLSP; CLSPL; Mathematical programing; Lagrangian relaxation; Decomposition; Metaheuristics; Greedy heuristics
Categories
Ask authors/readers for more resources
This paper presents a review of four decades of research on dynamic lot-sizing with capacity constraints. We discuss both different modeling approaches to the optimization problems and different algorithmic solution approaches. The focus is on research that separates the lot-sizing problem from the detailed sequencing and scheduling problem. Our conceptional point of reference is the multi-level capacitated lot-sizing problem (MLCLSP). We show how different streams of research emerged over time. One result is that many practically important problems are still far from being solved in the sense that they could routinely be solved close to optimality in industrial practice. Our review also shows that currently mathematical programing and the use of metaheuristics are particularly popular among researchers in a vivid and flourishing field of research.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available