Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics

This study addresses the scheduling problem of parallel batch-processing machines encountered in different manufacturing environments, such as the burn-in operation in the manufacture of semiconductors and the aging test operation in the manufacture of thin film transistor-liquid crystal displays (TFT-LCDs). Each machine simultaneously processes several jobs in a batch, as long as the total size of all jobs in the batch does not exceed machine capacity. The processing time of a batch is represented by the longest time among the jobs in the batch. For this problem, a mixed integer programming (MIP) model is provided, and metaheuristics based on simulated annealing (SA) and genetic algorithm (GA) are proposed. In the proposed GA and SA, a string with (n+m-1) numbers is used to assign jobs into each machine. The multi-stage dynamic programming (MSDP) algorithm, taken from the dynamic programming (DP) algorithm of Chou in 2007, is then applied to group the jobs into batches for each machine. The experimental results show that the proposed metaheuristic techniques were successfully employed in solving the scheduling problems of parallel batch-processing machines with makespan criterion.

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

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

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

[4]  Sharif H. Melouk,et al.  Minimizing makespan on parallel batch processing machines , 2004 .

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

[6]  Fariborz Jolai,et al.  Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes , 2006 .

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

[8]  Guochuan Zhang,et al.  Minimizing makespan on a single batch processing machine with nonidentical job sizes , 2001 .

[9]  Lars Mönch,et al.  Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date , 2007, Comput. Oper. Res..

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

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

[12]  Shuguang Li,et al.  Minimizing makespan with release times on identical parallel batching machines , 2005, Discret. Appl. Math..

[13]  Pei-Chann Chang,et al.  A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes , 2004 .

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

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

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

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

[18]  Purushothaman Damodaran,et al.  Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing , 2004 .

[19]  Fuh-Der Chou,et al.  A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion , 2007 .

[20]  Wen Lea Pearn,et al.  Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes , 2009 .