A dynamic policy for grouping maintenance activities
A maintenance activity carried out on a technical system often involves a system-dependent set-up cost that is the same for all maintenance activities carried out on that system. Grouping activities thus saves costs since execution of a group of activities requires only one set-up. Many maintenance models consider the grouping of maintenance activities on a long-term basis with an infinite horizon. This makes it very difficult to incorporate short-term circumstances such as opportunities or a varying use of components because these are either not known beforehand or make the problem intractable. In this paper we propose a rolling-horizon approach that takes a long-term tentative plan as a basis for a subsequent adaptation according to information that becomes available on the short term. This yields a dynamic grouping policy that assists the maintenance manager in his planning job. We present a fast approach that allows interactive planning by showing how shifts from the tentative planning work out. We illustrate our approach with examples.
|Keywords||dynamic programming, maintenance, multiple components, planning|
|Persistent URL||dx.doi.org/10.1016/S0377-2217(97)00319-6, hdl.handle.net/1765/15256|
Wildeman, R.E., Dekker, R., & Smit, A.C.J.M.. (1997). A dynamic policy for grouping maintenance activities. European Journal of Operational Research, 99(3), 530–551. doi:10.1016/S0377-2217(97)00319-6