A lower bound for scheduling of unit jobs with immediate decision on parallel machines

0334971 - MÚ 2010 RIV DE eng C - Conference Paper (international conference)
Ebenlendr, Tomáš - Sgall, Jiří
A lower bound for scheduling of unit jobs with immediate decision on parallel machines.
[Dolní odhad pro rozhodování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích.]
Approximation and online algorithms. Berlin: Springer, 2009 - (Bampis, E.; Skutella, M.), s. 43-52. Lecture notes in computer science, 5426. ISBN 978-3-540-93979-5.
[6th International Workshop on Approximation and Online Algorithms. Karlsruhe (DE), 18.09.2008-19.09.2008]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science

Consider scheduling of unit jobs with release times and deadlines on m. identical machines with the objective to maximize the number of jobs completed before their deadlines. We prove a new lower bound for online algorithms with immediate decision. This means that the jobs arrive over time and the algorithm has to decide the schedule of each job immediately upon its release. Our lower bound tends to e/(e-1) approximate to 1.58 for many machines, matching the performance of the best algorithm.

Dokazujeme asymptotický optimální dolní odhad pro rozvrhování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích.
Permanent Link: http://hdl.handle.net/11104/0179571