On the complexity of a maintenance problem for hierarchical systems
Year of publication: |
2024
|
---|---|
Authors: | Schulz, Andreas S. ; Telha, Claudio |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 54.2024, Art.-No. 107117, p. 1-4
|
Subject: | Computational complexity | Integer-factorization | Maintenance scheduling | Instandhaltung | Maintenance policy | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Komplexe Systeme | Complex systems | Komplexitätsmanagement | Complexity management |
-
On the complexity of project scheduling to minimize exposed time
Pinker, Edieal, (2014)
-
Strategic planning through complexity : overcoming impediments to forecast and schedule
Patnaik, Rajnandan, (2012)
-
Complexity of a one-to-one meeting scheduling problem with two types of actors
Le Roux, Agnès, (2015)
- More ...
-
Integer factorization : why two-item joint replenishment is hard
Schulz, Andreas S., (2024)
-
Efficient approximation algorithms for the economic lot-sizing in continuous time
TELHA, Claudio, (2014)
-
A sequential Stackelberg game for dynamic inspection problems
Guzman, Cristobal, (2021)
- More ...