By Topic

Study and Application of an Improved Particle Swarm Optimization in 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
$33 $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

1 Author(s)
Ying Mingfeng ; Jinling Inst. of Technol., Nanjing

The job-shop scheduling problem (JSP) is a classical NP-hard. The traditional methods solving it have their own Advantages and shortcomings. The powerful information processing capabilities of immune system provides people enlightenment for its artificial application. As a result, immune algorithm has emerged, and gradually been applied to many engineering practices. Due to the stubborn nature of the JSP, a new method based on immune particle swarm algorithm (IPA) is initially brought forward to solve job-shop scheduling problem. In this method, the IPA flow structure is presented via combining the immune theory and the particle swarm algorithm. The encoding method based on operation is used by IPA. And operator is designed according to vaccination, variation and immune selection. Finally, the simulation result shows that the IPA has good performance in job-shop scheduling problem.

Published in:

Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on  (Volume:1 )

Date of Conference:

7-8 March 2009