Variable neighbourhood search algorithms applied to job-shop scheduling problems

Pisut Pongchairerks

International Journal of Mathematics in Operational Research, 2014, vol. 6, issue 6, 752-774

Abstract: This research attempts to find the neighbourhood structures of the variable neighbourhood search (VNS) algorithm well fitting to job-shop scheduling problem (JSP). So as to achieve this objective, this research adapts the seven neighbourhood structures given by the travelling salesman problem's literature to create the seven VNS algorithms for JSP. The performances of these proposed VNS algorithms are then compared to the performances of several existing algorithms, i.e., ACO, PSO and VNS algorithms taken from previously published literature. The comparison indicates that all proposed VNS algorithms perform better than the ACO and PSO algorithms with the significance level of 0.05. This paper finally reveals the neighbourhood structures performing well to JSP.

Keywords: variable neighbourhood search; VNS; job shop scheduling; ant colony optimisation; particle swarm optimisation; ACO; PSO. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=65421 (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:ijmore:v:6:y:2014:i:6:p:752-774

Access Statistics for this article

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