Semi-online preemptive scheduling: one algorithm for all variants

0334967 - MÚ 2010 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Sgall, Jiří
Semi-online preemptive scheduling: one algorithm for all variants.
[Semi-online preemptivní rozvrhování: jeden algoritmus pro všechny varianty.]
26th International Symposium on Theoretical Aspects of Computer Science. Leibniz: Schloss Dagstuhl, 2009 - (Albers, S.; Marion, J.), s. 349-360. ISBN 978-3-939897-09-5.
[26th International Symposium on Theoretical Aspects of Computer Science. Freiburg (DE), 26.02.2009-28.02.2009]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science

We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for all types of semi-online restrictions, including the ones studied before, like sorted (decreasing) jobs, known sum of processing times, known maximal processing time, their combinations, and so on. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation ratios for a small number of machines.

Navrhujeme optimální algoritmy pro širokou třídu problémů z oblasti rozvrhování.
Permanent Link: http://hdl.handle.net/11104/0179568