We consider the problem of planning preventive maintenance and overhaul for modules that occur in a eet of assets such as trains or airplanes. Each type of module, or rotable, has its own maintenance program in which a maximum amount of time between overhauls of a module is stipulated. Overhauls are performed in an overhaul workshop with limited capacity. The problem we study is to determine aggregate workforce levels, turn-around-stock levels of modules, and overhaul and replacement quantities per period so as to minimize to sum of labor costs, material costs of over- haul, and turn-around-stock investments over the entire life-cycle of the system to be maintained. We prove that this planning problem is strongly NP-hard, but we also provide computational evidence that the mixed integer programming formulation can be solved within reasonable time for real-life instances. Furthermore, we show that the linear programming relaxation can also be used to aid decision making. We apply the model in a case study.
|Plaats van productie||Eindhoven|
|Uitgeverij||Technische Universiteit Eindhoven|
|Status||Gepubliceerd - 2012|
|Naam||BETA publicatie : working papers|
|ISSN van geprinte versie||1386-9213|
Arts, J. J., Flapper, S. D. P., & Vernooij, K. (2012). Aggregate overhaul and supply chain planning for rotables. (BETA publicatie : working papers; Vol. 369). Eindhoven: Technische Universiteit Eindhoven.