Maintenance scheduling for modular systems: Modeling and algorithms

Retsef Levi, Thomas Magnanti, Jack Muckstadt, Danny Segev, Eric Zarybnisky

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)472-488
Number of pages17
JournalNaval Research Logistics
Volume61
Issue number6
DOIs
StatePublished - Sep 2014
Externally publishedYes

Keywords

  • approximation algorithms
  • cycle-limited components
  • maintenance scheduling
  • submodular costs

Fingerprint

Dive into the research topics of 'Maintenance scheduling for modular systems: Modeling and algorithms'. Together they form a unique fingerprint.

Cite this