Semi-online scheduling on two uniform machines with the known largest size

被引：5
|
作者：
Cai, Sheng-Yi [1 ,2 ]
Yang, Qi-Fan [1 ]
机构：
[1] Zhejiang Univ, Dept Math, Hangzhou 310003, Zhejiang, Peoples R China
[2] Wenzhou Univ, Sch Math & Informat Sci, Wenzhou 325035, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2011年 / 21卷 / 04期
关键词：
Analysis of algorithms; Scheduling; Semi-online; Competitive ratio; Uniform machine; PROCESSORS; ALGORITHMS;
D O I：
10.1007/s10878-009-9254-5
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper investigates semi-online scheduling on two uniform machines with the known largest size. Denote by s (j) the speed of each machine, j=1,2. Assume 0 < s (1)a parts per thousand currency signs (2), and let s=s (2)/s (1) be the speed ratio.
引用
收藏
页码：393 / 408
页数：16
相关论文
共 50 条
  • [1] Semi-online scheduling on two uniform machines with the known largest size
    Sheng-Yi Cai
    Qi-Fan Yang
    Journal of Combinatorial Optimization, 2011, 21 : 393 - 408
  • [2] Semi-online scheduling with known maximum job size on two uniform machines
    Qian Cao
    Zhaohui Liu
    Journal of Combinatorial Optimization, 2010, 20 : 369 - 384
  • [3] Semi-online scheduling with known maximum job size on two uniform machines
    Cao, Qian
    Liu, Zhaohui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 20 (04) : 369 - 384
  • [4] Semi-online Machine Covering on Two Uniform Machines with Known Total Size
    Z. Y. Tan
    S. J. Cao
    Computing, 2006, 78 : 369 - 378
  • [5] Semi-online machine covering on two uniform machines with known total size
    Tan, Z. Y.
    Cao, S. J.
    COMPUTING, 2006, 78 (04) : 369 - 378
  • [6] Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
    György Dósa
    Armin Fügenschuh
    Zhiyi Tan
    Zsolt Tuza
    Krzysztof Węsek
    Central European Journal of Operations Research, 2018, 26 : 161 - 180
  • [7] Tight upper bounds for semi-online scheduling on two uniform machines with known optimum
    Dosa, Gyorgy
    Fuegenschuh, Armin
    Tan, Zhiyi
    Tuza, Zsolt
    Wesek, Krzysztof
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2018, 26 (01) : 161 - 180
  • [8] Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
    Dosa, Gyorgy
    Fuegenschuh, Armin
    Tan, Zhiyi
    Tuza, Zsolt
    Wesek, Krzysztof
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2019, 27 (04) : 1107 - 1130
  • [9] Two semi-online scheduling problems on two uniform machines
    Ng, C. T.
    Tan, Zhiyi
    He, Yong
    Cheng, T. C. E.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 776 - 792
  • [10] Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
    György Dósa
    Armin Fügenschuh
    Zhiyi Tan
    Zsolt Tuza
    Krzysztof Węsek
    Central European Journal of Operations Research, 2019, 27 : 1107 - 1130
12345