TY - JOUR
T1 - On the complexity of a maintenance problem for hierarchical systems
AU - Schulz, Andreas S.
AU - Telha, Claudio
N1 - Publisher Copyright:
© 2024 Elsevier B.V.
PY - 2024/5
Y1 - 2024/5
N2 - 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).
AB - 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).
KW - Computational complexity
KW - Integer-factorization
KW - Maintenance scheduling
UR - http://www.scopus.com/inward/record.url?scp=85192973104&partnerID=8YFLogxK
U2 - 10.1016/j.orl.2024.107117
DO - 10.1016/j.orl.2024.107117
M3 - Article
AN - SCOPUS:85192973104
SN - 0167-6377
VL - 54
JO - Operations Research Letters
JF - Operations Research Letters
M1 - 107117
ER -