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 条
  • [1] Preemptive Online Scheduling: Optimal Algorithms for All Speeds
    Ebenlendr, Tomas
    Jawor, Wojciech
    Sgall, Jiri
    [J]. ALGORITHMICA, 2009, 53 (04) : 504 - 522
  • [2] Preemptive online scheduling: Optimal algorithms for all speeds
    Ebenlendr, Tomas
    Jawor, Wojciech
    Sgall, Jiri
    [J]. ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 327 - 339
  • [3] Preemptive online algorithms for scheduling with machine cost
    Jiang, YW
    He, Y
    [J]. ACTA INFORMATICA, 2005, 41 (06) : 315 - 340
  • [4] Preemptive online algorithms for scheduling with machine cost
    Yiwei Jiang
    Yong He
    [J]. Acta Informatica, 2005, 41 : 315 - 340
  • [5] Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
    Yiwei Jiang
    Yong He
    [J]. Acta Informatica, 2007, 44 : 571 - 590
  • [6] Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
    Jiang, Yiwei
    He, Yong
    [J]. ACTA INFORMATICA, 2007, 44 (7-8) : 571 - 590
  • [7] Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
    He, Y
    Jiang, Y
    [J]. ACTA INFORMATICA, 2004, 40 (05) : 367 - 383
  • [8] Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines
    Yong He
    Yi Wei Jiang
    Hao Zhou
    [J]. Acta Mathematica Sinica, English Series, 2007, 23 : 165 - 174
  • [9] Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
    He, Yong
    Jiang, Yi Wei
    Zhou, Hao
    [J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2007, 23 (01) : 165 - 174
  • [10] Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
    Yong He
    Yiwei Jiang
    [J]. Acta Informatica, 2004, 40 : 367 - 383
12345