Online Preemptive Scheduling on Parallel Machines
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10316500" target="_blank" >RIV/00216208:11320/15:10316500 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/referenceworkentry/10.1007%2F978-3-642-27848-8_501-1" target="_blank" >http://link.springer.com/referenceworkentry/10.1007%2F978-3-642-27848-8_501-1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-27848-8" target="_blank" >10.1007/978-3-642-27848-8</a>
Alternative languages
Result language
angličtina
Original language name
Online Preemptive Scheduling on Parallel Machines
Original language description
We consider an online version of the classical problem of preemptive scheduling on uniformly related machines.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
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
Book/collection name
Encyclopedia of Algorithms
ISBN
978-3-642-27848-8
Number of pages of the result
4
Pages from-to
1-4
Number of pages of the book
1000
Publisher name
Springer-Verlag
Place of publication
Berlin
UT code for WoS chapter
—