Article ID: | iaor199991 |
Country: | Netherlands |
Volume: | 91 |
Issue: | 1 |
Start Page Number: | 74 |
End Page Number: | 88 |
Publication Date: | May 1996 |
Journal: | European Journal of Operational Research |
Authors: | Dekker R., Wildeman R.E., Egmond R. van |
Keywords: | programming: dynamic |
We consider the problem of combining replacements of multiple components in an operational planning phase. Within an infinite or finite time horizon, decisions concerning replacement of components are made at discrete time epochs. The optimal solution of this problem is limited to only a small number of components. We present a heuristic rolling horizon approach that decomposes the problem; at each decision epoch an initial plan is made that addresses components separately, and subsequently a deviation from this plan is allowed to enable joint replacement. This approach provides insight into why certain actions are taken. The time needed to determine an action at a certain epoch is only quadratic in the number of components. After dealing with harmonisation and horizon effects, our approach yields average costs less than 1% above the minimum value.