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 条
  • [21] Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection
    Zou, Juan
    Miao, Cuixia
    SCIENTIFIC WORLD JOURNAL, 2014,
  • [22] Scheduling jobs with release dates and deadlines on a batch processing machine
    Cheng, TCE
    Liu, ZH
    Yu, WC
    IIE TRANSACTIONS, 2001, 33 (08) : 685 - 690
  • [23] Makespan minimisation on parallel batch processing machines with non-identical job sizes and release dates
    Ozturk, Onur
    Espinouse, Marie-Laure
    Di Mascolo, Maria
    Gouin, Alexia
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (20) : 6022 - 6035
  • [24] The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
    Nong, Q. Q.
    Ng, C. T.
    Cheng, T. C. E.
    OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 61 - 66
  • [25] Scheduling jobs with equal-processing-time on parallel machines with non-identical capacities to minimize makespan
    Wang, Jun-Qiang
    Leung, Joseph Y. -T.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2014, 156 : 325 - 331
  • [26] Approximation schemes for scheduling jobs on identical parallel machines to minimize the maximum lateness and makespan
    Alhadi, Gais
    Kacem, Imed
    Laroche, Pierre
    Osman, Izzeldin M.
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (03) : 2393 - 2419
  • [27] Scheduling two-point stochastic jobs to minimize the makespan on two parallel machines
    Borst, S
    Bruno, J
    Coffman, EG
    Phillips, S
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 1997, 11 (01) : 95 - 105
  • [28] SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN
    Zhang, Shu-Xia
    Cao, Zhi-Gang
    Zhang, Yu-Zhong
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2010, 27 (04) : 493 - 501
  • [29] Online scheduling in a parallel batch processing system to minimize makespan using restarts
    Fu, Ruyan
    Tian, Ji
    Yuan, Jinjiang
    Lin, Yixun
    THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 196 - 202
  • [30] Online Scheduling on Two Uniform Unbounded Parallel-Batch Machines to Minimize Makespan
    Yuan, Jin-Jiang
    Ren, Li-Li
    Tian, Ji
    Fu, Ru-Yan
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2019, 7 (02) : 303 - 319
12345