Title: A two-level Particle Swarm Optimisation algorithm on Job-Shop Scheduling Problems

Authors: Pisut Pongchairerks, Voratas Kachitvichyanukul

Addresses: Industrial Engineering Program, Sirindhorn International Institute of Technology, Thammasat University – Rangsit Campus, P.O. Box 22, Pathum Thani, 12121, Thailand. ' Industrial Engineering and Management, School of Engineering and Technology, Asian Institute of Technology, P.O. Box 4, Klong Luang, Pathumthani, 12120, Thailand

Abstract: The paper first presents an efficient PSO algorithm called GLN-PSO_c. It is a variant of the standard PSO algorithm that requires a mapping procedure in order to solve a specific problem. Two mapping procedures are proposed in this paper for GLN-PSO_c. The first mapping combined with GLN-PSO_c is a heuristics for JSP and is called JSP-PSO. The second mapping combined with GLN-PSO_c resulted in a parameter-tuning algorithm called PT-PSO. The combination of these two algorithms JSP-PSO and PT-PSO forms a two-level PSO. It is efficient and able to generate very good solutions on the benchmark instances.

Keywords: PSO; particle swarm optimisation; job shop scheduling; makespan.

DOI: 10.1504/IJOR.2009.023535

International Journal of Operational Research, 2009 Vol.4 No.4, pp.390 - 411

Published online: 27 Feb 2009 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article