Semi-online preemptive scheduling: one algorithm for all variants

0370277 - MÚ 2012 RIV US eng J - Článek v odborném periodiku
Ebenlendr, Tomáš - Sgall, J.
Semi-online preemptive scheduling: one algorithm for all variants.
Theory of Computing Systems. Roč. 48, č. 3 (2011), s. 577-613. ISSN 1432-4350. E-ISSN 1433-0490.
[26th International Symposium on Theoretical Aspects of Computer Science. Freiburg, 26.02.2009-28.02.2009]
Grant CEP: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Výzkumný záměr: CEZ:AV0Z10190503
Klíčová slova: online algorithms * scheduling * preemption * linear program
Kód oboru RIV: BA - Obecná matematika
Impakt faktor: 0.442, rok: 2011
http://www.springerlink.com/content/k66u6tv1l7731654/

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.
Trvalý link: http://hdl.handle.net/11104/0204123