The Power of Reordering for Online Minimum Makespan Scheduling

In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to $m$ parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. In this paper,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 2014-01, Vol.43 (3), p.1220-1237
Hauptverfasser:	Englert, Matthias, Ozmen, Deniz, Westermann, Matthias
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Buffers Competition Computation Computer science Employment Job shops Online Optimization Power Ratios Schedules Scheduling Storage capacity
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!