Sensitivity Analysis of the Economic Lot-Sizing Problem

In this paper we study sensitivity analysis of the uncapacitated single level economic lot-sizing problem, which was introduced by Wagner and Whitin about thirty years ago. In particular we are concerned with the computation of the maximal ranges in which the numerical problem parameters may vary individually, such that a solution already obtained remains optimal. Only recently it was discovered that faster algorithms than the Wagner-Whitin algorithm exist to solve the economic lot-sizing problem. Moreover, these algorithms reveal that the problem has more structure than was recognized so far. When performing the sensitivity analysis we exploit these newly obtained insights.

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

[2]  James R. Evans.  An efficient implementation of the Wagner-Whitin algorithm for dynamic lot-sizing , 1985 .

[3]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

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

[5]  W. Issel,et al.  Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,– , 1979 .

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

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

[8]  Knut Richter,et al.  A Parametric Analysis of the Dynamic Lot-sizing Problem , 1989, J. Inf. Process. Cybern..

[9]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

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

[11]  K. Richter,et al.  On the stability region for multi-level inventory problems , 1989 .

[12]  Harvey M. Wagner.  A POSTSCRIPT TO DYNAMIC PROBLEMS IN THE THEORY OF THE FIRM , 1960 .

[13]  Gabriel R. Bitran,et al.  Approximation Methods for the Uncapacitated Dynamic Lot Size Problem , 1984 .

[14]  Albert P. M. Wagelmans,et al.  A note on 'Stability of the constant cost dynamic lot size model' by K. Richter * , 1991 .

[15]  C.P.M. van Hoesel.  Models and algorithms for single-item lot sizing problems , 1991 .

[16]  S. Axsäter.  Worst case performance for lot sizing heuristics , 1982 .

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

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

[19]  Knut Richter.  Stability of the constant cost dynamic lot size model , 1987 .

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

[21]  In-Soo Lee.  On sensitivity analysis for shortest-path dynamic programming models , 1987 .

[22]  이인수.  On Sensitivity Analysis for Shortest-Path Dynamic Programming Models , 1987 .