Semi-online algorithms for parallel machine scheduling problems

被引：24
|
作者：
Dósa, G
He, Y
机构：
[1] Univ Veszprem, Dept Math, H-8201 Veszprem, Hungary
[2] Zhejiang Univ, Dept Math, Hangzhou 310027, Peoples R China
[3] Zhejiang Univ, State Key Lab CAD & CG, Hangzhou 310027, Peoples R China
来源：
COMPUTING | 2004年 / 72卷 / 3-4期
关键词：
scheduling; semi-online; approximation algorithm; competitive analysis;
D O I：
10.1007/s00607-003-0034-2
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper considers two semi-online versions of scheduling problem P2\\C-max where one type of partial information is available and one type of additional algorithmic extension is allowed simultaneously. For the semi-online version where a buffer of length 1 is available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 5/4. We also show that it does not help that the buffer length is greater than 1. For the semi-online version where two parallel processors are available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 6/5.
引用
收藏
页码：355 / 363
页数：9
相关论文
共 50 条
  • [1] Semi-Online Algorithms for Parallel Machine Scheduling Problems
    G. Dósa
    Y. He
    [J]. Computing, 2004, 72 : 355 - 363
  • [2] Semi-online algorithms for scheduling with machine cost
    Jiang, Yi-Wei
    He, Yong
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (06): : 984 - 988
  • [3] Semi-Online Algorithms for Scheduling with Machine Cost
    Yi-Wei Jiang
    Yong He
    [J]. Journal of Computer Science and Technology, 2006, 21 : 984 - 988
  • [4] Preemptive Semi-online Algorithms for Parallel Machine Scheduling with Known Total Size
    Yong HE
    Hao ZHOU
    Yi Wei JIANG
    [J]. Acta Mathematica Sinica,English Series, 2006, 22 (02) : 587 - 594
  • [5] Preemptive semi-online algorithms for parallel machine scheduling with known total size
    He, Y
    Zhou, H
    Jiang, YW
    [J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2006, 22 (02) : 587 - 594
  • [6] Best semi-online algorithms for unbounded parallel batch scheduling
    Yuan, Jinjiang
    Ng, C. T.
    Cheng, T. C. E.
    [J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (08) : 838 - 847
  • [7] Optimal semi-online algorithms for scheduling with machine activation cost
    Han, Shuguang
    Jiang, Yiwei
    Hu, Jueliang
    [J]. COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 198 - +
  • [8] Semi-online scheduling with machine cost
    Yong He
    Shengyi Cai
    [J]. Journal of Computer Science and Technology, 2002, 17 : 781 - 787
  • [9] Semi-online scheduling with machine cost
    He, Y
    Cai, SY
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2002, 17 (06): : 781 - 787
  • [10] Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
    He, Y
    Jiang, Y
    [J]. ACTA INFORMATICA, 2004, 40 (05) : 367 - 383
12345