A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families

This research deals with developing a branch and bound algorithm for minimising total weighted tardiness on a single batch processing machine with characteristics similar to those seen in the diffusion operation in semiconductor manufacturing. Dominance properties are utilised in order to increase the efficiency of the algorithm. The developed algorithm is implemented in C++ and tested on different cases. We find the algorithm is capable of solving problems with up to 32 jobs. Computational results are presented along with a discussion of the effectiveness of the proposed algorithm and the effects of various parameters on the efficiency of the algorithm. The branch and bound algorithm can be used to solve relatively small problems as well as provide a means by which researchers can evaluate the effectiveness of their heuristics.

[1]  Y. H. Kim,et al.  Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals , 2002, Comput. Oper. Res..

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

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

[4]  M. Mathirajan,et al.  Scheduling of Batch Processors in Semiconductor Manufacturing – A Review , 2003 .

[5]  Reha Uzsoy,et al.  A genetic algorithm to minimize maximum lateness on a batch processing machine , 2002, Comput. Oper. Res..

[6]  Xiangtong Qi,et al.  Earliness and Tardiness Scheduling Problems on a Batch Processor , 1999, Discret. Appl. Math..

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

[8]  C. S. Sung,et al.  Minimizing makespan on a single burn-in oven in semiconductor manufacturing , 2000, Eur. J. Oper. Res..

[9]  Meral Azizoglu,et al.  Scheduling a batch processing machine with non-identical job sizes , 2000 .

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

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

[12]  Clarisse Dhaenens,et al.  Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure , 2002, Comput. Oper. Res..

[13]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

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

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

[16]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

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

[18]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[19]  Scott J. Mason,et al.  Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times , 2008 .

[20]  John W. Fowler,et al.  Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness , 2004 .

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

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

[23]  John W. Fowler,et al.  Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times , 2005, Comput. Oper. Res..

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

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