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 条
  • [1] 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
  • [2] 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
  • [3] 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
  • [4] 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
  • [5] 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
  • [6] Online scheduling in a parallel batch processing system to minimize makespan using restarts
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    Lin, Yixun
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 196 - 202
  • [7] An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan
    Fu, Ruyan
    Cheng, T. C. E.
    Ng, C. T.
    Yuan, Jinjiang
    [J]. OPERATIONS RESEARCH LETTERS, 2013, 41 (03) : 216 - 219
  • [8] SCHEDULING FAMILY JOBS ON AN UNBOUNDED PARALLEL-BATCH MACHINE TO MINIMIZE MAKESPAN AND MAXIMUM FLOW TIME
    Geng, Zhichao
    Yuan, Jinjiang
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2018, 14 (04) : 1479 - 1500
  • [9] Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan
    Miao, Cuixia
    [J]. ABSTRACT AND APPLIED ANALYSIS, 2014,
  • [10] Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan
    Li, Wenhua
    Gao, Jie
    Yuan, Jinjiang
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2015, 32 (04)
12345