Minimizing makespan on parallel batch processing machines

A simulated annealing approach to minimize makespan for identical parallel batch-processing machines is presented. Each job has a corresponding processing time and size. The machine can process the jobs in batches as long as the total size of all the jobs in a batch does not exceed the machine capacity. The processing time of a batch is equal to the longest processing time among all the jobs in the batch. Random instances were generated to test the approach with respect to solution quality and run time. The results of the simulated annealing approach were compared with CPLEX. The approach outperforms CPLEX on most of the instances.

[1]  M. Pirlot.  General local search methods , 1996 .

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

[3]  Chang Sup Sung,et al.  MINIMIZING MAXIMUM COMPLETION TIME IN A TWO-BATCH-PROCESSING-MACHINE FLOWSHOP WITH DYNAMIC ARRIVALS ALLOWED , 1997 .

[4]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[5]  E. Bonomi,et al.  The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .

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

[7]  Young Hwan Kim,et al.  A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines , 2000, Eur. J. Oper. Res..

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

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

[10]  T. L. Ward,et al.  Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[11]  Peter Brucker,et al.  Batch scheduling with deadlines on parallel machines , 1998, Ann. Oper. Res..

[12]  V. Cerný.  Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .

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

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

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

[16]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[17]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

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

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

[21]  Jose A. Ventura,et al.  Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times , 2000 .

[22]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

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

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

[25]  Young Hwan Kim,et al.  Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed , 2002, Comput. Oper. Res..

[26]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..

[27]  F. Rendl,et al.  A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .