2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
Year of publication: |
2022
|
---|---|
Authors: | Krumke, Sven O. ; Le, Huy Minh |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 50.2022, 6, p. 732-737
|
Subject: | Scheduling-location | Approximation algorithms | Uncertainty | Robust optimization | Lateness | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Robustes Verfahren | Robust statistics | Entscheidung unter Unsicherheit | Decision under uncertainty |
-
A robust optimization model for a supply chain under uncertainty
Hosseini, Sara, (2014)
-
Robust Wagner-Whitin algorithm with uncertain costs
Hanafizadeh, Payam, (2019)
-
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Chassein, André, (2019)
- More ...
-
Robust absolute single machine makespan scheduling-location problem on trees
Krumke, Sven O., (2020)
-
Robust single machine makespan scheduling with release date uncertainty
Bachtler, Oliver, (2020)
-
The generalized assignment problem with minimum quantities
Krumke, Sven O., (2013)
- More ...