Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
Year of publication: |
May 2016
|
---|---|
Authors: | Drwal, Maciej ; Rischke, Roman |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 3, p. 354-358
|
Subject: | Robust optimization | Scheduling | Uncertainty | Computational complexity | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Entscheidung unter Unsicherheit | Decision under uncertainty | Mathematische Optimierung | Mathematical programming | Durchlaufzeit | Lead time | Heuristik | Heuristics | Robustes Verfahren | Robust statistics |
-
Pereira, Jordi, (2016)
-
Samouei, Parvaneh, (2023)
-
Exact solutions for the two-machine robust flow shop with budgeted uncertainty
Levorato, Mario, (2022)
- More ...
-
Optimal algorithms for scheduling under time-of-use tariffs
Chen, Lin, (2021)
-
Drwal, Maciej, (2014)
-
Drwal, Maciej, (2020)
- More ...