A Lagrangian heuristic for capacitated single item lot sizing problems

This paper presents a new Lagrangian heuristic to solve the general capacitated single item lot sizing problem (CSILSP) where the total costs of production, setup, and inventory are to be minimized. We introduce a pre-smoothing procedure to transform the problem into a CSILSP with non-customer specific time windows and relax constraints that are specific to the CSILSP. The resulting uncapacitated single item problems with non-customer specific production time windows can be solved in polynomial time. We also analyze the performance of the Lagrangian heuristic for solving the CSILSP with non-customer specific time windows. Finally, the heuristic is adapted to the customer specific case. The introduction of pre-smoothing and the relaxation of CSILSP-specific constraints help to decrease the gap between lower bounds and upper bounds from 26.22 to 1.39 %, on average. The heuristic can be used to solve aggregate production planning problems, or can be integrated into a general procedure to solve more complex lot sizing problems.

[1]  L Van Wassenhove,et al.  Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem , 1985 .

[2]  Jinwen Ou.  Economic lot sizing with constant capacities and concave inventory costs , 2012 .

[3]  Dong X. Shaw,et al.  An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs , 1998 .

[4]  Gabriel R. Bitran,et al.  Approximation Methods for the Uncapacitated Dynamic Lot Size Problem , 1984 .

[5]  Abdelwaheb Rebai,et al.  MIP Formulations and Metaheuristics for Multi-Item Capacitated Lot-Sizing Problem with Non-Customer Specific Production Time Windows and Setup Times , 2017 .

[6]  Harvey H. Millar,et al.  Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering , 1994 .

[7]  Chung-Yee Lee,et al.  A new dynamic programming algorithm for the single item capacitated dynamic lot size model , 1994, J. Glob. Optim..

[8]  Vincent P. Simpson.  Optimum Solution Structure for a Repairable Inventory Problem , 1978, Oper. Res..

[9]  Sim Kim Lau,et al.  Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem , 2010, Eur. J. Oper. Res..

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

[11]  Luk N. Van Wassenhove,et al.  Multi Item Single Level Capacitated Dynamic Lotsizing Heuristics: A Computational Comparison (Part I: Static Case) , 1986 .

[12]  Luk N. Van Wassenhove,et al.  A simple heuristic for the multi item single level capacitated lotsizing problem , 1986 .

[13]  William W. Trigeiro,et al.  Capacitated lot sizing with setup times , 1989 .

[14]  Stéphane Dauzère-Pérès,et al.  Capacitated Multi-Item Lot-Sizing Problems with Time Windows , 2006, Oper. Res..

[15]  Cem Saydam,et al.  A comparative performance analysis of the Wagner-Whitin algorithm and lot-sizing heuristics , 1990 .

[16]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[17]  Horst Tempelmeier,et al.  Dynamic capacitated lot-sizing problems: a classification and review of solution approaches , 2010, OR Spectr..

[18]  Laurence A. Wolsey,et al.  Lot-sizing with production and delivery time windows , 2005, Math. Program..

[19]  Steven Nahmias,et al.  Perishable Inventory Theory: A Review , 1982, Oper. Res..

[20]  Panos M. Pardalos.  Approximation and Complexity in Numerical Optimization , 2000 .

[21]  Yves Pochet,et al.  Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs , 2009, Eur. J. Oper. Res..

[22]  E. Silver,et al.  A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem , 1981 .

[23]  Rita Vachani,et al.  Performance of heuristics for the uncapacitated lot-size problem , 1992 .

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

[25]  Wun-Hwa Chen,et al.  Analysis of relaxations for the multi-item capacitated lot-sizing problem , 1991 .

[26]  Heinrich Kuhn,et al.  Capacitated lot-sizing with extensions: a review , 2008, 4OR.

[27]  Albert P. M. Wagelmans,et al.  An $O(T^3)$ algorithm for the economic lot-sizing problem with constant capacities , 1993 .

[28]  Laurence A. Wolsey,et al.  Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times , 2010, Comput. Oper. Res..

[29]  M. Florian,et al.  DETERMINISTIC PRODUCTION PLANNING WITH CONCAVE COSTS AND CAPACITY CONSTRAINTS. , 1971 .

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

[31]  Stephen F. Love.  Bounded Production and Inventory Models with Piecewise Concave Costs , 1973 .

[32]  Vinícius Amaral Armentano,et al.  A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines , 2006, Eur. J. Oper. Res..

[33]  L. J. Thomas,et al.  Heuristics for multilevel lot-sizing with a bottleneck , 1986 .

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

[35]  Hark-Chin Hwang,et al.  Dynamic lot-sizing model for major and minor demands , 2008, Eur. J. Oper. Res..

[36]  Hark-Chin Hwang.  Dynamic lot-sizing model with production time windows , 2007 .

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

[38]  Albert P. M. Wagelmans,et al.  Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems , 2001, Math. Oper. Res..

[39]  Martin W. P. Savelsbergh,et al.  Analysis of bounds for a capacitated single-item lot-sizing problem , 2007, Comput. Oper. Res..

[40]  Albert P. M. Wagelmans,et al.  Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case , 1992, Oper. Res..