By Topic

A Genetic Algorithm and Tabu Search for Solving Flexible Job Shop Schedules

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)
Guohui Zhang ; State Key Lab. of Digital Manuf. Equip. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan ; Yang Shi ; Liang Gao

Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. An improved genetic algorithm combined with local search is proposed to solve the FJSP with makespan criterion. To control the local search and convergence to the global optimal solution, time-varying crossover probability and time varying maximum step size of tabu search are introduced. Representative flexible job shop scheduling benchmark problems are solved in order to test the effectiveness and efficiency of the proposed algorithm. Computational results show that the proposed genetic algorithm is efficient and effective.

Published in:

Computational Intelligence and Design, 2008. ISCID '08. International Symposium on  (Volume:1 )

Date of Conference:

17-18 Oct. 2008