An effective algorithm for the capacitated single item lot size problem

Abstract This paper studies a deterministic, single product capacitated dynamic lot size model with linear production and holding costs where the setup costs, unit production costs, and capacities are arbitrary functions of the period, and the unit production costs satisfy the growth constraint: The unit production cost in any period can never exceed the sum of the unit production cost and the unit holding cost in the previous period. Our main result is an algorithm which combines dynamic programming with branch and bound. Although the problem considered here is known to be NP-hard, this algorithm handles many reasonable sized problems. A number of tests covering a fairly wide range of parameter values are run to evaluate its effectiveness. The average CPU time required to find an optimal solution to our 96 period test problems on a VAX 11/750 minicomputer is 13.3 seconds.

[1]  M. G. Korgaonker.  Production Smoothing Under Piecewise Concave Costs, Capacity Constraints and Nondecreasing Requirements , 1977 .

[2]  T. Morton,et al.  General Planning Horizons for Production Smoothing with Deterministic Demands , 1974 .

[3]  E. Zabel.  Some Generalizations of an Inventory Planning Horizon Theorem , 1964 .

[4]  H. Kunreuther,et al.  Planning Horizons for the Dynamic Lot Size Model with Backlogging , 1974 .

[5]  Howard Kunreuther,et al.  Planning Horizons for Production Smoothing with Deterministic Demands: I. All Demand Met from Regular Production , 1973 .

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

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

[8]  F. J. Gould,et al.  Extensions of the Planning Horizon Theorem in the Dynamic Lot Size Model , 1969 .

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

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

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

[12]  A. F. Veinott.  Extreme points of leontief substitution systems , 1968 .

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

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

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

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

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

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

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

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

[21]  Rolf A. Lundin,et al.  Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results , 1975, Oper. Res..

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

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