Preemptive Online Scheduling: Optimal Algorithms for All Speeds

被引：0
|
作者：
Tomáš Ebenlendr
Wojciech Jawor
Jiří Sgall
机构：
[1] Institute of Mathematics,Department of Computer Science
[2] University of California,undefined
来源：
Algorithmica | 2009年 / 53卷
关键词：
Online algorithms; Scheduling; Makespan;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet it is optimal even among all randomized algorithms. In addition, it is optimal for any fixed combination of speeds of the machines, and thus our results subsume all the previous work on various special cases. Together with a new lower bound it follows that the overall competitive ratio of this optimal algorithm is between 2.054 and e≈2.718. We also give a complete analysis of the competitive ratio for three machines.
引用
收藏
相关论文
共 50 条
  • [11] Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines
    Yong HE Department of Mathematics
    [J]. Acta Mathematica Sinica,English Series, 2007, 23 (01) : 165 - 174
  • [12] Optimal and online preemptive scheduling on uniformly related machines
    Ebenlendr, Tomas
    Sgall, Jiri
    [J]. JOURNAL OF SCHEDULING, 2009, 12 (05) : 517 - 527
  • [13] Optimal and online preemptive scheduling on uniformly related machines
    Tomáš Ebenlendr
    Jiří Sgall
    [J]. Journal of Scheduling, 2009, 12 : 517 - 527
  • [14] Optimal and online preemptive scheduling on uniformly related machines
    Ebenlendr, T
    Sgall, J
    [J]. STACS 2004, PROCEEDINGS, 2004, 2996 : 199 - 210
  • [15] Optimal online algorithms for minimax resource scheduling
    Hunsaker, B
    Kleywegt, AJ
    Savelsbergh, MWP
    Tovey, CA
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (04) : 555 - 590
  • [16] Semi-Online Preemptive Scheduling: One Algorithm for All Variants
    Ebenlendr, Tomas
    Sgall, Jiri
    [J]. THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) : 577 - 613
  • [17] Robust Algorithms for Preemptive Scheduling
    Epstein, Leah
    Levin, Asaf
    [J]. ALGORITHMICA, 2014, 69 (01) : 26 - 57
  • [18] Robust Algorithms for Preemptive Scheduling
    Epstein, Leah
    Levin, Asaf
    [J]. ALGORITHMS - ESA 2011, 2011, 6942 : 567 - 578
  • [19] Semi-Online Preemptive Scheduling: One Algorithm for All Variants
    Tomáš Ebenlendr
    Jiří Sgall
    [J]. Theory of Computing Systems, 2011, 48 : 577 - 613
  • [20] Robust Algorithms for Preemptive Scheduling
    Leah Epstein
    Asaf Levin
    [J]. Algorithmica, 2014, 69 : 26 - 57
12345