A self-tuning PSO for job-shop scheduling problems

Pisut Pongchairerks

International Journal of Operational Research, 2014, vol. 19, issue 1, 96-113

Abstract: From previously published literature, there is a well-behaved PSO variant developed for the job-shop scheduling problem. In order to construct its parameterised active schedules, this PSO uses an important input parameter controlling the maximum delay times allowed for each operation in the job-shop schedules. This research aims to enhance the performance of this algorithm by adding the ability of self-fine-tuning parameter's value into this PSO. Thus, the developed PSO can fine-tune its own parameter value proper to a particular job-shop scheduling problem during its computational time without any human support. From the numerical experiment, this new PSO algorithm performs better than the original PSO without additional computational time.

Keywords: particle swarm optimisation; self-tuning PSO; job shop scheduling; JSP; parameterised active schedules. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.inderscience.com/link.php?id=57848 (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:19:y:2014:i:1:p:96-113

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 ().