Production planning with limited inventory capacity and allowed stockout

Abstract In production planning, there is a situation where the production quantity is limited by inventory capacity rather than production capacity. This situation often happens in petrochemical manufacturing, food processing, glass manufacturing, etc. Only a few studies can be found in literature for this situation, among which the stockout strategy is not well studied. In this paper, we consider the production-planning problem with inventory capacity as a limiting factor. We further consider the problem with the following features: (1) the stockout is allowed, (2) production and lost sale cost functions are time varying and non-increasing, and (3) inventory capacity is constant. These features have their roots in practice. In this paper, first we present a stockout model, and then we prove some properties at an optimal solution to our model. Based on these properties, we further develop an algorithm with polynomial time complexity using the network flow approach. The paper also provides a case study to further justify practicability of the stockout strategy with limited inventory and to show the effectiveness of our model and algorithm.

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

[2]  Joaquin Sicilia,et al.  A polynomial algorithm for the production/ordering planning problem with limited storage , 2007, Comput. Oper. Res..

[3]  C. Swoveland A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs , 1975 .

[4]  X. Liu,et al.  Models and Algorithms for Capacitated Lot Sizing Problems , 2004 .

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

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

[7]  J. K. Lenstra,et al.  Deterministic Production Planning: Algorithms and Complexity , 1980 .

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

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

[10]  K. R. Baker,et al.  An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints , 1978 .

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

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

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

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

[15]  Feng Chu,et al.  A forward algorithm for capacitated lot sizing problem with lost sales , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

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

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

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

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

[20]  Chien-Hua M. Lin,et al.  An effective algorithm for the capacitated single item lot size problem , 1994 .

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

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

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

[24]  Ömer Kirca An efficient algorithm for the capacitated single item dynamic lot size problem , 1990 .