Preemptive Online Scheduling: Optimal Algorithms for All Speeds

0334960 - MÚ 2010 RIV US eng J - Článek v odborném periodiku
Ebenlendr, Tomáš - Jawor, W. - Sgall, Jiří
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
[Preemptivní online rozvrhování: optimální algoritmy pro všechny rychlosti.]
Algorithmica. Roč. 53, č. 4 (2009), s. 504-522. ISSN 0178-4617. E-ISSN 1432-0541
Grant CEP: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Výzkumný záměr: CEZ:AV0Z10190503
Klíčová slova: anline algorithms * scheduling
Kód oboru RIV: IN - Informatika
Impakt faktor: 0.917, rok: 2009

Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet it is optimal even among all randomized algorithms. In addition, it is optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. Together with a new lower bound it follows that the overall competitive ratio of this optimal algorithm is between 2.054 and e approximate to 2.718.

Článek studuje optimální online algoritmy pro preemptivní rozvrhování.
Trvalý link: http://hdl.handle.net/11104/0179564