Multi parents extended precedence preservative crossover for job shop scheduling problems

Malaysian Journal of Computer Science

Volumn 26, Issue 3, 2013, Pages 170-181

  Sin, Ong Chung ^a   Moin, Noor Hasnah ^a   Omar, Mohd ^a  

^a UNIVERSITY OF MALAYA   (Malaysia)

Author keywords

Genetic algorithms; Job shop scheduling problems; Local search; Multi parents crossover

Indexed keywords

EID: 84886432636     PISSN: 01279084     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (27)

1. S. Ólafsson, "Metaheuristics". Handbooks in operations research and management science, Vol. 13,2006, pp. 633-654.
2. R. Cheng, M. Gen, Y. Tsujimura, "A Tutorial Survey of Job-Shop Scheduling Problems using Genetic Algorithms-I. Representation", Computers & Industrial Engineering, Volume 30, Issue 4, September 1996, pp. 983-997.
3. L. Davis, "Job shop scheduling with genetic algorithms", Proceedings of the 1st International Conference on Genetic Algorithms,1985, pp. 136-140.
4. A. Jones, L.C. Rabelo, A.T. Sharawi, "Survey of Job Shop Scheduling Techniques", Wiley Encyclopedia of Electrical and Electronics Engineering, 27 December 1999.
5. E. Nowicki and C. Smutnicki,"A fast taboo search algorithm for the job shop problem". Management Science, vol. 42, issue 6, 1996, pp. 797-813.
6. J.F. Goncalves, J.J de M. Mendes and M.G.C. Resende, "A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem", European Journal of Operational Research, Volume 167, Issue 1, 16 November 2005, pp. 77-95.
7. B.J. Park, H.R. Choi and H.S. Kim, "A Hybrid Genetic Algorithm for the Job Shop Scheduling Problems", Computer & Industrial Engineering, Volume 45, Issue 4, December 2003, pp. 597-613.
8. K.S.N. Ripon, "Hybrid Evolutionary Approach for Multi-Objective Job-Shop Scheduling Problem", Malaysian Journal of Computer Science, Volume 20, No.2, 2007.
9. M. Watanbe, K. Ida, M. gen, "A Genetic Algorithm with modified Crossover Operator and Search Area Adaptation for the Job Shop Scheduling Problem", Computers & Industrial Engineering, Volume 48, Issue 4, June 2005, Pages 743-752.
10. K.S. N. Ripon, N.H. Siddique and J. Torresen, "Improved Precedence Preservation Crossover for Multi- Objective Job Shop Scheduling Problem", Evolving Systems, Volume 2, Issue 2, June 2011, pp. 119-129.
11. R. Cheng, M. Gen and Y. Tsujimura, "A Tutorial Survey of Job-Shop Scheduling Problems using Genetic Algorithms, Part II: Hybrid Genetic Search Strategies", Computers & Industrial Engineering, Volume 36, Issue 2, April 1999, pp. 343-364.
12. H. Mühlenbein and H.M. Voigt," Gene pool recombination in genetic algorithms", In Proc. of the Metaheuristics Conference, 1995. Kluwer Academic Publishers, Norwell, USA.
13. A E. Eiben and, C. H Van Kemenade," Diagonal crossover in genetic algorithms for numerical optimization", Control and Cybernetics, Vol. 26, 1997, pp. 447-466.
14. A. Wu, P.W.M. Tsang, T.Y.F. Yuen, and L.F. Yeung,"Affine invariant object shape matching using genetic algorithm with multi-parent orthogonal recombination and migrant principle", Applied Soft Computing, vol. 9, issue 1, 2009, pp. 282-289.
15. S. Tsutsui & L.C. Jain, "On the effect of multi-parents recombination in binary coded genetic algorithms", In Knowledge-Based Intelligent Electronic Systems, 1998. Proceedings KES '98. 1998 Second International Conference on (Vol.3, pp. 155-160). IEEE.
16. S. Tsutsui, M. Yamamur, and T. Higuchi,"Multi-parent recombination with simplex crossover in real coded genetic algorithms", In Proceedings of the genetic and evolutionary computation conference, Vol. 1,1999, pp. 657-664.
17. A. E. Eiben, P. -E. Raué and Zs. Ruttkay, "Genetic Algorithms with Multi-Parent Recombination", Parallel Problem Solving from Nature-PPSN III. Lecture Notes in Computer Science, 1994, Volume 866/1994, 78-87.
18. C.K. Ting, C.H. Su and C.N. Lee, "Multi-Parent Extension of Partially Mapped Crossover for Combinatorial Optimization Problems", Expert Systems with Applications, volume 37, Issue 3, 15 March 2010, pp. 1879-1886.
19. C. Bierwirth, Dirk C. Mattfeld and Herbert Kopfer, "On Permutation Representations for Scheduling Problems", Lecture Notes in Computer Science, Volume 1141/1996, 1996, pp. 310-318.
20. C. Bierwirth, "A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms", OR Spectrum, Volume 17, Number 2-3, 1995, pp. 87-92.
21. A. Sprecher, R. Kolisch, and A. Drexl,"Semi-active, active, and non-delay schedules for the resourceconstrained project scheduling problem", European Journal of Operational Research, vol. 80, issue 1, 1995, pp. 94-102.
22. T. Yamada and R. Nakano, "A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems", Parallel Problem Solving from Nature, vol. 2 1992, 281-290, Elsevier Science Publishers.
23. M. Gen, Y. Tsujimura abd E. Kubota, "Solving Job-Shop Scheduling Problems by Genetic Algorithm", System, Man, and Cybernetics, 1994. 'Humans, Information and Technology', 1994 IEEE international Conference, vol. 2 pp. 1577-1582.
24. J. E. Beasley, "OR-Library: Distributing Test Problems by Electronic Mail". The Journal of the Operational Research Society, Vol. 41, No. 11 (Nov., 1990), pp. 1069-1072.
25. D. Applegate and W. Cook, "A Computational Study of the Job-Shop Scheduling Problem". ORSA Journal on Computing, Vol. 3, No. 2, Spring 1991, pp. 149-156.
26. S. Binato, W.J Hery, D.M. Loewenstern, and M.G.C Resende,"A GRASP for job shop scheduling", Essays and surveys in metaheuristics, 2001, pp. 59-79.
27. U. Dorndorf and E. Pesch, "Evolution based learning in a job shop scheduling environment", Computers & Operations Research, vol. 22, issue 1, 1995, pp. 25-40.