The economic lot-sizing problem with lost sales and bounded inventory

This article considers an economic lot-sizing problem with lost sales and bounded inventory. The structural properties of optimal solutions under different assumptions on the cost functions are proved. Using these properties, new and improved algorithms for the problem are presented. Specifically, the first polynomial algorithm for the general lot-sizing problem with lost sales and bounded inventory is presented, and it is shown that the complexity can be reduced considerably in the special case of non-increasing lost sales costs. Moreover, with the additional assumption that there is no speculative motive for holding inventory, an existing result is improved by providing a linear time algorithm.

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

[2]  Gerald L. Thompson,et al.  A Forward Algorithm for the Capacitated Lot Size Model with Stockouts , 1990, Oper. Res..

[3]  Apm Wagelmans,et al.  Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions , 1994 .

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

[5]  Wilco van den Heuvel,et al.  Note on "An efficient approach for solving the lot-sizing problem with time-varying storage capacities" , 2008, Eur. J. Oper. Res..

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

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

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

[9]  Wilco van den Heuvel,et al.  Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging , 2010 .

[10]  Feng Chu,et al.  Lot sizing with bounded inventory and lost sales , 2007 .

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

[12]  Feng Chu,et al.  Single-Item Dynamic Lot-Sizing Models With Bounded Inventory and Outsourcing , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[13]  Jan A. Persson,et al.  An optimization model for refinery production scheduling , 2002 .

[14]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[15]  Joaquin Sicilia,et al.  A new characterization for the dynamic lot size problem with bounded inventory , 2003, Comput. Oper. Res..

[16]  Candace Arai Yano,et al.  Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive , 1987 .

[17]  Eugeniusz Toczyłowski.  An O(T/sup 2/) algorithm for the lot-sizing problem with limited inventory levels , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

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

[19]  Tieming Liu.  Economic lot sizing problem with inventory bounds , 2008, Eur. J. Oper. Res..

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

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

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

[23]  Gerald L. Thompson,et al.  Decision horizons for the capacitated lot size model with inventory bounds and stockouts , 1993, Comput. Oper. Res..

[24]  X. Liu,et al.  Production planning with limited inventory capacity and allowed stockout , 2008 .

[25]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

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

[27]  Hark-Chin Hwang.  An O(T 3 ) Algorithm for Lot-Sizing Problem with Lost-Sales under General Production , 2007 .

[28]  Joaquin Sicilia,et al.  An efficient approach for solving the lot-sizing problem with time-varying storage capacities , 2008, Eur. J. Oper. Res..

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

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

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