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 条
  • [1] Semi-online scheduling with known maximum job size on two uniform machines
    Qian Cao
    Zhaohui Liu
    Journal of Combinatorial Optimization, 2010, 20 : 369 - 384
  • [2] 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
  • [3] Semi-online scheduling on two uniform machines with the known largest size
    Cai, Sheng-Yi
    Yang, Qi-Fan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 21 (04) : 393 - 408
  • [4] Semi-online scheduling with bounded job sizes on two uniform machines
    Cao, Qian
    Liu, Zhaohui
    THEORETICAL COMPUTER SCIENCE, 2016, 652 : 1 - 17
  • [5] Semi-online Machine Covering on Two Uniform Machines with Known Total Size
    Z. Y. Tan
    S. J. Cao
    Computing, 2006, 78 : 369 - 378
  • [6] Semi-online machine covering on two uniform machines with known total size
    Tan, Z. Y.
    Cao, S. J.
    COMPUTING, 2006, 78 (04) : 369 - 378
  • [7] 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
  • [8] 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
  • [9] 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
  • [10] 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
12345