Minimizing number of tardy jobs on a batch processing machine with incompatible job families

In this paper we consider the problem of minimizing number of tardy jobs on a single batch processing machine. The batch processing machine is capable of processing up to B jobs simultaneously as a batch. We are given a set of n jobs which can be partitioned into m incompatible families such that the processing times of all jobs belonging to the same family are equal and jobs of different families cannot be processed together. We show that this problem is NP-hard and present a dynamic programming algorithm which has polynomial time complexity when the number of job families and the batch machine capacity are fixed. We also show that when the jobs of a family have a common due date the problem can be solved by a pseudo-polynomial time procedure.

[1]  Lionel Dupont,et al.  Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes , 1998 .

[2]  Fariborz Jolai Ghazvini.  Ordonnancement sous contrainte de groupage (machine à traitement par batch) , 1998 .

[3]  Dorit S. Hochbaum,et al.  Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime , 1997, Oper. Res..

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

[5]  T. B. Tate,et al.  Machine Scheduling Problems , 1978 .

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

[8]  Gregory Dobson,et al.  The Batch Loading and Scheduling Problem , 2001, Oper. Res..

[9]  Reha Uzsoy,et al.  Scheduling a single batch processing machine with secondary resource constraints , 1998 .

[10]  Reha Uzsoy,et al.  Minimizing total completion time on a batch processing machine with job families , 1993, Oper. Res. Lett..

[11]  Lionel Dupont,et al.  Minimizing makespan on a single batch processing machine with non-identical job sizes , 1998 .

[12]  Reza H. Ahmadi,et al.  Batching and Scheduling Jobs on Batch and Discrete Processors , 1992, Oper. Res..

[13]  Izak Duenyas,et al.  Control of manufacturing networks which contain a batch processing machine , 2000 .

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

[15]  Chung-Lun Li,et al.  Scheduling with agreeable release times and due dates on a batch processing machine , 1997 .

[16]  Meral Azizoglu,et al.  Scheduling a batch processing machine with incompatible job families , 2001 .

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

[18]  Yoshiro Ikura,et al.  Efficient scheduling algorithms for a single batch processing machine , 1986 .

[19]  W. R. Runyan,et al.  Semiconductor integrated circuit processing technology , 1990 .

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

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

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

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

[24]  大山 達雄.  Theory of Scheduling, C. L. Liu , 1979 .

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