Maintenance scheduling for modular systems: Modeling and algorithms |
| |
| Authors: | Retsef Levi Thomas Magnanti Jack Muckstadt Danny Segev Eric Zarybnisky |
| |
| Institution: | 1. Sloan School of Management, Massachusetts Institute of Technology, , Cambridge, Massachusetts, 02139;2. Institute Professor, Massachusetts Institute of Technology, , Cambridge, Massachusetts, 02139;3. President, Singapore University of Technology and Design, , Singapore, 138682;4. School of Operations Research and Information Engineering, Cornell University, , Ithaca, New York, 14853;5. Department of Statistics, University of Haifa, , Haifa, 31905 Israel;6. Operations Research Center, Massachusetts Institute of Technology, , Cambridge, Massachusetts, 02139 |
| |
| Abstract: | We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014 |
| |
| Keywords: | approximation algorithms maintenance scheduling submodular costs cycle‐limited components |
|
|
