Multi Parents Extended Precedence Preservative Crossover For Job Shop Scheduling Problems

Malaysian Journal of Computer Science

Ong Chung Sin¹  Mohd Omar¹  Noor Hasnah Moin¹ 

关键词: Job Shop Scheduling Problems;    Genetic Algorithms;    Multi Parents Crossover;    Local Search;   

DOI  :  

学科分类：社会科学、人文和艺术（综合）

来源: University of Malaya * Faculty of Computer Science and Information Technology

【 摘 要 】

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

【 授权许可】

Unknown