Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem

This paper presents a hybrid genetic algorithm for the job shop scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed algorithm.

[1]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[2]  Robert H. Storer,et al.  Problem and Heuristic Space Search Strategies for Job Shop Scheduling , 1995, INFORMS J. Comput..

[3]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[4]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[5]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[6]  Jens Clausen,et al.  Parallel branch-and-bound methods for thejob-shop scheduling problem , 1998, Ann. Oper. Res..

[7]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[8]  Éric D. Taillard,et al.  Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..

[9]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

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

[11]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

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

[13]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms: Part II. Hybrid , 1999 .

[14]  J. Lenstra,et al.  Job-Shop Scheduling by Implicit Enumeration , 1977 .

[15]  David B. Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

[16]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[17]  David Beasley,et al.  An overview of genetic algorithms: Part 1 , 1993 .

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

[19]  J. Galletly.  An Overview of Genetic Algorithms , 1992 .

[20]  Han Hoogeveen,et al.  Short Shop Schedules , 1997, Oper. Res..

[21]  C Gray,et al.  MATCHING HEURISTIC SCHEDULING RULES FOR JOB SHOPS TO THE BUSINESS SALES LEVEL , 1991 .

[22]  Local Optimization and the Job-shop Scheduling Problem , 1994 .

[23]  Z Liu,et al.  Scheduling Theory and its Applications , 1997 .

[24]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[25]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[26]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[27]  Giuseppe Menga,et al.  Cellular control of manufacturing systems , 1993 .

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

[29]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[30]  Helena Ramalhinho Dias Lourenço,et al.  Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem , 1996 .

[31]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[32]  Robert H. Storer,et al.  Genetic Algorithms in Problem Space for Sequencing Problems , 1993 .

[33]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

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

[35]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[36]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

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

[38]  Sheik Meeran,et al.  New and “Stronger” Job-Shop Neighbourhoods: A Focus on the Method of Nowicki and Smutnicki (1996) , 2000, J. Heuristics.

[39]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[40]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[41]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[42]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[43]  Ling Wang,et al.  An effective hybrid optimization strategy for job-shop scheduling problems , 2001, Comput. Oper. Res..

[44]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[45]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[46]  J. C. Bean.  Genetics and random keys for sequencing amd optimization , 1993 .

[47]  L. Goddard,et al.  Operations Research (OR) , 2007 .