Algorithms and complexity analysis for robust single-machine scheduling problems
Year of publication: |
2015
|
---|---|
Authors: | Tadayon, Bita ; Smith, J. Cole |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 18.2015, 6, p. 575-592
|
Subject: | Robust optimization | Dynamic programming | Integer programming | Complexity | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Robustes Verfahren | Robust statistics | Ganzzahlige Optimierung | Dynamische Optimierung |
-
Robust MILP formulations for the two-stage weighted vertex p-center problem
Duran-Mateluna, Cristian, (2023)
-
Complexity of strict robust integer minimum cost flow problems : an overview and further results
Chassein, André, (2019)
-
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
Yanıkoğlu, İhsan, (2022)
- More ...
-
Minimum‐cost flow problems having arc‐activation costs
Curry, Robert M., (2021)
-
Shortest path interdiction problem with arc improvement recourse : A multiobjective approach
Holzmann, Tim, (2019)
-
Garg, Manish, (2008)
- More ...