The dynamic lot-sizing model with backlogging: A simple o(n log n) algorithm and minimal forecast horizon procedure

We develop a simple O(n log n) solution method for the standard lot-sizing model with backlogging and a study horizon of n periods. Production costs are fixed plus linear and holding and backlogging costs are linear with general time-dependent parameters. The algorithm has linear [O(n)] time complexity for several important subclasses of the general model. We show how a slight adaptation of the algorithm can be used for the detection of a minimal forecast horizon and associated planning horizon. The adapted algorithm continues to have complexity O(n log n) or O(n) for the above-mentioned subclasses of the general model. © 1993 John Wiley & Sons, Inc.

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

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

[3]  L. Zurich,et al.  Operations Research in Production Planning, Scheduling, and Inventory Control , 1974 .

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

[5]  S. Graves.  Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems , 1982 .

[6]  Lawrence L. Larmore,et al.  The least weight subsequence problem , 1987, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[8]  Gabriel R. Bitran,et al.  The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations , 1986 .

[9]  Chung-Yee Lee,et al.  Rolling Planning Horizons: Error Bounds for the Dynamic Lot Size Model , 1986, Math. Oper. Res..

[10]  Clyde L. Monma,et al.  Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..

[11]  G. D. Eppen,et al.  Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition , 1987, Oper. Res..

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

[13]  R. Kipp Martin,et al.  Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition , 1987, Oper. Res..

[14]  Robert E. Wilber.  The Concave Least-Weight Subsequence Problem Revisited , 1988, J. Algorithms.

[15]  E. Myers,et al.  Sequence comparison with concave weighting functions. , 1988, Bulletin of mathematical biology.

[16]  Raffaele Giancarlo,et al.  Speeding up Dynamic Programming with Applications to Molecular Biology , 1989, Theor. Comput. Sci..

[17]  Suresh Chand,et al.  Existence of Forecast Horizons in Undiscounted Discrete-Time Lot Size Models , 1990, Oper. Res..

[18]  Chung Yee Lee,et al.  Error bound for the dynamic lot size model with backlogging , 1991 .

[19]  Maurice Queyranne,et al.  A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs , 1991 .

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

[21]  S. Sethi,et al.  Forecast Horizons in the Discounted Dynamic Lot Size Model , 1992 .

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

[23]  Awi Federgruen,et al.  Minimal Forecast Horizons and a New Planning Procedure for the General Dynamic Lot Sizing Model: Nervousness Revisited , 1994, Oper. Res..