By Topic

A Genetic Algorithm-Based Approach to Flexible Job-Shop 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
$31 $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

3 Author(s)
Hongze Qiu ; Sch. of Comput. Sci. & Technol., Shandong Univ., Jinan, China ; Wanli Zhou ; Hailong Wang

Flexible Job-shop Scheduling Problem (FJSP) is one of extremely hard problems because it requires very large combinatorial search space. Genetic algorithm is wildly used to solve Flexible Job-shop Scheduling Problem. This paper presents an improved genetic algorithm. The improved genetic algorithm we proposed uses many different strategies to get a better result. During the phase of create initial population, the improved genetic algorithm takes into account the number of operations in each job. And the intelligent mutation strategy is used which makes every individual and gene have different probability to mutate. In this paper, the object of scheduling algorithm is to get a sequence of the operations on machines to minimize the makespan. And the performance of the improved genetic algorithm is compared with another genetic algorithm. During the experiment, the two improvements are compared respectively with the compared genetic algorithm. The results show that the improved genetic algorithm outperforms the compared algorithm.

Published in:

Natural Computation, 2009. ICNC '09. Fifth International Conference on  (Volume:4 )

Date of Conference:

14-16 Aug. 2009