Closing the gap for makespan scheduling via sparsification techniques
Year of publication: |
2020
|
---|---|
Authors: | Jansen, Klaus ; Klein, Kim-Manuel ; Verschae, José |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 45.2020, 4, p. 1371-1392
|
Subject: | scheduling | approximation algorithms | polynominal time approximation scheme | makespan | conditional lower bounds | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
Split scheduling with uniform setup times
Schalekamp, Frans, (2015)
-
Optimal restricted due date assignment in scheduling
Shabtay, Dvir, (2016)
-
Chen, Yong, (2021)
- More ...
-
About the structure of the integer cone and its application to bin packing
Jansen, Klaus, (2020)
-
Reducibility bounds of objective functions over the integers
Eisenbrand, Friedrich, (2023)
-
Optimal algorithms for scheduling under time-of-use tariffs
Chen, Lin, (2021)
- More ...