DYNAMIC LOT-SIZING PROBLEMS: A Review on Model and Efficient Algorithm

Endy Suwondo(1*), Henry Yuliando(2)

(*) Corresponding Author


Due to their importance in industry, dynamic demand lot-sizing problems are frequently studied.
This study consider dynamic lot-sizing problems with recent advances in problem and model
formulation, and algorithms that enable large-scale problems to be effectively solved.
Comprehensive review is given on model formulation of dynamic lot-sizing problems, especially
on capacitated lot-sizing (CLS) problem and the coordinated lot-sizing problem. Both
approaches have their intercorrelated, where CLS can be employed for single or multi
level/stage, item, and some restrictions. When a need for joint setup replenishment exists, then
the coordinated lot-sizing is the choice. Furthermore, both algorithmics and heuristics solution
in the research of dynamic lot sizing are considered, followed by an illustration to provide an
efficient algorithm.


Dynamic lot sizing, modeling, algorithm, heuristics

Full Text:


Article Metrics

Abstract views : 626 | views : 1560


  • There are currently no refbacks.

Agroindustrial Journal Indexed by: