| Abstract: | Joint execution of maintenance activities can redua costs becausepreparative activities, like opening a machine, may be shared.Combining execution, however, also implies that activities arecamed out at times other than originally planned. In this paper,we analyse the problem of determining which activities shouldbe combined at which moments in time. We develop a methodologyto represent the cost-effectiveness of combining activities,and to identify an optimal combination plan. The method consistsof three phases: one in which penalty cost functions are derived,another in which combinations are evaluated, and finally onein which the optimal combination is obtained through a set-partitioningalgorithm. |
