Semi-online scheduling with known maximum job size on two uniform machines

被引：4
|
作者：
Cao, Qian [1 ]
Liu, Zhaohui [1 ]
机构：
[1] E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2010年 / 20卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Scheduling; Uniform machines; Semi-online; PROCESSORS; BOUNDS;
D O I：
10.1007/s10878-009-9214-0
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we investigate the semi-online scheduling problem with known maximum job size on two uniform machines with the speed ratio s >= 1. The objective is to minimize the makespan. Two algorithms are presented, where the first is optimal for 1.559 <= s <= 2 and s >= 3+root 17/2 . In addition, the improvement on lower bounds is made for 2 < s < 3+root 17/2.
引用
收藏
页码：369 / 384
页数：16
相关论文
共 50 条
  • [21] 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
  • [22] Semi-online machine covering for two uniform machines
    Chen, Xingyu
    Epstein, Leah
    Tan, Zhiyi
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (47-49) : 5047 - 5062
  • [23] 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
  • [24] 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
  • [25] 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
  • [26] Optimal preemptive semi-online scheduling on two uniform processors
    Du, DL
    INFORMATION PROCESSING LETTERS, 2004, 92 (05) : 219 - 223
  • [27] Semi-online scheduling with decreasing job sizes
    Seiden, S
    Sgall, J
    Woeginger, G
    OPERATIONS RESEARCH LETTERS, 2000, 27 (05) : 215 - 221
  • [28] 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
  • [29] 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
  • [30] Preemptive Semi-online Algorithms for Parallel Machine Scheduling with Known Total Size
    Yong HE
    Hao ZHOU
    Yi Wei JIANG
    Acta Mathematica Sinica(English Series), 2006, 22 (02) : 587 - 594
12345