Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
Year of publication: |
2023
|
---|---|
Authors: | Sgall, Jiří ; Woeginger, Gerhard J. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 51.2023, 6, p. 583-590
|
Subject: | Makespan | Online algorithms | Parallel jobs | Preemption | Scheduling | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Durchlaufzeit | Lead time |
-
Scheduling on identical machines with preemption and setup times
Haned, Amina, (2024)
-
Lower bounds for online makespan minimization on a small number of related machines
Jeż, Łukasz, (2013)
-
Ma, Ran, (2014)
- More ...
-
Lower bounds for online makespan minimization on a small number of related machines
Jeż, Łukasz, (2013)
-
Lower bounds for online makespan minimization on a small number of related machines
Jeż, Łukasz, (2013)
-
Algorithms for testing fault-tolerance of sequenced jobs
Chrobak, Marek, (2009)
- More ...