论文信息 - Efficient post-optimization analysis procedure for the dynamic lot-sizing problem

Efficient post-optimization analysis procedure for the dynamic lot-sizing problem

Abstract In this paper, we develop an efficient post-optimization analysis procedure for the Wagner-Whitin solution to the Dynamic Lot-Sizing Problem (DLSP). The proposed procedure can be used in the context of a branch-and-bound algorithm, or in smoothing heuristic approaches for solving the Capacitated Lot-Sizing Problem (CLSP).

Moustapha Diaby | M. Diaby

[1] Harish C. Bahl,et al. Capacitated lot-sizing and scheduling by Lagrangean relaxation , 1992 .

[2] Edward A. Silver,et al. A heuristic algorithm for determining lot sizes of an item subject to regular and overtime production capacities , 1983 .

[3] William W. Trigeiro,et al. Capacitated lot sizing with setup times , 1989 .

[4] Thomas L. Magnanti,et al. Facets and algorithms for capacitated lot sizing , 1989, Math. Program..

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

[6] E. Newson. Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources , 1975 .

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

[8] L Van Wassenhove,et al. Lagrangean Relaxation for the Multi-Item Capacitated Lot-Sizing Problem , 1985 .