Online scheduling in a parallel batch processing system to minimize makespan using restarts

被引：18
|
作者：
Fu, Ruyan [1 ]
Tian, Ji [1 ]
Yuan, Jinjiang [1 ]
Lin, Yixun [1 ]
机构：
[1] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Peoples R China
来源：
THEORETICAL COMPUTER SCIENCE | 2007年 / 374卷 / 1-3期
基金：
中国国家自然科学基金;
关键词：
single machine scheduling; parallel batch; online algorithm; restart; competitive ratio;
D O I：
10.1016/j.tcs.2006.12.040
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider an online scheduling problem in a parallel batch processing system with jobs in a batch being allowed to restart. Online means that jobs arrive over time, and all jobs' characteristics are unknown before their arrival times. A parallel batch processing machine can handle up to several jobs simultaneously. All jobs in a batch start and complete at the same time. The processing time of a batch is equal to the longest processing time of jobs in the batch. We are allowed to restart a batch, that is, a running batch may be interrupted, losing all the work done on it. Jobs in the interrupted batch are released and become independently unscheduled jobs. We deal with an unbounded model where each batch's capacity is sufficiently large. We provide a linear online algorithm with competitive ratio 3/2 for the problem. We also show that the considered problem has no online algorithm using restarts with competitive ratio less than (5 - root 5)/2. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：196 / 202
页数：7
相关论文
共 50 条
  • [1] A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
    Yuan, Jinjiang
    Fu, Ruyan
    Ng, C. T.
    Cheng, T. C. E.
    [J]. JOURNAL OF SCHEDULING, 2011, 14 (04) : 361 - 369
  • [2] A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
    Jinjiang Yuan
    Ruyan Fu
    C. T. Ng
    T. C. E. Cheng
    [J]. Journal of Scheduling, 2011, 14 : 361 - 369
  • [3] Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
    Fu, Ruyan
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    [J]. INFORMATION PROCESSING LETTERS, 2010, 110 (11) : 444 - 450
  • [4] Online scheduling on unbounded parallel-batch machines to minimize the makespan
    Tian, Ji
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (21-22) : 1211 - 1215
  • [5] On-line scheduling on a batch machine to minimize makespan with limited restarts
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    He, Cheng
    [J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (02) : 255 - 258
  • [6] Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
    L. L. Liu
    C. T. Ng
    T. C. E. Cheng
    [J]. Optimization Letters, 2014, 8 : 307 - 318
  • [7] Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
    Liu, L. L.
    Ng, C. T.
    Cheng, T. C. E.
    [J]. OPTIMIZATION LETTERS, 2014, 8 (01) : 307 - 318
  • [8] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Yuan, Jin-Jiang
    Ren, Li-Li
    Tian, Ji
    Fu, Ru-Yan
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2019, 7 (02) : 303 - 319
  • [9] Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    Li, Ya
    [J]. INFORMATION PROCESSING LETTERS, 2014, 114 (04) : 179 - 184
  • [10] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Jin-Jiang Yuan
    Li-Li Ren
    Ji Tian
    Ru-Yan Fu
    [J]. Journal of the Operations Research Society of China, 2019, 7 : 303 - 319
12345