A Hybrid Algorithm Based on Particle Swarm Optimization and Simulated Annealing for Job Shop Scheduling

Authors:
Hongwei Ge;Wenli Du;Feng Qian
Affiliations:
East China University of Science and Technology, China;East China University of Science and Technology, China;East China University of Science and Technology, China
Venue:
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 03
Year:
2007

Citing 0
Cited 3

An efficient job-shop scheduling algorithm based on particle swarm optimization

Expert Systems with Applications: An International Journal
On performance analysis of hybrid algorithm (improved PSO with simulated annealing) with GA, PSO for multiprocessor job scheduling

WSEAS Transactions on Computers
Job Shop Scheduling with the Best-so-far ABC

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an effective hybrid algorithm based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) is proposed for solving the minimum makespan problem of the job shop scheduling problem (JSSP). The hybrid algorithm combines the high global search efficiency of PSO with the powerful ability to avoid being trapped in local minimum of SA. In the particle swarm system, a novel concept for the distance and velocity of a particle is proposed to pave the way for the job-shop scheduling problem, and then the formulations of the novel PSO algorithm for the JSSP is also presented. In the simulated annealing process, a new solution in the neighborhood of the original one is generated by using a designed ë search. The hybrid 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 approaches.