A variable neighbourhood search algorithm 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 within a local search is carried out. In this paper, a variable neighbourhood search algorithm is proposed for Job Shop Scheduling (JSS) problem with makespan criterion. The results gained by VNS algorithm are presented and compared with the best known results in literature. It is concluded that the VNS implementation is better than many recently published works with respect to the quality of the solution. © Springer-Verlag Berlin Heidelberg 2006.

• Presentation Conference Type: Conference Paper (published)
• Conference Name: EVOCOP 2006
• Publication Date: Jul 14, 2006
• Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
• Print ISSN: 0302-9743
• Publisher: Springer Verlag
• Peer Reviewed: Peer Reviewed
• Volume: 3906 LNCS
• Pages: 261-271
• Book Title: Evolutionary Computation in Combinatorial Optimization
• DOI: https://doi.org/10.1007/11730095_22
• Keywords: variable neighbourhood search, job-shop scheduling
• Public URL: https://uwe-repository.worktribe.com/output/1040344
• Publisher URL: http://dx.doi.org/10.1007/11730095_22
• Additional Information: Title of Conference or Conference Proceedings : 6th European Conference EvoCOP