On the complexity of a maintenance problem for hierarchical systems

Simple item page
dc.coverageDOI: 10.1016/j.orl.2024.107117
dc.creatorSchulz, Andreas S.
dc.creatorTelha, Claudio
dc.date2024
dc.date.accessioned05-01-2026 18:06
dc.date.available05-01-2026 18:06
dc.description<p>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).</p>eng
dc.identifierhttps://investigadores.uandes.cl/en/publications/28942746-697c-4e49-9282-8d9da012f72c
dc.languageeng
dc.rightsinfo:eu-repo/semantics/openAccess
dc.sourcevol.54 (2024)
dc.subjectComputational complexity
dc.subjectInteger-factorization
dc.subjectMaintenance scheduling
dc.titleOn the complexity of a maintenance problem for hierarchical systemseng
dc.typeArticleeng
dc.typeArtículospa
Files
Collections
Investigación Facultad de Ingeniería y Ciencias Aplicadas