On the complexity of a maintenance problem for hierarchical systems

Andreas S. Schulz, Claudio Telha*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We prove that a maintenance problem on frequency-constrained maintenance jobs with a hierarchical structure is integer-factorization hard. This result holds even on simple systems with just two components to maintain. As a corollary, we provide a first hardness result for Levi et al.'s modular maintenance scheduling problem (Levi et al. 2014).

Original languageEnglish
Article number107117
JournalOperations Research Letters
StatePublished - May 2024

Bibliographical note

Publisher Copyright:
© 2024 Elsevier B.V.


  • Computational complexity
  • Integer-factorization
  • Maintenance scheduling


Dive into the research topics of 'On the complexity of a maintenance problem for hierarchical systems'. Together they form a unique fingerprint.

Cite this