The capacitated lot sizing problem: a review of models and algorithms

• Published in: Omega (Oxford) Vol. 31; no. 5; pp. 365 - 378
• Main Authors: Karimi, B., Fatemi Ghomi, S.M.T., Wilson, J.M.
• Format: Journal Article
• Language: English
• Published: Exeter Elsevier Ltd 01.10.2003; Elsevier; Elsevier Science Publishers; Pergamon Press Inc
• Series: Omega
• Subjects: Algorithms; Applied sciences; Capacitated lot sizing problem; Capacitated lot sizing problem Heuristics Integer programming Production planning; Comparative analysis; Economic lot size; Exact sciences and technology; Forecasts and trends; Heuristic; Heuristics; Industrial productivity; Integer programming; Inventory control, production control. Distribution; Management; Management science; Manufacturing industry; Operational research and scientific management; Operational research. Management science; Production planning; Studies; United States; Integer programming; Capacitated lot sizing problem; Production planning; Heuristics; Scheduling; Lot sizing; Heuristic approach
• ISSN: 0305-0483; 1873-5274
• DOI: 10.1016/S0305-0483(03)00059-8

Lot sizing is one of the most important and also one of the most difficult problems in production planning. This subject has been studied extensively in the literature. In this article, we consider single-level lot sizing problems, their variants and solution approaches. After introducing factors affecting formulation and the complexity of production planning problems, and introducing different variants of lot sizing and scheduling problems, we discuss single-level lot sizing problems, together with exact and heuristic approaches for their solution. We conclude with some suggestions for future research.