Number of the records: 1  

Optimal and online preemptive scheduling on uniformly related machines

  1. 1.
    SYSNO0334957
    TitleOptimal and online preemptive scheduling on uniformly related machines
    TitleOptimální a online preemptivní rozvrhování na uniformních počítačích
    Author(s) Ebenlendr, Tomáš (MU-W) SAI, RID
    Sgall, J. (CZ)
    Source Title Journal of Scheduling. Roč. 12, č. 5 (2009), s. 517-527
    Document TypeČlánek v odborném periodiku
    Grant 1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
    IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    IAA1019401 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountryUS
    Keywords online scheduling * preemption * uniformly related machines
    Permanent Linkhttp://hdl.handle.net/11104/0179562
    FileDownloadSizeCommentaryVersionAccess
    Ebenlendr.pdf1424.8 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.