By Topic

Decomposition and immune genetic algorithm for scheduling large job shops

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)
Rui Zhang ; Dept. of Autom., Tsinghua Univ., Beijing ; Cheng Wu

A decomposition and optimization algorithm is presented for large-scale job shop scheduling problems in which the total weighted tardiness must be minimized. In each iteration, a new subproblem is first defined by a heuristic approach and then solved using a genetic algorithm. We construct a fuzzy controller to calculate the characteristic values which describe the the bottleneck jobs in different optimization stages. Then, these characteristic values are used to guide the process of subproblem-solving in an immune mechanism. Numerical computational results show that the proposed algorithm is effective for solving large-scale scheduling problems.

Published in:

Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on

Date of Conference:

1-6 June 2008