A lower bound for scheduling of unit jobs with immediate decision 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_____%2F09%3A00334971" target="_blank" >RIV/67985840:_____/09:00334971 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A lower bound for scheduling of unit jobs with immediate decision on parallel machines
Original language description
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. Thismeans 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
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
Approximation and online algorithms
ISBN
978-3-540-93979-5
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
Springer
Place of publication
Berlin
Event location
Karlsruhe
Event date
Sep 18, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000264413000004