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 modelformulation, and algorithms that enable large-scale problems to be effectively solved.Comprehensive review is given on model formulation of dynamic lot-sizing problems, especiallyon capacitated lot-sizing (CLS) problem and the coordinated lot-sizing problem. Bothapproaches have their intercorrelated, where CLS can be employed for single or multilevel/stage, item, and some restrictions. When a need for joint setup replenishment exists, thenthe coordinated lot-sizing is the choice. Furthermore, both algorithmics and heuristics solutionin the research of dynamic lot sizing are considered, followed by an illustration to provide anefficient algorithm
