Number of the records: 1
Online scheduling of equal-length jobs on parallel machines
- 1.0096096 - MÚ 2008 RIV DE eng C - Conference Paper (international conference)
Ding, J. - Ebenlendr, Tomáš - Sgall, Jiří - Zhang, G.
Online scheduling of equal-length jobs on parallel machines.
[Online rozhodování stejně dlouhých úloh na paralelních počítačích.]
Proceedings of the 15th European Symposium on Algorithms (ESA). Berlin: Springer, 2007, s. 427-438. Lecture Notes in Computer Science, 4698. ISBN 978-3-540-75519-7.
[European Symposium on Algorithms /15./. Eilat (IL), 08.10.2007-10.10.2007]
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : Online algorithms * scheduling
Subject RIV: BA - General Mathematics
We study on-line scheduling of equal-length jobs on parallel machines. Our main result is an algorithm with competitive ratio decreasing to $e/(e-1)approx 1.58$ as the number of machine increases. For $m/geq3$, this is the first algorithm better than 2-competitive greedy algorithm.
Článek studuje online rozvrhování stejně dlouhých úloh na paralelních počítačích.
Permanent Link: http://hdl.handle.net/11104/0155538
File Download Size Commentary Version Access Ebenlendr.pdf 1 412.5 KB Publisher’s postprint require
Number of the records: 1