User: Guest  Login
Title:

On the complexity of a maintenance problem for hierarchical systems

Document type:
Zeitschriftenaufsatz
Author(s):
Schulz, Andreas S.; Telha, Claudio
Non-TUM Co-author(s):
ja
Cooperation:
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.
Keywords:
adone
Intellectual Contribution:
Discipline-based Research
Journal title:
Operations Research Letters
Journal listet in FT50 ranking:
nein
Year:
2024
Year / month:
2024-04
Pages contribution:
107117
Fulltext / DOI:
doi:10.1016/j.orl.2024.107117
Publisher:
Elsevier BV
E-ISSN:
0167-6377
Date of publication:
01.04.2024
Judgement review:
None
Key publication:
Nein
Peer reviewed:
Ja
Commissioned:
not commissioned
Technology:
Nein
Interdisciplinarity:
Nein
Mission statement:
;
Ethics and Sustainability:
Nein
SDG:
;
 BibTeX