Parallel variable neighbourhood search algorithms for job shop scheduling problems

2007 ◽  
Vol 18 (2) ◽  
pp. 117-133 ◽  
Author(s):  
Mehmet Sevkli ◽  
M. Emin Aydin
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithms ◽  
Variable Neighbourhood Search ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Neighbourhood Search

A New Neighborhood for the Job Shop Scheduling Problem

2012 ◽  
Vol 433-440 ◽  
pp. 1540-1544
Author(s):  
Mohammad Mahdi Nasiri ◽  
Farhad Kianfar
Keyword(s):  
Local Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithms ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Job Shop Scheduling Problem ◽  
Local Search Algorithms ◽  
Shop Scheduling ◽  
Neighborhood Structures

The effectiveness of the local search algorithms for shop scheduling problems is proved frequently. Local search algorithms like tabu search use neighborhood structures in order to obtain new solutions. This paper presents a new neighborhood for the job shop scheduling problem. In this neighborhood, few enhanced conditions are proposed to prevent cycle generation. These conditions allow that the neighborhood encompasses larger number of solutions without increasing the order of computational efforts.

Sign in / Sign up

Export Citation Format

Share Document