Unbounded parallel batch scheduling with job delivery to minimize makespan

We consider unbounded parallel batch scheduling with job delivery to minimize makespan. When the jobs have identical size, we provide a polynomial-time algorithm. When the jobs have non-identical sizes, we provide a heuristic with a worst-case performance ratio 7/4.

[1]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

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

[3]  T. C. Edwin Cheng,et al.  Single machine scheduling with batch deliveries , 1996 .

[4]  D. Simchi-Levi.  New worst‐case results for the bin‐packing problem , 1994 .

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

[6]  Chung-Yee Lee,et al.  Machine scheduling with job delivery coordination , 2004, Eur. J. Oper. Res..

[7]  Zhi-Long Chen,et al.  Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs , 1996 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Jinjiang Yuan.  A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs , 1996 .

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

[11]  S. Guirchoun,et al.  Complexity results for parallel machine scheduling problems with a server in computer systems , 2008 .

[12]  Xiaoguang Yang.  Scheduling with generalized batch delivery dates and earliness penalties , 2000 .

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

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

[15]  Chung Yee Lee,et al.  On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date , 1993 .