On the complexity of bi-criteria scheduling on a single batch processing machine

This paper considers hierarchical bi-criteria scheduling on a single batch processing machine where the primary criterion is the makespan. We show that the problem where the secondary criterion is the total completion time can be solved in polynomial time for a given machine capacity and the problem where the secondary criterion is the (weighted) number of late jobs is (strongly) NP-hard.

[1]  Fariborz Jolai,et al.  Minimizing number of tardy jobs on a batch processing machine with incompatible job families , 2005, Eur. J. Oper. Res..

[2]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[3]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[4]  Reha Uzsoy,et al.  Minimizing total tardiness on a batch processing machine with incompatible job families , 1998 .

[5]  George L. Vairaktarakis,et al.  Complexity of Single Machine Hierarchical Scheduling: A Survey , 1993 .

[6]  A. Nagar,et al.  Multiple and bicriteria scheduling : A literature survey , 1995 .

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

[8]  Reha Uzsoy,et al.  Minimizing total completion time on batch processing machines , 1993 .

[9]  John W. Fowler,et al.  Minimizing total weighted tardiness on a single batch process machine with incompatible job families , 2005, Comput. Oper. Res..

[10]  R. Bulfin,et al.  Complexity of single machine, multi-criteria scheduling problems , 1993 .

[11]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

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

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

[14]  Reha Uzsoy,et al.  Scheduling batch processing machines with incompatible job families , 1995 .

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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