Article ID: | iaor19982138 |
Country: | Netherlands |
Volume: | 89 |
Issue: | 1 |
Start Page Number: | 86 |
End Page Number: | 99 |
Publication Date: | Feb 1996 |
Journal: | European Journal of Operational Research |
Authors: | Kimms A. |
Keywords: | heuristics |
This paper presents a mixed-integer program for the dynamic lot sizing and scheduling problem in a multi-level, single-machine environment. It turns out that in contrast to single-level problems the integration of initial inventory is a crucial aspect if generality should not be lost. It is shown how problem instances can efficiently be solved to suboptimality by using a so-called randomized regret based heuristic.