Number of the records: 1  

Preemptive Online Scheduling: Optimal Algorithms for All Speeds

  1. 1.
    SYSNO0334960
    TitlePreemptive Online Scheduling: Optimal Algorithms for All Speeds
    TitlePreemptivní online rozvrhování: optimální algoritmy pro všechny rychlosti
    Author(s) Ebenlendr, Tomáš (MU-W) SAI, RID
    Jawor, W. (US)
    Sgall, Jiří (MU-W) RID, ORCID, SAI
    Source Title Algorithmica. Roč. 53, č. 4 (2009), s. 504-522. - : Springer
    Document TypeČlánek v odborném periodiku
    Grant 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
    GA201/05/0124 GA ČR - Czech Science Foundation (CSF)
    IAA1019401 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountryUS
    Keywords anline algorithms * scheduling
    Permanent Linkhttp://hdl.handle.net/11104/0179564
    FileDownloadSizeCommentaryVersionAccess
    Ebenlendr1.pdf1435.2 KBPublisher’s postprintrequire
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.