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 |
-
Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
Epstein, Leah, (2014)
-
How small are shifts required in optimal preemptive schedules?
Coffman, Edward G., (2015)
-
Epstein, Leah, (2017)
- 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 ...