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 条
  • [41] Optimal algorithm for semi-online scheduling on two machines under GoS levels
    Taibo Luo
    Yinfeng Xu
    Optimization Letters, 2016, 10 : 207 - 213
  • [42] Semi-online scheduling problems on two identical machines with inexact partial information
    Tan, Zhiyi
    He, Yong
    THEORETICAL COMPUTER SCIENCE, 2007, 377 (1-3) : 110 - 125
  • [43] Optimal semi-online preemptive algorithms for machine covering on two uniform machines
    He, Y
    Jiang, YW
    THEORETICAL COMPUTER SCIENCE, 2005, 339 (2-3) : 293 - 314
  • [44] On-line and semi-online scheduling for flow shop problems on two machines
    Yang, Ming
    Lu, Xiwen
    OPTIMIZATION, 2013, 62 (04) : 499 - 507
  • [45] Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines
    Liu, Ming
    Zheng, Feifeng
    Zhu, Zhanguo
    Chu, Chengbin
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2014, 31 (05)
  • [46] Semi-online scheduling problems on a small number of machines
    Kangbok Lee
    Kyungkuk Lim
    Journal of Scheduling, 2013, 16 : 461 - 477
  • [47] Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines
    Min, Xiao
    Liu, Jing
    Wang, Yuqing
    INFORMATION PROCESSING LETTERS, 2011, 111 (09) : 423 - 428
  • [48] Optimal non-preemptive semi-online scheduling on two related machines
    Epstein, L
    Favrholdt, LM
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 245 - 256
  • [49] Optimal algorithm for semi-online scheduling on two machines under GoS levels
    Luo, Taibo
    Xu, Yinfeng
    OPTIMIZATION LETTERS, 2016, 10 (01) : 207 - 213
  • [50] Optimal non-preemptive semi-online scheduling on two related machines
    Epstein, L
    Favrholdt, LM
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2005, 57 (01): : 49 - 73
12345