A Genetic Algorithm for Scheduling Parallel Non-identical Batch Processing Machines

In this paper, we study the scheduling problem of minimizing makespan on parallel non-identical batch processing machines. We formulate the scheduling problem into an integer programming model. Due to the difficulty of the problem, it is hard to solve the problem with standard mathematical programming software. We propose a genetic algorithm based on random keys encoding to address this problem. Computational results show that this genetic algorithm consistently finds a solution in a reasonable amount of computation time

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

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

[3]  Ali M. S. Zalzala,et al.  Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons , 2000, IEEE Trans. Evol. Comput..

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

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

[6]  Reha Uzsoy,et al.  A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .

[7]  Pyung-Hoi Koo,et al.  Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families , 2005 .

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

[9]  W. Spears,et al.  On the Virtues of Parameterized Uniform Crossover , 1995 .

[10]  Haldun Aytug,et al.  Use of genetic algorithms to solve production and operations management problems: A review , 2003 .

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

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

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

[14]  Lawrence V. Snyder,et al.  A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..

[15]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[16]  J. C. Bean,et al.  Scheduling operations on parallel machine tools , 2000 .

[17]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[18]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

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

[20]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[21]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[22]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

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

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

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

[26]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

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

[28]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[29]  Pyung-Hoi Koo,et al.  Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families , 2004 .

[30]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

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

[32]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms — An Overview , 1997 .

[33]  J. C. Bean,et al.  A GENETIC ALGORITHM METHODOLOGY FOR COMPLEX SCHEDULING PROBLEMS , 1999 .

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

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

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