Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem

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 al...

Full description

Saved in:
Bibliographic Details
Main Author: Pisut Pongchairerks
Format: Article
Language:English
Published: Wiley 2016-01-01
Series:Modelling and Simulation in Engineering
Online Access:http://dx.doi.org/10.1155/2016/5071654
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832553217137836032
author Pisut Pongchairerks
author_facet Pisut Pongchairerks
author_sort Pisut Pongchairerks
collection DOAJ
description 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.
format Article
id doaj-art-ad276906cede4756b897d2ac28c823f2
institution Kabale University
issn 1687-5591
1687-5605
language English
publishDate 2016-01-01
publisher Wiley
record_format Article
series Modelling and Simulation in Engineering
spelling doaj-art-ad276906cede4756b897d2ac28c823f22025-02-03T05:55:16ZengWileyModelling and Simulation in Engineering1687-55911687-56052016-01-01201610.1155/2016/50716545071654Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling ProblemPisut Pongchairerks0Industrial Engineering Program, Faculty of Engineering, Thai-Nichi Institute of Technology, Bangkok 10250, ThailandThis 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.http://dx.doi.org/10.1155/2016/5071654
spellingShingle Pisut Pongchairerks
Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem
Modelling and Simulation in Engineering
title Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem
title_full Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem
title_fullStr Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem
title_full_unstemmed Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem
title_short Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem
title_sort forward vns reverse vns and multi vns algorithms for job shop scheduling problem
url http://dx.doi.org/10.1155/2016/5071654
work_keys_str_mv AT pisutpongchairerks forwardvnsreversevnsandmultivnsalgorithmsforjobshopschedulingproblem