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

Pisut Pongchairerks and Voratas Kachitvichyanukul

International Journal of Operational Research, 2009, vol. 4, issue 4, 390-411

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. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=23535 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:4:y:2009:i:4:p:390-411

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().