Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan

被引：18
|
作者：
Liu, L. L. [1 ]
Ng, C. T. [2 ]
Cheng, T. C. E. [2 ]
机构：
[1] Shanghai Second Polytech Univ, Sch Sci, Pudong Shanghai 201209, Peoples R China
[2] Hong Kong Polytech Univ Hung Hom, Dept Logist & Maritime Studies, Kowloon, Hong Kong, Peoples R China
来源：
OPTIMIZATION LETTERS | 2014年 / 8卷 / 01期
关键词：
Scheduling; Release dates; Batch processing; Makespan; ALGORITHMS;
D O I：
10.1007/s11590-012-0575-4
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Batch processing happens in many different industries, in which a number of jobs are processed simultaneously as a batch. In this paper we develop two heuristics for the problem of scheduling jobs with release dates on parallel batch processing machines to minimize the makespan and analyze their worst-case performance ratios. We also present a polynomial-time optimal algorithm for a special case of the problem where the jobs have equal processing times.
引用
收藏
页码：307 / 318
页数：12
相关论文
共 50 条
  • [31] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Jin-Jiang Yuan
    Li-Li Ren
    Ji Tian
    Ru-Yan Fu
    Journal of the Operations Research Society of China, 2019, 7 : 303 - 319
  • [32] On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    JOURNAL OF SCHEDULING, 2009, 12 (01) : 91 - 97
  • [33] On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs
    Ruyan Fu
    Ji Tian
    Jinjiang Yuan
    Journal of Scheduling, 2009, 12 : 91 - 97
  • [34] Single machine batch scheduling problem with family setup times and release dates to minimize makespan
    J. J. Yuan
    Z. H. Liu
    C. T. Ng
    T. C. E. Cheng
    Journal of Scheduling, 2006, 9 : 499 - 513
  • [35] Single machine batch scheduling problem with family setup times and release dates to minimize makespan
    Yuan, J. J.
    Liu, Z. H.
    Ng, C. T.
    Cheng, T. C. E.
    JOURNAL OF SCHEDULING, 2006, 9 (06) : 499 - 513
  • [36] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    Songsong Li
    Yuzhong Zhang
    Journal of Systems Science and Complexity, 2016, 29 : 472 - 477
  • [37] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    Li Songsong
    Zhang Yuzhong
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2016, 29 (02) : 472 - 477
  • [38] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    LI Songsong
    ZHANG Yuzhong
    Journal of Systems Science & Complexity, 2016, 29 (02) : 472 - 477
  • [39] A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
    Ozturk, Onur
    Begen, Mehmet A.
    Zaric, Gregory S.
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2017, 55 (06) : 1815 - 1831
  • [40] SINGLE MACHINE BATCH SCHEDULING PROBLEM TO MINIMIZE MAKESPAN WITH CONTROLLABLE SETUP AND JOBS PROCESSING TIMES
    Luo, Chengxin
    NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2015, 5 (01): : 71 - 77
12345