A note on semi-online machine covering

0041413 - MÚ 2007 RIV DE eng C - Konferenční příspěvek (zahraniční konf.)
Ebenlendr, Tomáš - Noga, E. J. - Sgall, Jiří - Woeginger, G.
A note on semi-online machine covering.
[O semi-online pokrývání počítačů.]
Proceedings of the 3rd Workshop on Approximation and Online Algorithms (WAOA). Berlin: Springer, 2006 - (Erlebach, T.; Persinao, G.), s. 110-118. Lecture Notes in Computer Sciences, 3879. ISBN 3-540-32207-8.
[Workshop on Approximation and Online Algorithms (WAOA)/3./. Palma de Mallorca (ES), 06.10.2005-07.10.2005]
Grant CEP: GA MŠMT(CZ) 1M0545; GA ČR(CZ) GA201/05/0124
Výzkumný záměr: CEZ:AV0Z10190503
Klíčová slova: online algorithms * scheduling
Kód oboru RIV: BA - Obecná matematika

In the machine cover problem we are given $m$ machines and $n$ jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithms is given in advance the optimal value of the smallest load for the given instance, and then the jobs are scheduled one by one as they arrive, without any knowledge of the following jobs. We present a deterministic algorithm with competitive ratio $11/6/leq 1.834$ for machine covering with any number of machines and a lower bound showing that no deterministic algorithm can have a competitive ratio below $43/24/geq 1.791$.

Článek studuje semi-online pokrývání počítačů.
Trvalý link: http://hdl.handle.net/11104/0134885