An intelligent hybrid algorithm for job-shop scheduling based on particle swarm optimization and artificial immune system

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 using a set of benchmark instances with various sizes and levels of hardness and compared with other approaches reported in some existing literatures. The computational results validate the effectiveness of the proposed approach. © 2007 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Hong-wei, G., Wen-li, D., Feng, Q., & Lu, W. (2007). An intelligent hybrid algorithm for job-shop scheduling based on particle swarm optimization and artificial immune system. Advances in Soft Computing, 41, 628–637. https://doi.org/10.1007/978-3-540-72432-2_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free