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

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.

[1]  Yongjian Li,et al.  Heuristic genetic algorithm for capacitated production planning problems with batch processing and remanufacturing , 2007 .

[2]  Albert P. M. Wagelmans,et al.  Four equivalent lot-sizing models , 2008, Oper. Res. Lett..

[3]  Lotfi K. Gaafar,et al.  Applying genetic algorithms to dynamic lot sizing with batch ordering , 2006, Comput. Ind. Eng..

[4]  Zeger Degraeve,et al.  Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches , 2004, Eur. J. Oper. Res..

[5]  Knut Richter,et al.  Remanufacturing planning for the reverse Wagner/Whitin models , 2000, Eur. J. Oper. Res..

[6]  Leopoldo Eduardo Cárdenas-Barrón.  Adaptive genetic algorithm for lot-sizing problem with self-adjustment operation rate: A discussion , 2010 .

[7]  Hongyan Li,et al.  Competition under capacitated dynamic lot-sizing with capacity acquisition , 2011 .

[8]  Sy-Ming Guu.  Properties of the multiple lot-sizing problem with rigid demand, general cost structures, and interrupted geometric yield , 1999, Oper. Res. Lett..

[9]  S. Papachristos,et al.  Analytical evaluation of heuristics performance for the single-level lot-sizing problem for products with constant demand , 1997 .

[10]  Chung-Yee Lee,et al.  A Dynamic Lot-Sizing Model with Demand Time Windows , 2001 .

[11]  Wei Shi,et al.  A Single-Item Uncapacitated Lot-Sizing Problem with Remanufacturing and Outsourcing , 2011 .

[12]  Graham K. Rand,et al.  Decision Systems for Inventory Management and Production Planning , 1979 .

[13]  Stéphane Dauzère-Pérès,et al.  Single item lot sizing problems , 2006, Eur. J. Oper. Res..

[14]  Alain Martel,et al.  Dynamic lot-sizing with price changes and price-dependent holding costs , 1998, Eur. J. Oper. Res..

[15]  Arunachalam Narayanan,et al.  Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms , 2009 .

[16]  Chung-Yee Lee,et al.  Capacitated dynamic lot-sizing problem with delivery/production time windows , 2010, Oper. Res. Lett..

[17]  Jiafu Tang,et al.  Capacitated dynamic lot sizing problems in closed-loop supply chain , 2009, Eur. J. Oper. Res..

[18]  Hark-Chin Hwang,et al.  Dynamic lot-sizing model with demand time windows and speculative cost structure , 2006, Oper. Res. Lett..

[19]  Alf Kimms,et al.  Proportional lot sizing and scheduling: Some extensions , 1998, Networks.

[20]  W. Zangwill.  A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System---A Network Approach , 1969 .

[21]  A. Drexl,et al.  Proportional lotsizing and scheduling , 1995 .

[22]  Mario T. Tabucanon,et al.  Adaptive genetic algorithm for lot-sizing problem with self-adjustment operation rate , 2005 .

[23]  Alper Atamtürk,et al.  An O(n2) algorithm for lot sizing with inventory bounds and fixed costs , 2008, Oper. Res. Lett..

[24]  Albert P. M. Wagelmans,et al.  An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem , 2006, Comput. Oper. Res..

[25]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[26]  Aris A. Syntetos,et al.  Principles of Inventory Management: When You are Down to Four, Order More , 2014, J. Oper. Res. Soc..

[27]  K. Richter,et al.  The reverse Wagner/Whitin model with variable manufacturing and remanufacturing cost , 2001 .

[28]  Knut Richter,et al.  An O(T3) algorithm for the capacitated lot sizing problem with minimum order quantities , 2011, Eur. J. Oper. Res..

[29]  Технология.  Springer Science+Business Media , 2013 .

[30]  Sung-Jin Cho,et al.  A heuristic algorithm for a multi-product dynamic lot-sizing and shipping problem , 2005 .

[31]  Arunachalam Narayanan,et al.  Production , Manufacturing and Logistics Efficient and effective heuristics for the coordinated capacitated lot-size problem , 2009 .

[32]  Horst Tempelmeier,et al.  Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic , 2009, Comput. Oper. Res..

[33]  Jinxing Xie,et al.  Heuristic genetic algorithms for general capacitated lot-sizing problems☆ , 2002 .

[34]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[35]  Yalcin Erol,et al.  A decision network algorithm for multi-stage dynamic lot sizing problems , 1999 .

[36]  Liang Lu,et al.  Dynamic lot sizing for multiple products with a new joint replenishment model , 2011, Eur. J. Oper. Res..

[37]  Jrjung Lyu,et al.  A parallel algorithm for the dynamic lot-sizing problem , 2001 .

[38]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[39]  John M. Wilson,et al.  The capacitated lot sizing problem: a review of models and algorithms , 2003 .

[40]  S. Minner.  A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity , 2009 .

[41]  Sy-Ming Guu,et al.  The finite multiple lot sizing problem with interrupted geometric yield and holding costs , 2003, Eur. J. Oper. Res..

[42]  SahlingFlorian,et al.  Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic , 2009 .