By Topic

An improved adaptive particle swarm optimization algorithm for 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 $31
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)
Wenbin Gu ; Coll. of Mech. & Electr. Eng., Nanjing Univ. of Aeronaut. & Astronaut., Nanjing, China ; Dunbing Tang ; Kun Zheng

This paper presents an improved adaptive particle swarm optimization algorithm (IAPSO) which is inspired from hormone modulation mechanism for solving the minimum makespan problem of job shop scheduling problem (JSP). The environment around swarms and incretion factors are used to modify the updating equations of particle swarm, and the performance of particle swarm optimization is improved. The computational results validate the effectiveness of the proposed IAPSO, which can not only find optimal or close-to-optimal solutions but can also obtain both better and more robust results than the existing PSO algorithms reported recently in the literature. By employing IAPSO, machines can be used more efficiently, which means tasks can be allocated appropriately, production efficiency can be improved, and the production cycle can be shortened efficiently.

Published in:

Advanced Technology of Design and Manufacture (ATDM 2010), International Conference on

Date of Conference:

23-25 Nov. 2010