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


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

(1) Department of Agroindustrial Technology, Faculty of Agricultural Technology, Universitas Gadjah Mada, Indonesia
(2) Department of Agroindustrial Technology, Faculty of Agricultural Technology, Universitas Gadjah Mada, Indonesia
(*) 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:



Aggarwal, Alok and James K. Park (1993). Improved Algorithms for Economic Lot Size Problems. Operations Research, 41(3), 549-571.

Atamturk, Alper and Simge Kucukyavuz(2008). An O(n2) Algorithm For Lot Sizing With Inventory Bounds and Fixed Costs. Operations Research Letters 36, 297–299.

Bitran, Gabriel R. and Horacio H. Yanasse (1985). Computational Complexity of the Capacitated Lot Size Problem. Management Science, pp 1271-1281

Brahimi, Nadjib; Ste ́phane Dauzere-Peres; Najib M. Najid; and Atle Nordli (2006).Single item lot sizing problems: A Review. European Journal of Operational Research , 168, 1–16.

Drexl A and Haase K (1995). Proportional lot sizing and scheduling. International Journal of Production Economics, 40,73–87.

Eduardo, Leopoldo and Cardenas Barron (2010). Adaptive Genetic Algorithm For Lot-Sizing Problem With Self-Adjustment Operation Rate: A Discussion. Int. J. Production Economics 123, 243–245.

Gaafar, Lotfi (2006). Applying Genetic Algorithms to Dynamic Lot Sizing With Batch Ordering. Computers & Industrial Engineering, 51, 433–444.

Ganas, Ioannis S. and Sotirios Papachristos (1997). Analytical Evaluation of Heuristics Performance For The Single- Level Lot-Sizing Problem For Products With Constant Demand. Int. J. Production Economics, 48, 129-139.

Gencer, Cevriye; Serpil Erol; and Yalc in Erol (2011). A Decision Network Algorithm For Multi-Stage Dynamic Lot Sizing Problems. European Journal of Operational Research, 211, 507–514.

Guu, Sy-Ming and Alex X. Zhang (2003). The Finite Multiple Lot Sizing Problem With Interrupted Geometric Yield and Holding Costs. European Journal of Operational Research, 145, 635–644.

Guu, Sy-Ming (1999). Properties Of The Multiple Lot-Sizing Problem With Rigid Demand, General Cost Structures, and nterrupted Geometric Yield. Operations Research Letters, 25, 59-65.

Hwang, H.C. and W. Jaruphongsa (2006). Dynamic Lot-Sizing Model With Demand Time Windows and Speculative Cost Structure. Operations Research Letters, 34, 251-256.

Hwang, H.C.; W. Jaruphongsa; S. Çetinkaya and C.Y. Lee (2010). Capacitated Dynamic Lot-Sizing Problem With Delivery/Production Time Windows. Operations Research Letters, 38, 408-413.

Jans, Raf and Zeger Degraeve (2007). Meta-Heuristics for Dynamic Lot Sizing: A Review and Comparison of Solution Approaches. European Journal of Operational Research, 177, 1855–1875.

Karimi, B.; S.M.T. Fatemi Ghomi; and J.M. Wilson (2003). The Capacitated Lot Sizing Problem: A review of models and algorithms. Omega, 31, 365 – 378.

Lee, Chung-Yee; Sila Çetinkaya and Albert P.M. Wagelmans (2001). A Dynamic Lot-Sizing Model with Demand Time Windows. Management Science, 47(10),1384-1395.

Lee, Woon-Seek; Jong-Han Han; and Sung-Jin Cho (2005). A Heuristic Algorithm For A Multi-Product Dynamic Lot-Sizingand Shipping Problem. Int. J. Production Economics, 98, 204–214.

Li, Hongyan and Joern (2011). Competition Under Capacitated Dynamic Lot-Sizing With Capacity Acquisition. Int. J.Production Economics 131, 535–544.

Li, Yongjian; Jian Chen; and Xiaoqiang Cai (2007). Heuristic Genetic Algorithm For Capacitated Production Planning Problems With Batch Processing and Remanufacturing. Int. J. Production Economics, 105, 301–317.

