By Topic

Solving the job shop scheduling problem by an immune algorithm

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)
Xing-Quan Zuo ; Dept. of Autom., Tsinghua Univ., Beijing, China ; Yu-Shun Fan

An immune algorithm is presented for solving the job shop scheduling problem. In the algorithm, the niche technology is used to keep the diversity of the population and chaos variables are employed to perform antibody mutation. The code of an antibody is based on random keys, and a heuristic process is given to decode the antibody into a parameterized active schedule to reduce the solution space. Experimental results demonstrate the algorithm is effective for solving job shop problems.

Published in:

Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on  (Volume:6 )

Date of Conference:

18-21 Aug. 2005