Unbounded parallel batch scheduling with job delivery to minimize makespan

被引：18
|
作者：
Lu, Lingfa [1 ]
Yuan, Jinjiang [1 ]
机构：
[1] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Henan, Peoples R China
来源：
OPERATIONS RESEARCH LETTERS | 2008年 / 36卷 / 04期
基金：
中国国家自然科学基金;
关键词：
parallel batch scheduling; job delivery; heuristic; worst-case performance ratio;
D O I：
10.1016/j.orl.2008.01.006
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4. (C) 2008 Published by Elsevier B.V.
引用
收藏
页码：477 / 480
页数：4
相关论文
共 50 条
  • [1] 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
  • [2] The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
    Lu, Lingfa
    Zhang, Liqi
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) : 283 - 289
  • [3] 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
  • [4] 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
  • [5] 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
  • [6] 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
  • [7] 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
  • [8] On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    [J]. JOURNAL OF SCHEDULING, 2009, 12 (01) : 91 - 97
  • [9] On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
    Ruyan Fu
    Ji Tian
    Jinjiang Yuan
    [J]. Journal of Scheduling, 2009, 12 : 91 - 97
  • [10] Single machine scheduling with job delivery to minimize makespan
    Lu, Lingfa
    Yuan, Jinjiang
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2008, 25 (01) : 1 - 10
12345