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 条
  • [31] Preemptive semi-online algorithms for parallel machine scheduling with known total size
    He, Y
    Zhou, H
    Jiang, YW
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2006, 22 (02) : 587 - 594
  • [32] Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines
    Dai, Bingfei
    Li, Jianping
    Li, Weidong
    PROCEEDINGS OF 2018 THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE (CSAI 2018) / 2018 THE 10TH INTERNATIONAL CONFERENCE ON INFORMATION AND MULTIMEDIA TECHNOLOGY (ICIMT 2018), 2018, : 609 - 614
  • [33] Semi-online scheduling with combined information on two identical machines in parallel
    Qian Cao
    Guohua Wan
    Journal of Combinatorial Optimization, 2016, 31 : 686 - 695
  • [34] Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
    He, Yong
    Jiang, Yi Wei
    Zhou, Hao
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2007, 23 (01) : 165 - 174
  • [35] Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines
    Yong He
    Yi Wei Jiang
    Hao Zhou
    Acta Mathematica Sinica, English Series, 2007, 23 : 165 - 174
  • [36] Optimal Preemptive Online Algorithms for Scheduling with Known Largest Size on Two Uniform Machines
    Yong HE Department of Mathematics
    ActaMathematicaSinica(EnglishSeries), 2007, 23 (01) : 165 - 174
  • [37] Semi-online scheduling with combined information on two identical machines in parallel
    Cao, Qian
    Wan, Guohua
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (02) : 686 - 695
  • [38] Optimal preemptive semi-online scheduling to minimize makespan on two related machines
    Epstein, L
    Favrholdt, LM
    OPERATIONS RESEARCH LETTERS, 2002, 30 (04) : 269 - 275
  • [39] Semi-online scheduling problems on a small number of machines
    Lee, Kangbok
    Lim, Kyungkuk
    JOURNAL OF SCHEDULING, 2013, 16 (05) : 461 - 477
  • [40] Several semi-online scheduling problems on two identical machines with combined information
    Cao, Qian
    Cheng, T. C. E.
    Wan, Guohua
    Li, Yi
    THEORETICAL COMPUTER SCIENCE, 2012, 457 : 35 - 44
12345