Scheduling of independent dedicated multiprocessor tasks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F02%3A00003916" target="_blank" >RIV/00216208:11320/02:00003916 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Scheduling of independent dedicated multiprocessor tasks
Original language description
The paper shows that a variant of greedy algorithm is asymptotically optimal for various scheduling problems.
Czech name
—
Czech description
—
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
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
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
Algorithms and Computation
ISBN
3-540-00142-5
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
391-402
Publisher name
Springer-Verlag
Place of publication
Vancouver
Event location
Vancouver
Event date
Jan 1, 2002
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—