Parallel solutions for preemptive makespan scheduling on two identical machines
Year of publication: |
2023
|
---|---|
Authors: | Epstein, Leah |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 26.2023, 1, p. 61-76
|
Subject: | Competitive ratio | Jobs arriving over a list | Parallel solutions | Preemptive scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time | Algorithmus | Algorithm |
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
-
Tao, Jiping, (2014)
-
Semi-online scheduling on two identical machines with rejection
Min, Xiao, (2013)
- 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 ...