Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
Year of publication: |
2023
|
---|---|
Authors: | Wu, Wei ; Hayashi, Takito ; Haruyasu, Kato ; Tang, Liang |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 307.2023, 1 (16.5.), p. 82-102
|
Subject: | Scheduling | Batch scheduling | Robust optimization | Shortest path problem | Polynomial-time algorithm | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics |
-
The K-server problem via a modern optimization lens
Bertsimas, Dimitris, (2019)
-
An adaptive robust optimization model for parallel machine scheduling
Cohen, Izack, (2023)
-
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
Álvarez-Miranda, Eduardo, (2013)
- More ...
-
Wencel, Fred E, (2011)
-
Lee, Ju Yup, (2011)
-
Tang, Liang, (2009)
- More ...