ON-LINE PREEMPTIVE SCHEDULING ON UNIFORM MACHINES

被引：1
|
作者：
ZHANG Yuzhong (Institute of Operations Research
机构：
来源：
Journal of Systems Science & Complexity | 2001年 / 04期
基金：
中国国家自然科学基金;
关键词：
On-line scheduling; uniformly related machines; preemption; competitive ratio;
D O I：
暂无
中图分类号：
O223 [统筹方法];
学科分类号：
070105 ; 1201 ;
摘要：
We address the problem of preemptively schedule on-line jobs on arbitrary m uniformly related machines with the objective of minimizing the schedule length. We provide the first on-line algorithm for this general problem, and show that the algorithm has a competitive ratio of 1 ± σ, where a (m - 1)s1/(si +…+ sm), S1 S2 Sm being the speeds of the m machines.
引用
收藏
页码：373 / 377
页数：5
相关论文
共 50 条
  • [1] Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
    Dósa, G
    He, Y
    [J]. COMPUTING, 2006, 76 (1-2) : 149 - 164
  • [2] Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines
    G. Dósa
    Y. He
    [J]. Computing, 2006, 76 : 149 - 164
  • [3] On-line preemptive machine scheduling with lp norm on two uniform machines
    Shuai, Tianping
    Du, Donglei
    Jiang, Xiaoyue
    [J]. JOURNAL OF SCHEDULING, 2015, 18 (02) : 185 - 194
  • [4] An optimal on-line algorithm for preemptive scheduling on two uniform machines in the lp norm
    Shuai, Tianping
    Du, Donglei
    Jiang, Xiaoyue
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2008, 5034 : 316 - +
  • [5] Preemptive on-line scheduling for two uniform processors
    Wen, JJ
    Du, DL
    [J]. OPERATIONS RESEARCH LETTERS, 1998, 23 (3-5) : 113 - 116
  • [6] Randomized on-line scheduling on two uniform machines
    Epstein, L
    Noga, J
    Seiden, S
    Sgall, J
    Woeginger, G
    [J]. JOURNAL OF SCHEDULING, 2001, 4 (02) : 71 - 92
  • [7] Ordinal on-line scheduling on two uniform machines
    Tan, ZY
    He, Y
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 232 - 241
  • [8] A PARALLEL ALGORITHM FOR PREEMPTIVE SCHEDULING OF UNIFORM MACHINES
    MARTEL, CU
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1988, 5 (06) : 700 - 715
  • [9] Scheduling uniform machines on-line requires nondecreasing speed ratios
    Arjen P. A. Vestjens
    [J]. Mathematical Programming, 1998, 82 : 225 - 234
  • [10] On-Line Scheduling of Unit Time Jobs with Rejection on Uniform Machines
    Shoupeng Liu
    Yuzhong Zhang
    [J]. Journal of Systems Science and Complexity, 2008, 21 : 114 - 118
12345