By Topic

A modified continuous genetic algorithm and its application for job-shop scheduling

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)
Guo Xijin ; Coll. of Inf. & Electr. Eng., China Univ. of Min. & Technol., Xuzhou, China ; Gao Li

The continuous genetic algorithm has a risk for long staying on one stage before it gains the best solution. This paper presents the modified continuous genetic algorithm to overcome this disadvantage. This algorithm is applied to job-shop scheduling to test its validity. The test results show this algorithm is good at operation and convergence.

Published in:

Intelligent Control and Automation, 2002. Proceedings of the 4th World Congress on  (Volume:3 )

Date of Conference:

2002