An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines

We consider the problem of on-line scheduling a set of n jobs on two parallel batch processing machines. The objective is to minimize the makespan. We provide an algorithm for the problem that is better than one given in the literature, improving the competitive ratio from 32 to 2.

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

[2]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[3]  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..

[4]  R. Uzsoy.  Scheduling a single batch processing machine with non-identical job sizes , 1994 .

[5]  Guochuan Zhang,et al.  Optimal on-line algorithms for scheduling on parallel batch processing machines , 2003 .

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

[7]  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..

[8]  T. C. Edwin Cheng,et al.  Concurrent Open Shop Scheduling to Minimize the Weighted Number of Tardy Jobs , 2003, J. Sched..

[9]  Xiaotie Deng,et al.  On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time , 2001, ISAAC.

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

[11]  Xiaotie Deng,et al.  On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time , 2004, J. Comb. Optim..

[12]  T. C. Edwin Cheng,et al.  The Single Machine Batching Problem with Family Setup Times to Minimize Maximum Lateness is Strongly NP-Hard , 2003, J. Sched..

[13]  Xiaoqiang Cai,et al.  On‐line algorithms for minimizing makespan on batch processing machines , 2001 .

[14]  Xiaoli Wang,et al.  Minimizing makespan on a single batching machine with release times and non-identical job sizes , 2005, Oper. Res. Lett..

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

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

[17]  T. C. Edwin Cheng,et al.  A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints , 2002, Oper. Res. Lett..