| Article ID: | iaor199728 |
| Country: | Netherlands |
| Volume: | 68 |
| Issue: | 1 |
| Start Page Number: | 134 |
| End Page Number: | 138 |
| Publication Date: | Jul 1993 |
| Journal: | European Journal of Operational Research |
| Authors: | Diaby Moustapha |
| Keywords: | programming: dynamic |
This paper develops an efficient post-optimization analysis procedure for the Wagner-Whitin solution to the Dynamic Lot-Sizing Problem. 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.