Semi-online Hierarchical Scheduling for Bag-of-tasks on Two Machines

被引：3
|
作者：
Dai, Bingfei [1 ]
Li, Jianping [1 ]
Li, Weidong [1 ]
机构：
[1] Yunnan Univ, Sch Math & Stat, Kunming 650504, Yunnan, Peoples R China
来源：
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年
基金：
中国国家自然科学基金;
关键词：
Scheduling; Semi-online algorithm; Competitive ratio; Bag-of-tasks; PARALLEL MACHINES; GRADE; ALGORITHM;
D O I：
10.1145/3297156.3297222
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we study the problem of scheduling for bag-of-tasks on two parallel machines under a grade-of-service provision, where the objective is to minimize the makespan. We design an semi-online algorithm with a competitive ratio of 3/2 when the optimal value is known and an semi-online algorithm with a competitive ratio of (root 5 + 1)/2 when the largest processing time is known.
引用
收藏
页码：609 / 614
页数：6
相关论文
共 50 条
  • [31] Semi-online hierarchical scheduling problems with buffer or rearrangements
    Chen, Xin
    Xu, Zhenzhen
    Dosa, Gyoergy
    Han, Xin
    Jiang, He
    [J]. INFORMATION PROCESSING LETTERS, 2013, 113 (04) : 127 - 131
  • [32] Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
    Min, Xiao
    Liu, Jing
    Wang, Yuqing
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (09) : 423 - 428
  • [33] Optimal non-preemptive semi-online scheduling on two related machines
    Epstein, L
    Favrholdt, LM
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 245 - 256
  • [34] Optimal algorithm for semi-online scheduling on two machines under GoS levels
    Luo, Taibo
    Xu, Yinfeng
    [J]. OPTIMIZATION LETTERS, 2016, 10 (01) : 207 - 213
  • [35] Semi-online Machine Covering on Two Hierarchical Machines with Discrete Processing Times
    Wu, Gangxiong
    Li, Weidong
    [J]. THEORETICAL COMPUTER SCIENCE (NCTCS 2018), 2018, 882 : 1 - 7
  • [36] Semi-online scheduling with known maximum job size on two uniform machines
    Cao, Qian
    Liu, Zhaohui
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2010, 20 (04) : 369 - 384
  • [37] Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines
    Yong He
    Yiwei Jiang
    [J]. Acta Informatica, 2004, 40 : 367 - 383
  • [38] Optimal non-preemptive semi-online scheduling on two related machines
    Epstein, L
    Favrholdt, LM
    [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2005, 57 (01): : 49 - 73
  • [39] Semi-online scheduling on two uniform processors
    Angelelli, Enrico
    Speranza, Maria Grazia
    Tuza, Zsolt
    [J]. THEORETICAL COMPUTER SCIENCE, 2008, 393 (1-3) : 211 - 219
  • [40] Semi-Online Scheduling on Two Identical Parallel Machines with Initial-Lookahead Information
    Zheng, Feifeng
    Chen, Yuhong
    Liu, Ming
    Xu, Yinfeng
    [J]. Asia-Pacific Journal of Operational Research, 2024, 1
12345