By Topic

An application of immune genetic algorithm for 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)
Jia Ma ; Sch. of Economic & Manage., Shenyang Inst. of Aeronaut. Eng., Shenyang, China ; Yunlong Zhu ; Tianran Wang

The flexible job-shop scheduling problem (FJSP) is one of the most general and difficult of all traditional scheduling problem. The paper presents a novelty immune genetic algorithm (IGA) to solve the problem. This algorithm preserves the random global search ability of simple genetic algorithm (SGA), and introduces the immune mechanism by which the necessary vaccine may be extracted with the scheduling vaccinated so as to improve efficiently SGA's low ability for global search because of immature convergence and low local search ability. Thus, the IGA proposed can provide such ability and convergence rate that will implement the global optimum solution. The computation results validate the effectiveness of the proposed algorithm .

Published in:

Computer Application and System Modeling (ICCASM), 2010 International Conference on  (Volume:11 )

Date of Conference:

22-24 Oct. 2010