Resumen
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).
Idioma original | Inglés |
---|---|
Número de artículo | 107117 |
Publicación | Operations Research Letters |
Volumen | 54 |
DOI | |
Estado | Publicada - may. 2024 |
Nota bibliográfica
Publisher Copyright:© 2024 Elsevier B.V.