论文信息 - On scheduling unbounded batch processing machine(s)

On scheduling unbounded batch processing machine(s)

The computational complexity of scheduling jobs with released dates on an unbounded batch processing machine to minimize total completion time and on parallel unbounded batch processing machines to minimize total weighted completion time remains open. In this note we show that the first problem is NP-hard with respect to id-encoding, and the second one is strongly NP-hard.

T. C. Edwin Cheng | C. T. Ng | L. L. Liu

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

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

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

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

[5] T. C. Edwin Cheng,et al. Scheduling jobs with agreeable processing times and due dates on a single batch processing machine , 2007, Theor. Comput. Sci..

[6] A. Kan. Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

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

[8] Yuzhong Zhang,et al. Minimizing Mean Completion Time in a Batch Processing System , 2003, Algorithmica.