direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Logo der TU Berlin

Inhalt des Dokuments

Preprint 20-2008

Combinatorial Optimization & Graph Algorithms group (COGA-Preprints)

Online Scheduling with Bounded Migration
Peter Sanders, Naveen Sivadasan, and Martin Skutella
Submitted. An extended abstract appeared in J. Diaz, J. Karhumäki, A. Lepistö, and D. Sannella (eds.): Automata, Languages and Programming, Lecture Notes in Computer Science 3142, Springer: Berlin, 2004, 1111-1122, Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04).
not available
scheduling; approximation; online algorithm; sensitivity analysis
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We generalize this problem by allowing the current assignment to be changed whenever a new job arrives, subject to the constraint that the total size of moved jobs is bounded by β times the size of the arriving job. For small values of β, we obtain several simple online algorithms with constant competitive ratio. We also present a linear time "online approximation scheme', that is, a family of online algorithms with competitive ratio 1+ε and constant migration factor β(ε), for any fixed ε>0.
Created on June 12 2008
Download as [PDF]
Title: Source

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe