By Topic

An Effective PSO and AIS-Based Hybrid Intelligent Algorithm 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

4 Author(s)
Hong-Wei Ge ; East China Univ. of Sci. & Technol., Shanghai ; Liang Sun ; Yan-Chun Liang ; Feng Qian

The optimization of job-shop scheduling is very important because of its theoretical and practical significance. In this paper, a computationally effective algorithm of combining PSO with AIS for solving the minimum makespan problem of job-shop scheduling is proposed. In the particle swarm system, a novel concept for the distance and velocity of a particle is presented to pave the way for the job-shop scheduling problem. In the artificial immune system, the models of vaccination and receptor editing are designed to improve the immune performance. The proposed algorithm effectively exploits the capabilities of distributed and parallel computing of swarm intelligence approaches. The algorithm is examined by using a set of benchmark instances with various sizes and levels of hardness and is compared with other approaches reported in some existing literature works. The computational results validate the effectiveness of the proposed approach.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:38 ,  Issue: 2 )