Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling

2008 ◽  
pp. 125-144 ◽  
Author(s):  
Mehmet E. Aydin ◽  
Mehmet Sevkli
Keyword(s):  
Variable Neighborhood Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithms ◽  
Neighborhood Search ◽  
Shop Scheduling ◽  
Neighborhood Search Algorithms

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

2016 ◽  
Vol 2016 ◽  
pp. 1-15 ◽  
Author(s):  
Pisut Pongchairerks
Keyword(s):  
Variable Neighborhood Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithms ◽  
Problem Instance ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Neighborhood Search Algorithms

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.

scholarly journals Bi-local search based variable neighborhood search for job-shop scheduling problem with transport constraints

2020 ◽  
Author(s):  
Moussa Abderrahim ◽  
Abdelghani Bekrar ◽  
Damien Trentesaux ◽  
Nassima Aissani ◽  
Karim Bouamrane
Keyword(s):  
Manufacturing Systems ◽  
Variable Neighborhood Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Neighborhood Search ◽  
Efficient Production ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

AbstractIn job-shop manufacturing systems, an efficient production schedule acts to reduce unnecessary costs and better manage resources. For the same purposes, modern manufacturing cells, in compliance with industry 4.0 concepts, use material handling systems in order to allow more control on the transport tasks. In this paper, a job-shop scheduling problem in vehicle based manufacturing facility that is mainly related to job assignment to resources is addressed. The considered job-shop production cell has two types of resources: processing resources that accomplish fabrication tasks for specific products, and transporting resources that assure parts’ transport to the processing area. A Variable Neighborhood Search algorithm is used to schedule product manufacturing and handling tasks in the aim to minimize the maximum completion time of a job set and an improved lower bound with new calculation method is presented. Experimental tests are conducted to evaluate the efficiency of the proposed approach.

scholarly journals An Improved Genetic Algorithm with Adaptive Variable Neighborhood Search for FJSP

Algorithms ◽  
2019 ◽  
Vol 12 (11) ◽  
pp. 243
Author(s):  
Xiaolin Gu ◽  
Ming Huang ◽  
Xu Liang
Keyword(s):  
Genetic Algorithm ◽  
Hybrid Method ◽  
Variable Neighborhood Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Neighborhood Search ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Improved Genetic Algorithm ◽  
Shop Scheduling

For solving the complex flexible job-shop scheduling problem, an improved genetic algorithm with adaptive variable neighborhood search (IGA-AVNS) is proposed. The improved genetic algorithm first uses a hybrid method combining operation sequence (OS) random selection with machine assignment (MA) hybrid method selection to generate the initial population, and it then groups the population. Each group uses an improved genetic operation for global search, then the better solutions from each group are stored in the elite library, and finally, the adaptive local neighborhood search is used in the elite library for detailed local searches. The simulation experiments are carried out by three sets of international standard examples. The experimental results show that the IGA-AVNS algorithm is an effective algorithm for solving flexible job-shop scheduling problems.

Sign in / Sign up

Export Citation Format

Share Document