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
关键词
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 条
  • [21] Online and semi-online hierarchical scheduling for load balancing on uniform machines
    Hou, Li-ying
    Kang, Liying
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (12-14) : 1092 - 1098
  • [22] Semi-online scheduling on two identical machines with rejection
    Min, Xiao
    Wang, Yuqing
    Liu, Jing
    Jiang, Min
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (03) : 472 - 479
  • [23] Semi-online machine covering for two uniform machines
    Chen, Xingyu
    Epstein, Leah
    Tan, Zhiyi
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5047 - 5062
  • [24] Semi-online scheduling problems on two uniform machines under a grade of service provision
    Lu, Xinrong
    Liu, Zhaohui
    THEORETICAL COMPUTER SCIENCE, 2013, 489 : 58 - 66
  • [25] Semi-online scheduling on two identical machines with rejection
    Xiao Min
    Yuqing Wang
    Jing Liu
    Min Jiang
    Journal of Combinatorial Optimization, 2013, 26 : 472 - 479
  • [26] Semi-online scheduling with known partial information about job sizes on two identical machines
    Cao, Qian
    Liu, Zhaohui
    Cheng, T. C. E.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (29) : 3731 - 3737
  • [27] ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES
    Zhang, An
    Jiang, Yiwei
    Tan, Zhiyi
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2011, 28 (02) : 163 - 182
  • [28] Optimal preemptive semi-online scheduling on two uniform processors
    Du, DL
    INFORMATION PROCESSING LETTERS, 2004, 92 (05) : 219 - 223
  • [29] Optimal preemptive semi-online algorithm for scheduling tightly-grouped jobs on two uniform machines
    Jiang, YW
    He, Y
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2006, 23 (01) : 77 - 88
  • [30] Online and semi-online scheduling of two machines under a grade of service provision
    Park, Jongho
    Chang, Soo Y.
    Lee, Kangbok
    OPERATIONS RESEARCH LETTERS, 2006, 34 (06) : 692 - 696