Dynamic capacitated lot-sizing problems: a classification and review of solution approaches

Dynamic capacitated lot-sizing problems: a classification and review of solution approaches

0.00 Avg rating0 Votes
Article ID: iaor20101675
Volume: 32
Issue: 2
Start Page Number: 231
End Page Number: 261
Publication Date: Apr 2010
Journal: OR Spectrum
Authors: , , ,
Keywords: lot sizing
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.