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 | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Heuristik | Heuristics | Produktionssteuerung | Production control | Theorie | Theory |
-
Epstein, Leah, (2017)
-
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas, Imma, (2013)
-
Ozturk, Onur, (2012)
- More ...
-
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
Epstein, Leah, (2002)
-
Optimal preemptive semi-online scheduling to minimize makespan on two related machines
Epstein, Leah, (2002)
-
Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
Epstein, Leah, (2001)
- More ...