Online scheduling of equal-length jobs on parallel machines
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F07%3A00096096" target="_blank" >RIV/67985840:_____/07:00096096 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Online scheduling of equal-length jobs on parallel machines
Original language description
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.
Czech name
Online rozhodování stejně dlouhých úloh na paralelních počítačích
Czech description
Článek studuje online rozvrhování stejně dlouhých úloh na paralelních počítačích.
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 15th European Symposium on Algorithms (ESA)
ISBN
978-3-540-75519-7
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
427-438
Publisher name
Springer
Place of publication
Berlin
Event location
Eilat
Event date
Oct 8, 2007
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—