Title: A hybrid particle swarm optimization for job shop scheduling problem
Authors: Sha, D. Y.
Hsu, Cheng-Yu
Department of Industrial Engineering and Management
Keywords: job shop problem;scheduling;particle swarm optimization
Issue Date: 1-Dec-2006
Abstract: A hybrid particle swarm optimization (PSO) for the job shop problem (JSP) is proposed in this paper. In previous research. PSO particles search solutions in a continuous solution space. Since the solution space of the JSP is discrete, we modified the particle position representation, particle movement, and particle velocity to better suit PSO for the JSP. We modified the particle position based on preference list-based representation, particle movement based on swap operator, and particle velocity based on the tabu list concept in our algorithm. Giffler and Thompson's heuristic is used to decode a particle position into a schedule. Furthermore, we applied tabu search to improve the solution quality. The computational results show that the modified PSO performs better than the original design, and that the hybrid PSO is better than other traditional metaheuristics. (c) 2006 Elsevier Ltd. All rights reserved.
URI: http://dx.doi.org/10.1016/j.cie.2006.09.002
ISSN: 0360-8352
DOI: 10.1016/j.cie.2006.09.002
Volume: 51
Issue: 4
Begin Page: 791
End Page: 808
Appears in Collections:Articles

Files in This Item:

  1. 000243055300016.pdf