Preemptive Semi-online Algorithms for Parallel Machine Scheduling with Known Total Size

被引：2
|
作者：
Yong HE
Hao ZHOU
Yi Wei JIANG
机构：
[1] Department of Mathematics, Zhejiang University
[2] State Key Lab of CAD & CG, Zhejiang University
来源：
Acta Mathematica Sinica,English Series | 2006年 / 22卷 / 02期
基金：
中国国家自然科学基金;
关键词：
Semi-online; Preemptive scheduling; Competitive analysis;
D O I：
暂无
中图分类号：
TP301.6 [算法理论]; O224 [最优化的数学理论];
学科分类号：
070105 ; 081202 ; 1201 ;
摘要：
This paper investigates preemptive semi-online scheduling problems on m identical parallel machines, where the total size of all jobs is known in advance. The goal is to minimize the maximum machine completion time or maximize the minimum machine completion time. For the first objective, we present an optimal semi-online algorithm with competitive ratio 1. For the second objective, we show that the competitive ratio of any semi-online algorithm is at least (2m-3)/(m-1) for any m>2 and present optimal semi-online algorithms for m=2, 3.
引用
收藏
页码：587 / 594
页数：8
相关论文
共 50 条
  • [1] 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
  • [2] Preemptive Semi–online Algorithms for Parallel Machine Scheduling with Known Total Size
    Yong He
    Hao Zhou
    Yi Wei Jiang
    [J]. Acta Mathematica Sinica, 2006, 22 : 587 - 594
  • [3] Semi-online algorithms for parallel machine scheduling problems
    Dósa, G
    He, Y
    [J]. COMPUTING, 2004, 72 (3-4) : 355 - 363
  • [4] Semi-Online Algorithms for Parallel Machine Scheduling Problems
    G. Dósa
    Y. He
    [J]. Computing, 2004, 72 : 355 - 363
  • [5] 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
  • [6] Semi-Online Algorithms for Scheduling with Machine Cost
    Yi-Wei Jiang
    Yong He
    [J]. Journal of Computer Science and Technology, 2006, 21 : 984 - 988
  • [7] Semi-online Machine Covering on Two Uniform Machines with Known Total Size
    Z. Y. Tan
    S. J. Cao
    [J]. Computing, 2006, 78 : 369 - 378
  • [8] Semi-online machine covering on two uniform machines with known total size
    Tan, Z. Y.
    Cao, S. J.
    [J]. COMPUTING, 2006, 78 (04) : 369 - 378
  • [9] Preemptive semi-online scheduling on parallel machines with inexact partial information
    He, Y
    Jiang, YW
    [J]. ALGORITHMS AND COMPUTATION, 2005, 3827 : 422 - 432
  • [10] 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
12345