A Symbiotic Evolutionary Algorithm for Flezible Job Scheduling Problem
Flexible Job Scheduling Problem(FJSP) is an extension of classical Job Scheduling Problem(JSP) and also a problem faced by Flexible Manufacture System(FMS). In this paper, FJSP is decomposed into two sub different problems which are process planning and job scheduling, and two representations are designed for the two sub problems respectively. A symbiotic evolutionary algorithm is proposed to solve FJSP by putting the two sub problems together. To strength the search ability, a neighbourhood multi-parent crossover operator and a neighbour-based fitness function are developed and utilized in this paper. The experimental results show the proposed symbiotic evolutionary algorithm can solve FJSP well.
flezible process planning job scheduling symbiotic evolutionary algorithm neighbourhood multi-parent crossover
Zhang Yan Qiu Hongze
School of Computer Science and Technology, Shandong University Jinan,P.R.China
国际会议
第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)
南京
英文
56-61
2009-07-25（万方平台首次上网日期，不代表论文的发表时间）