scholarly journals Multi-objective Variable Neighborhood Search Algorithms for a Single Machine Scheduling Problem with Distinct due Windows

2011 ◽  
Vol 281 ◽  
pp. 5-19 ◽  
Author(s):  
José Elias Claudio Arroyo ◽  
Rafael dos Santos Ottoni ◽  
Alcione de Paiva Oliveira
Keyword(s):  
Single Machine ◽  
Variable Neighborhood Search ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Search Algorithms ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Due Windows ◽  
Neighborhood Search Algorithms ◽  
Objective Variable

scholarly journals A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance

2019 ◽  
Vol 53 (1) ◽  
pp. 289-302 ◽  
Author(s):  
Hanane Krim ◽  
Rachid Benmansour ◽  
David Duvivier ◽  
Abdelhakim Artiba
Keyword(s):  
Single Machine ◽  
Variable Neighborhood Search ◽  
Search Algorithm ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Computational Time ◽  
Neighborhood Search ◽  
Scheduling Problem ◽  
Periodic Maintenance ◽  
Neighborhood Search Algorithm

In this paper we propose to solve a single machine scheduling problem which has to undergo a periodic preventive maintenance. The objective is to minimize the weighted sum of the completion times. This criterion is defined as one of the most important objectives in practice but has not been studied so far for the considered problem. As the problem is proven to be NP-hard, and a mathematical model is proposed in the literature, we propose to use General Variable Neighborhood Search algorithm to solve this problem in order to obtain near optimal solutions for the large-sized instances in a small amount of computational time.

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.

Sign in / Sign up

Export Citation Format

Share Document