Login
- Titel:
On the complexity of a maintenance problem for hierarchical systems
- Dokumenttyp:
- Zeitschriftenaufsatz
- Autor(en):
- Schulz, Andreas S.; Telha, Claudio
- Nicht-TUM Koautoren:
- ja
- Kooperation:
- international
- Abstract:
- 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.
- Stichworte:
- adone
- Intellectual Contribution:
- Discipline-based Research
- Zeitschriftentitel:
- Operations Research Letters
- Journal gelistet in FT50 Ranking:
- nein
- Jahr:
- 2024
- Jahr / Monat:
- 2024-04
- Seitenangaben Beitrag:
- 107117
- Volltext / DOI:
- doi:10.1016/j.orl.2024.107117
- Verlag / Institution:
- Elsevier BV
- E-ISSN:
- 0167-6377
- Publikationsdatum:
- 01.04.2024
- Urteilsbesprechung:
- None
- Key publication:
- Nein
- Peer reviewed:
- Ja
- commissioned:
- not commissioned
- Technology:
- Nein
- Interdisziplinarität:
- Nein
- Leitbild:
- ;
- Ethics und Sustainability:
- Nein
- SDG:
- ;
BibTeX
Vorkommen:
- mediaTUM GesamtbestandEinrichtungenSchools TUM School of ManagementDepartmentsOperations and TechnologyLehrstuhl für Operations Research (Prof. Schulz)