Semi-online scheduling on two uniform machines with the known largest size

被引：5
|
作者：
Cai, Sheng-Yi [1 ,2 ]
Yang, Qi-Fan [1 ]
机构：
[1] Zhejiang Univ, Dept Math, Hangzhou 310003, Zhejiang, Peoples R China
[2] Wenzhou Univ, Sch Math & Informat Sci, Wenzhou 325035, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2011年 / 21卷 / 04期
关键词：
Analysis of algorithms; Scheduling; Semi-online; Competitive ratio; Uniform machine; PROCESSORS; ALGORITHMS;
D O I：
10.1007/s10878-009-9254-5
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper investigates semi-online scheduling on two uniform machines with the known largest size. Denote by s (j) the speed of each machine, j=1,2. Assume 0 < s (1)a parts per thousand currency signs (2), and let s=s (2)/s (1) be the speed ratio.
引用
收藏
页码：393 / 408
页数：16
相关论文
共 50 条
  • [41] 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
  • [42] 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
  • [43] On-line and semi-online scheduling for flow shop problems on two machines
    Yang, Ming
    Lu, Xiwen
    OPTIMIZATION, 2013, 62 (04) : 499 - 507
  • [44] 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)
  • [45] Semi-online scheduling problems on a small number of machines
    Kangbok Lee
    Kyungkuk Lim
    Journal of Scheduling, 2013, 16 : 461 - 477
  • [46] 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
  • [47] Optimal non-preemptive semi-online scheduling on two related machines
    Epstein, L
    Favrholdt, LM
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 245 - 256
  • [48] Optimal algorithm for semi-online scheduling on two machines under GoS levels
    Luo, Taibo
    Xu, Yinfeng
    OPTIMIZATION LETTERS, 2016, 10 (01) : 207 - 213
  • [49] 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
  • [50] Semi-Online Scheduling on Two Identical Parallel Machines with Initial-Lookahead Information
    Zheng, Feifeng
    Chen, Yuhong
    Liu, Ming
    Xu, Yinfeng
    Asia-Pacific Journal of Operational Research, 2024, 1
12345