Lu, Liang and Xiangtong Qi (2011). Dynamic Lot Sizing For Multiple Products With a New Joint Replenishment Model. European Journal of Operational Research , 212, 74–80.

Lyu, Jung Jr and Ming-Chang Lee (2001). A Parallel Algorithm For The Dynamic Lot Sizing. Computers & Industrial Engineering, 41, 127 – 134.

Martel, Alain and Andre Gascon (1998). Dynamic Lot-Sizing With Price Changes and Price-Dependent Holding Costs. European Journal of Operational Research, 111, 114-l 28.

Minner, Stefan (2009). A Comparison Of Simple Heuristics For Multi-Product Dynamic Demand Lot-Sizing With Limited Warehouse Capacity.Int. J. Production Economics , 118, 305–310.

Muckstadt, John A. and Amar Sapra (2010). Principles of Inventory Management: When You Are Down to Four, Order More. Springer Science Business Media,LLC.

Narayanan, Arunachalam and Powell Robinson (2010). Efficient and Effective Heuristics For The Coordinated Capacitated Lot-Size Problem. European Journal of Operational Research, 203, 583–592.

Okhrin, Irena and Knut Richter (2011). An O(T3) Algorithm For The Capacitated Lot Sizing Problem With Minimum Order Quantities. European Journal of Operational Research, 211 507–514.

Pan, Zhendong; Jiafu Tang; and Ou Liu (2009). Capacitated Dynamic Lot Sizing Problems in Closed-Loop Supply Chain. European Journal of Operational Research, 198, 810–821.

Richter, Knut and Jens Weber (2001). The Reverse Wagner/Whitin Model With Variable Manufacturing. Int. J. Production Economics, 71, 447-456.

Richter, Knut and Mirko Sombrutzki (2000). Remanufacturing Planning for The Reverse Wagner/Whitin Models. European Journal of Operational Research, 121, 304-315.

Robinson, Powell; Arunachalam Narayanan; and Funda Sahin (2009). Coordinated Deterministic Dynamic Demand Lot-Sizing Problem: A Review of Models andAlgorithms. Omega, 37, 3 – 15

Sahling, Florian; Lisbeth Buschk; Horst Tempelmeierb; and Stefan Helber (2009). Solving a Multi-level Capacitated Lot Sizing Problem with Multi-period Setup Carry-over via a Fix-and-Optimize Heuristic.Computers & Operations Research, 36, 2546 - 2553

Silver, Edward A; and Rein Peterson (1995). Decision Systems For Inventory Management and Production Planning. John Wiley & Sons, New York.

Van den Heuvel, Wilco and Albert P.M. Wagelmans (2006). An Efficient Dynamic Programming Algorithm for A Special Case of The Capacitated Lot-Sizing Problem. Computers & Operations Research , 33, 3583–3599.

Van den Heuvel, Wilco and Albert P.M. Wagelmans (2008). Four Equivalent Lot- sizing Models. Operations Research Letters, 36, 465–470.

Van Hop, Nguyen and Mario T. Tabucanon (2005). Adaptive Genetic Algorithm For Lot-Sizing Problem With Self-Adjustment Operation Rate. Int. J. Production Economics , 98, 129–135.

Wagner, Harvey M., and Thomson M. Whitin (2004). Dynamic Version of the Economic Lot Size Model. Management Science, 50(12), 1770–1774.

Wang, Nengmin; Zhengwen He, Jingchun Sun; Haiyan Xie; and Wei Shi (2011). A Single-Item Uncapacitated Lot-Sizing Problem With Remanufacturing and Outsourcing. Procedia Engineering, 15,5170–5178.

Xie, Jinxing and Jiefang Dong (2002). Heuristic Genetic Algorithms for General Capacitated Lot-Sizing Problems. Computers and Mathematics with Applications, 44, 263–276.

Zangwill, Williard I (1969). A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size ProductionSystem-A Network Approach. Management Science: Theory Series, 15(9), 506–527.

DOI: https://doi.org/10.22146/aij.v1i1.24992

Article Metrics

Abstract views : 1691 | views : 2254


  • There are currently no refbacks.