A dynamic programming algorithm for dynamic lot size models with piecewise linear costs

We propose a new algorithm for dynamic lot size models (LSM) in which production and inventory cost functions are only assumed to be piecewise linear. In particular, there are no assumptions of convexity, concavity or monotonicity. Arbitrary capacities on both production and inventory may occur, and backlogging is allowed. Thus the algorithm addresses most variants of the LSM appearing in the literature. Computational experience shows it to be very effective on NP-hard versions of the problem. For example, 48 period capacitated problems with production costs defined by eight linear segments are solvable in less than 2.5 minutes of Vax 8600 cpu time.

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

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

[3]  Hanan Luss,et al.  Production planning with time-dependent capacity bounds , 1982 .

[4]  FlorianM.,et al.  Deterministic Production Planning , 1980 .

[5]  S. Selçuk Erengüç,et al.  A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints , 1990, Comput. Oper. Res..

[6]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

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

[8]  M. Lambrecht,et al.  A capacity constrained single-facility dynamic lot-size model , 1978 .

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

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

[11]  S. Selcuk Erenguc,et al.  A branch and bound algorithm for a single-item multi-source dynamic lot sizing problem with capacity constraints , 1987 .

[12]  Paul H. Zipkin,et al.  A dynamic lot-size model with make-or-buy decisions , 1989 .

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

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

[15]  S. Lippman.  Optimal inventory policy with multiple set-up costs , 1968 .

[16]  Suresh P. Sethi,et al.  Multiple Finite Production Rate Dynamic Lot Size Inventory Models , 1981, Oper. Res..

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

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

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

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

[21]  Awi Federgruen,et al.  A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n logn) or , 1991 .

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

[23]  Suresh Chand,et al.  Finite-Production-Rate Inventory Models with First and Second Shift Setups , 1983 .

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

[25]  Chung Yee Lee,et al.  Error bound for the dynamic lot size model allowing speculative motive , 1995 .