A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan

被引：13
|
作者：
Yuan, Jinjiang [2 ]
Fu, Ruyan [3 ]
Ng, C. T. [1 ]
Cheng, T. C. E. [1 ]
机构：
[1] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
[2] Zhengzhou Univ, Dept Math, Zhengzhou 450001, Henan, Peoples R China
[3] China Univ Min & Technol, Sch Sci, Xuzhou 221116, Jiangsu, Peoples R China
来源：
JOURNAL OF SCHEDULING | 2011年 / 14卷 / 04期
关键词：
Parallel-batch scheduling; Online algorithm; Restart; Competitive ratio; FINITE-CAPACITY; SINGLE-MACHINE; CONTAINER; SERVICE;
D O I：
10.1007/s10951-010-0172-2
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
We consider online scheduling with restarts in an unbounded parallel-batch processing system to minimize the makespan. By online we mean that jobs arrive over time and all the information on a job is unknown before its arrival time (release date) and restart means that a running batch may be interrupted, losing all the work done on it, and the jobs in the interrupted batch are released and become independently unscheduled jobs. It is known in the literature that the considered problem has no online algorithm with a competitive ratio less than (5 - root 5)/2. We give an online algorithm for the considered problem with a competitive ratio (5 - root 5)/2 approximate to 1.382.
引用
收藏
页码：361 / 369
页数：9
相关论文
共 50 条
  • [31] A best possible on-line algorithm for scheduling on uniform parallel-batch machines
    Li, Wenhua
    Chai, Xing
    Song, Yali
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 740 : 68 - 75
  • [32] Best semi-online algorithms for unbounded parallel batch scheduling
    Yuan, Jinjiang
    Ng, C. T.
    Cheng, T. C. E.
    [J]. DISCRETE APPLIED MATHEMATICS, 2011, 159 (08) : 838 - 847
  • [33] Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
    Jiao, Chengwen
    Yuan, Jinjiang
    Feng, Qi
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2019, 36 (05)
  • [34] An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
    Ruyan Fu
    Ji Tian
    Shisheng Li
    Jinjiang Yuan
    [J]. Journal of Combinatorial Optimization, 2017, 34 : 1187 - 1197
  • [35] Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
    Xing Chai
    Wenhua Li
    Yuejuan Zhu
    [J]. Annals of Operations Research, 2021, 298 : 79 - 93
  • [36] On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
    Ridouard, Frederic
    Richard, Pascal
    Martineau, Patrick
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) : 1327 - 1342
  • [37] Online scheduling to minimize maximum weighted flow-time on a bounded parallel-batch machine
    Chai, Xing
    Li, Wenhua
    Zhu, Yuejuan
    [J]. ANNALS OF OPERATIONS RESEARCH, 2021, 298 (1-2) : 79 - 93
  • [38] The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
    Yuan, JJ
    Liu, ZH
    Ng, CT
    Cheng, TCE
    [J]. THEORETICAL COMPUTER SCIENCE, 2004, 320 (2-3) : 199 - 212
  • [39] An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
    Fu, Ruyan
    Tian, Ji
    Li, Shisheng
    Yuan, Jinjiang
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (04) : 1187 - 1197
  • [40] Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs
    Yuan Gao
    Jinjiang Yuan
    [J]. Journal of Combinatorial Optimization, 2019, 38 : 698 - 711
12345