Single machine unbounded parallel-batch scheduling with forbidden intervals

Abstract In this paper we consider the single machine parallel-batch scheduling with forbidden intervals. There are some forbidden intervals in which the machine cannot be available. The jobs are processed in batches form in the remaining free time-slots without preemption, where the processing time of a batch is defined to be the maximum processing time of the jobs in this batch. We show that, when the objective is bottleneck form, maximum lateness, or makespan with release dates of jobs, the considered problem can be solved in polynomial time.

[1]  Alexander H. G. Rinnooy Kan,et al.  Single machine flow-time scheduling with a single breakdown , 1989, Acta Informatica.

[2]  Jean-Charles Billaut,et al.  New Single Machine and Job-Shop Scheduling Problems with Availability Constraints , 2005, J. Sched..

[3]  Chung-Yee Lee,et al.  Single machine flow-time scheduling with scheduled maintenance , 1992, Acta Informatica.

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

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

[6]  J. J. Yuan,et al.  Single machine parallel batch scheduling subject to precedence constraints , 2004 .

[7]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[8]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[9]  Yuzhong Zhang,et al.  Minimizing Mean Response Time in Batch Processing System , 1999, COCOON.

[10]  Angelika Steger,et al.  Approximability of scheduling with fixed jobs , 1999, SODA '99.

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

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

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

[14]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[15]  Chung Keung Poon,et al.  Minimizing Makespan in Batch Machine Scheduling , 2000, Algorithmica.