Lower bounds for online makespan minimization on a small number of related machines
Year of publication: |
2013
|
---|---|
Authors: | Jeż, Łukasz ; Schwartz, Jarett ; Sgall, Jiří ; Békési, József |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 16.2013, 5, p. 539-547
|
Subject: | Online algorithms | Scheduling | Makespan | Related machines | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Künstliche Intelligenz | Artificial intelligence | Theorie | Theory |
-
Scheduling with periodic availability constraints to minimize makespan
Yu, Lishi, (2024)
-
Wang, Zhenyou, (2017)
-
Single-machine scheduling with job-dependent machine deterioration
Luo, Wenchang, (2019)
- More ...
-
Lower bounds for online makespan minimization on a small number of related machines
Jeż, Łukasz, (2013)
-
Online algorithms for multilevel aggregation
Bienkowski, Marcin, (2020)
-
Algorithms for testing fault-tolerance of sequenced jobs
Chrobak, Marek, (2009)
- More ...