Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
