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 条
  • [41] Open shop scheduling problem to minimize makespan with release dates
    Bai, Danyu
    Tang, Lixin
    APPLIED MATHEMATICAL MODELLING, 2013, 37 (04) : 2008 - 2015
  • [42] Lagrangian approach to minimize makespan of non-identical parallel batch processing machines
    Suhaimi, Nurul
    Nguyen, Christine
    Damodaran, Purushothaman
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 101 : 295 - 302
  • [43] Parallel batch scheduling of equal-length jobs with release and due dates
    Alessandro Condotta
    Sigrid Knust
    Natalia V. Shakhlevich
    Journal of Scheduling, 2010, 13 : 463 - 477
  • [44] Parallel batch scheduling of equal-length jobs with release and due dates
    Condotta, Alessandro
    Knust, Sigrid
    Shakhlevich, Natalia V.
    JOURNAL OF SCHEDULING, 2010, 13 (05) : 463 - 477
  • [45] Makespan Minimization On Two Parallel Machines With Release Dates
    Hifi, Mhand
    Kacem, Imed
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 296 - +
  • [46] Minimizing makespan on parallel batch processing machines with two-dimensional rectangular jobs
    Zhou, Shengchao
    Jia, Zhaohong
    Jin, Mingzhou
    Du, Ni
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 169
  • [47] Minimizing makespan on parallel batch processing machines
    Chang, PY
    Damodaran, P
    Melouk, S
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2004, 42 (19) : 4211 - 4220
  • [48] Distance matrix based heuristics to minimize makespan of parallel batch processing machines with arbitrary job sizes and release times
    Zhou, Shengchao
    Chen, Huaping
    Li, Xueping
    APPLIED SOFT COMPUTING, 2017, 52 : 630 - 641
  • [49] SCHEDULING FAMILY JOBS ON AN UNBOUNDED PARALLEL-BATCH MACHINE TO MINIMIZE MAKESPAN AND MAXIMUM FLOW TIME
    Geng, Zhichao
    Yuan, Jinjiang
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2018, 14 (04) : 1479 - 1500
  • [50] Scheduling parallel identical machines to minimize makespan: A parallel approximation algorithm
    Ghalami, Laleh
    Grosu, Daniel
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 133 : 221 - 231
12345