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 | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Robustes Verfahren | Robust statistics |
-
Novak, Antonin, (2022)
-
Service-oriented robust parallel machine scheduling
Liu, Ming, (2019)
-
Robust single machine makespan scheduling with release date uncertainty
Bachtler, Oliver, (2020)
- More ...
-
Optimal algorithms for scheduling under time-of-use tariffs
Chen, Lin, (2021)
-
Drwal, Maciej, (2014)
-
Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
Drwal, Maciej, (2018)
- More ...