A new characterization for the dynamic lot size problem with bounded inventory

In this paper, we address the dynamic lot size problem with storage capacity. As in the unconstrained dynamic lot size problem, this problem admits a reduction of the state space. New properties to obtain optimal policies are introduced. Based on these properties a new dynamic programming algorithm is devised. Superiority of the new algorithm to the existing procedure is demonstrated. Furthermore, the new algorithm runs in O(T) expected time when demands vary between zero and the storage capacity. Computational results are reported for randomly generated problems.

[1]  Alan S. Manne,et al.  Programming of Economic Lot Sizes , 1958 .

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

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

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

[5]  M. Rao,et al.  A Class of Deterministic Production Planning Problems , 1973 .

[6]  Eric V. Denardo,et al.  Dynamic Programming: Models and Applications , 2003 .

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

[8]  Gabriel R. Bitran,et al.  Approximation Formulations for the Single-Product Capacitated Lot Size Problem , 1986, Oper. Res..

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

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

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

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

[13]  A. F. Veinott.  Production Planning with Convex Costs: A Parametric Study , 1964 .

[14]  Chien-Hua M. Lin,et al.  An OT2 Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem , 1988 .

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

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