By Topic

Flexible job shop scheduling problem solving based on genetic algorithm with chaotic local search

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

2 Author(s)
Libo Song ; Sch. of Bus. Adm., South China Univ. of Technol., Guangzhou, China ; Xuejun Xu

Flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem, and provides a closer approximation to real world scheduling situations. This paper present a hybrid genetic algorithm (GA) combined with chaotic local search to solve the FJSP with MAKESPAN criterion. A small percentage of elitist individuals are introduced into the initial population to fasten GA's convergence speed, efficient crossover and mutation operators are adopted to avoid infeasible solutions and to hasten the emergency of optimum solution. During the local search process, Logistic chaotic sequence is adopted to explore better neighborhood solutions around the best individual of the current generation. Representative flexible job shop scheduling benchmark problems are solved in order to test the effectiveness and efficiency of the proposed algorithm.

Published in:

Natural Computation (ICNC), 2010 Sixth International Conference on  (Volume:5 )

Date of Conference:

10-12 Aug. 2010