The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs

We address a multi-item capacitated lot-sizing problem with setup times, safety stock and demand shortages. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is np-hard. We propose a Lagrangian relaxation of the resource capacity constraints. We develop a dynamic programming algorithm to solve the induced sub-problems. An upper bound is also proposed using a Lagrangian heuristic with several smoothing algorithms. Some experimental results showing the effectiveness of the approach are reported.

[1]  Harish C. Bahl,et al.  A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing , 1992 .

[2]  Nabil Absi.  Modélisation et résolution de problèmes de lot-sizing à capacité finie , 2005 .

[3]  Safia Kedad-Sidhoum,et al.  The multi-item capacitated lot-sizing problem with setup times and shortage costs , 2008, Eur. J. Oper. Res..

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

[5]  N. Adam,et al.  The Dynamic Lot-Sizing Problem for Multiple Items Under Limited Capacity , 1981 .

[6]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[7]  A. Federgruen,et al.  A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0n log n or 0n Time , 1991 .

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

[9]  Luk N. Van Wassenhove,et al.  Lagrangean relaxation based heuristics for lot sizing with setup times , 2009, Eur. J. Oper. Res..

[10]  James B. Orlin.  A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..

[11]  Luk N. Van Wassenhove,et al.  Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review , 1988 .

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

[13]  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..

[14]  Deniz Aksen,et al.  Loss of customer goodwill in the uncapacitated lot-sizing problem , 2007, Comput. Oper. Res..

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

[16]  J. Krarup,et al.  Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems , 1977 .

[17]  Laurence A. Wolsey,et al.  The uncapacitated lot-sizing problem with sales and safety stocks , 2001, Math. Program..

[18]  W. Zangwill.  A Deterministic Multi-Period Production Scheduling Model with Backlogging , 1966 .

[19]  Safia Kedad-Sidhoum,et al.  MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs , 2007, RAIRO Oper. Res..

[20]  Suresh Chand,et al.  The single-item lot-sizing problem with immediate lost sales , 2003, Eur. J. Oper. Res..

[21]  Timothy J. Lowe,et al.  Dynamic Economic Lot Size Models with Period-Pair-Dependent Backorder and Inventory Costs , 2001, Oper. Res..

[22]  Paul Higgins,et al.  Manufacturing Planning and Control: Beyond MRP II , 1996 .

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

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

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

[26]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[27]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

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