By Topic

A Symbiotic Evolutionary Algorithm for Flexible Job Scheduling Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhang Yan ; Sch. of Comput. Sci. & Technol., Shandong Univ., Jinan, China ; Qiu Hongze

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 strengthen 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.

Published in:

Computer Science and Engineering, 2009. WCSE '09. Second International Workshop on  (Volume:1 )

Date of Conference:

28-30 Oct. 2009