A lower bound for scheduling of unit jobs with immediate decision on parallel machines KAM-DIMATIA Series 2008-896 and ITI Series 2008-417

0318602 - MÚ 2009 RIV CZ eng O - Others
Ebenlendr, Tomáš - Sgall, Jiří
A lower bound for scheduling of unit jobs with immediate decision on parallel machines KAM-DIMATIA Series 2008-896 and ITI Series 2008-417.
[Dolní odhad pro rozvrhování jednotkových úloh s okamžitým rozhodnutím na paralelních počítačích.]
2008
R&D Projects: GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling
Subject RIV: BA - General Mathematics

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)approx 1.58$ for many machines, matching the performance of the best algorithm.

Dokazujeme asymptoticky optimální 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/0167972