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 (Naval Research Logistics 61, 472-488, 2014).
Cite
@article{arxiv.2312.17569,
title = {On the complexity of a maintenance problem for hierarchical systems},
author = {Andreas S. Schulz and Claudio Telha},
journal= {arXiv preprint arXiv:2312.17569},
year = {2024}
}