A survey on makespan minimization in semi-online environments
Year of publication: |
June 2018
|
---|---|
Authors: | Epstein, Leah |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 21.2018, 3, p. 269-284
|
Subject: | Competitive ratio | Semi-online algorithms | Bin stretching | Reassignment | Known total size | Reordering buffers | Theorie | Theory | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem |
-
Semi-online scheduling on two identical machines with rejection
Min, Xiao, (2013)
-
Online bin stretching with three bins
Böhm, Martin, (2017)
-
Tao, Jiping, (2014)
- More ...
-
The hierarchical model for load balancing on two machines
Chassid, Orion, (2008)
-
Maximizing the minimum load : the cost of selfishness
Epstein, Leah, (2009)
-
Online scheduling with a buffer on related machines
Dósa, György, (2010)
- More ...