Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms

This paper aims to minimise the makespan of a set of identical batch processing machines in parallel. The batch processing machine can process a batch of jobs as long as the total size of all the jobs in the batch does not exceed its capacity. The processing time of the job and its size are given. Batch processing time is equal to the longest processing job in the batch. Two interdependent decisions are required, namely grouping jobs into batches, and scheduling the batches on the machines. The problem under study is NP-hard and hence a Genetic Algorithm (GA) approach is proposed. The effectiveness of the GA approach to solve randomly generated problems was compared with a Simulated Annealing (SA) approach, a Random Keys Genetic Algorithm (RKGA), a Hybrid Genetic Heuristic (HGH) and a commercial solver. The proposed GA approach was found to be very effective in finding a good solution in a short time as opposed to SA, RKGA and a commercial solver. Both GA and HGH are marginally better than each other on different problem instances. [Submitted 17 August 2007; Revised 10 October 2007; Revised 30 May 2008; Revised 29 July 2008; Accepted 15 September 2008]

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

[2]  Purushothaman Damodaran,et al.  Mixed integer formulation to minimize makespan in a flow shop with batch processing machines , 2004, Math. Comput. Model..

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

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

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[7]  M. Mathirajan,et al.  A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor , 2006 .

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

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

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

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

[12]  Dingwei Wang,et al.  Genetic algorithm approach to earliness and tardiness production scheduling and planning problem , 1998 .

[13]  Purushothaman Damodaran,et al.  Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms , 2006 .

[14]  Philippe Baptiste,et al.  Batching identical jobs , 2000, Math. Methods Oper. Res..

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

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

[17]  Ahmet B. Keha,et al.  Using genetic algorithms for single-machine bicriteria scheduling problems , 2003, Eur. J. Oper. Res..

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

[19]  Andreas C. Nearchou,et al.  The effect of various operators on the genetic search for large scheduling problems , 2004 .

[20]  Stéphane Dauzère-Pérès,et al.  Genetic algorithms to minimize the weighted number of late jobs on a single machine , 2003, Eur. J. Oper. Res..

[21]  Purushothaman Damodaran,et al.  Heuristics to minimize makespan of parallel batch processing machines , 2008 .

[22]  Ali Husseinzadeh Kashan,et al.  A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes , 2008, Comput. Oper. Res..

[23]  Colin R. Reeves,et al.  Using Genetic Algorithms with Small Populations , 1993, ICGA.

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

[25]  Peter Ross.  What Are Genetic Algorithms Good at? , 1997, INFORMS J. Comput..

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

[27]  Colin R. Reeves,et al.  Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..

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

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

[30]  James C. Bean,et al.  A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines , 2007, 2007 IEEE Symposium on Computational Intelligence in Scheduling.