Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling ProblemReport as inadecuate




Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem - Download this document for free, or read online. Document in PDF available to download.

Modelling and Simulation in Engineering - Volume 2016 2016, Article ID 5071654, 15 pages -

Research ArticleIndustrial Engineering Program, Faculty of Engineering, Thai-Nichi Institute of Technology, Bangkok 10250, Thailand

Received 19 April 2016; Revised 3 July 2016; Accepted 11 August 2016

Academic Editor: Farouk Yalaoui

Copyright © 2016 Pisut Pongchairerks. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

This paper proposes a number of forward VNS and reverse VNS algorithms for job-shop scheduling problem. The forward VNS algorithms are the variable neighborhood search algorithms applied to the original problem i.e., the problem instance with the original precedence constraints. The reverse VNS algorithms are the variable neighborhood search algorithms applied to the reversed problem i.e., the problem instance with the reversed precedence constraints. This paper also proposes a multi-VNS algorithm which assigns an identical initial solution-representing permutation to the selected VNS algorithms, runs these VNS algorithms, and then uses the best solution among the final solutions of all selected VNS algorithms as its final result. The aim of the multi-VNS algorithm is to utilize each single initial solution-representing permutation most efficiently and thus receive its best result in return.





Author: Pisut Pongchairerks

Source: https://www.hindawi.com/



DOWNLOAD PDF




Related documents