Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
Year of publication: |
2014
|
---|---|
Authors: | Epstein, Leah ; Zebedat-Haider, Hanan |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 17.2014, 1, p. 87-93
|
Subject: | Online scheduling | Uniformly related machines | Speed ratio | Preemptive scheduling | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Heuristik | Heuristics | Psychologie | Psychology |
-
Epstein, Leah, (2017)
-
Online fractional hierarchical scheduling on uniformly related machines
Liu, Zhaohui, (2020)
-
Valente, Jorge M. S., (2008)
- 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 ...