Multi parents extended precedence preservative crossover for job shop scheduling problems

Job Shop Scheduling Problem (JSSP) is one of the hard combinatorial scheduling problems. This paper proposes a genetic algorithm with multi parents crossover called Extended Precedence Preservative Crossover (EPPX) that can be suitably modified and implemented with, in principal, unlimited number of parents which differ from conventional two parents crossover. JSSP representation encoded by using permutation with repetition guarantees the feasibility of chromosomes thus eliminates the legalization on children (offspring).The simulations are performed on a set of benchmark problems from the literatures and they indicate that the best solutions have the tendencies to be appeared by using 3-6 numbers of parents in the recombination. The comparison between the results of EPPX and other methodologies show the sustainability of multi parents recombination in producing competitive results to solve the JSSP.

[1]  Kazi Shah Nawaz Ripon.  Hybrid Evolutionary Approach for Multi-Objective Job-Shop Scheduling Problem , 1970 .

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

[3]  Mitsuo Gen,et al.  Solving job-shop scheduling problems by genetic algorithm , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[4]  Kazi Shah Nawaz Ripon,et al.  Improved precedence preservation crossover for multi-objective job shop scheduling problem , 2011, Evol. Syst..

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

[6]  Chungnan Lee,et al.  Multi-parent extension of partially mapped crossover for combinatorial optimization problems , 2010, Expert Syst. Appl..

[7]  Lakhmi C. Jain,et al.  On the effect of multi-parents recombination in binary coded genetic algorithms , 1998, 1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111).

[8]  Rainer Kolisch,et al.  Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem , 1995 .

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

[10]  Peter Wai-Ming Tsang,et al.  Affine invariant object shape matching using genetic algorithm with multi-parent orthogonal recombination and migrant principle , 2009, Appl. Soft Comput..

[11]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[12]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

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

[14]  H. Mühlenbein,et al.  Gene Pool Recombination in Genetic Algorithms , 1996 .

[15]  Hyung Rim Choi,et al.  A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..

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

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

[18]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[19]  A. E. Eiben,et al.  Genetic algorithms with multi-parent recombination , 1994, PPSN.

[20]  Mitsuo Gen,et al.  A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem , 2005, Comput. Ind. Eng..

[21]  A. E. Eiben,et al.  Diagonal Crossover in Genetic Algorithms for Numerical Optimization , 1997 .

[22]  Albert Jones,et al.  Survey of Job Shop Scheduling Techniques , 1999 .

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

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

[25]  C. Bierwirth.  A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[26]  Christian Bierwirth,et al.  On Permutation Representations for Scheduling Problems , 1996, PPSN.

[27]  M. Yamamura,et al.  Multi-parent recombination with simplex crossover in real coded genetic algorithms , 1999 .