Preemptive scheduling on uniformly related machines : minimizing the sum of the largest pair of job completion times
Year of publication: |
April 2017
|
---|---|
Authors: | Epstein, Leah ; Yatsiv, Ido |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 2, p. 115-127
|
Subject: | Uniformly related machines | Preemptive scheduling | Makespan completion times | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Heuristik | Heuristics |
-
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
Epstein, Leah, (2014)
-
Online fractional hierarchical scheduling on uniformly related machines
Liu, Zhaohui, (2020)
-
An exact algorithm for the preemptive single machine scheduling of equal-length jobs
Fomin, Artem, (2022)
- 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 ...