Parallel variable neighbourhood search algorithms for job shop scheduling problems

Sevkli, Mehmet; Aydin, Mehmet Emin

Abstract

Variable neighbourhood search (VNS) is one of the most recent metaheuristics used for solving combinatorial optimization problems in which a systematic change of neighbourhood with a local search is carried out. However, as happens with other metaheuristics, it takes a long time to reach some useful solutions while solving some sort of hard combinatorial problems such as job shop scheduling (JSS). Parallelization is one of the most considerable policies to overcome this matter. In this paper, firstly, a number of VNS algorithms are examined for JSS problems and then four different parallelization policies are taken into account to determine efficient parallelization for VNS algorithms. The experimentation reveals the performance of various VNS algorithms and the efficiency of policies to follow in parallelization. In the end, the unilateral-ring topology, a noncentral parallelization method, is found as the most efficient policy.

• Presentation Conference Type: Conference Paper (published)
• Publication Date: Jan 1, 2007
• Journal: IMA Journal of Management Mathematics
• Print ISSN: 1471-678X
• Electronic ISSN: 1471-6798
• Publisher: Oxford University Press (OUP)
• Peer Reviewed: Peer Reviewed
• Volume: 18
• Issue: 2
• Pages: 117-133
• DOI: https://doi.org/10.1093/imaman/dpm009
• Keywords: variable neighbourhood search, parallel neighbourhood search, job shop scheduling
• Public URL: https://uwe-repository.worktribe.com/output/1029013
• Publisher URL: http://dx.doi.org/10.1093/imaman/dpm009