A two-level Particle Swarm Optimisation algorithm on Job-Shop Scheduling Problems
by Pisut Pongchairerks, Voratas Kachitvichyanukul
International Journal of Operational Research (IJOR), Vol. 4, No. 4, 2009

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.

Online publication date: Fri, 27-Feb-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com