Optimal and online preemptive scheduling on uniformly related machines

We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4-competitive deterministic and an e ≈2.71-competi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of scheduling 2009-10, Vol.12 (5), p.517-527
Hauptverfasser:	Ebenlendr, Tomáš, Sgall, Jiří
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Artificial Intelligence Business and Management Calculus of Variations and Optimal Control Optimization Competition Operations Research/Decision Theory Optimization Production scheduling Ratios Schedules Scheduling Studies Supply Chain Management
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an optimal schedule. Using the standard doubling technique, this yields a 4-competitive deterministic and an e ≈2.71-competitive randomized online algorithm. In addition, it matches the performance of the previously known algorithms for the offline case, with a considerably simpler proof. Finally, we study the performance of greedy heuristics for the same problem.
ISSN:	1094-6136 1099-1425
DOI:	10.1007/s10951-009-0119-7