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

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.

[1]  J. A. Hoogeveen,et al.  Scheduling a batching machine , 1998 .

[2]  Reha Uzsoy,et al.  Minimizing makespan on a single batch processing machine with dynamic job arrivals , 1999 .

[3]  Yoshiro Ikura,et al.  Efficient scheduling algorithms for a single batch processing machine , 1986 .

[4]  Shuguang Li,et al.  Minimizing makespan with release times on identical parallel batching machines , 2005, Discret. Appl. Math..

[5]  T. C. Edwin Cheng,et al.  The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan , 2004, Theor. Comput. Sci..

[6]  Zhaohui Liu,et al.  Scheduling one batch processor subject to job release dates , 2000, Discret. Appl. Math..

[7]  T. C. Edwin Cheng,et al.  Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine , 2005, Theor. Comput. Sci..

[8]  Yuzhong Zhang,et al.  Approximation Algorithms in Batch Processing , 1999, ISAAC.

[9]  T. C. Edwin Cheng,et al.  Scheduling Jobs with Release Dates and Deadlines on a Batch Processing Machine , 2001 .

[10]  T. C. Edwin Cheng,et al.  On scheduling an unbounded batch machine , 2003, Oper. Res. Lett..

[11]  T. C. Edwin Cheng,et al.  The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan , 2004, Oper. Res. Lett..

[12]  Reha Uzsoy,et al.  Efficient Algorithms for Scheduling Semiconductor Burn-In Operations , 1992, Oper. Res..