A Tabu Search Algorithm for Job Shop Scheduling

2000 ◽  
Vol 16 (10) ◽  
pp. 765-771 ◽  
Author(s):  
S. G. Ponnambalam ◽  
P. Aravindan ◽  
S. V. Rajesh
Keyword(s):  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Shop Scheduling

A New Solution Seed for Job Shop Scheduling Problem

2011 ◽  
Vol 110-116 ◽  
pp. 3899-3905
Author(s):  
Parviz Fattahi ◽  
Mojdeh Shirazi Manesh ◽  
Abdolreza Roshani
Keyword(s):  
Tabu Search ◽  
Large Scale ◽  
Production Management ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Np Hard ◽  
Shop Scheduling ◽  
Large Scale Problems

Scheduling for job shop is very important in both fields of production management and combinatorial optimization. Since the problem is well known as NP-Hard class, many metaheuristic approaches are developed to solve the medium and large scale problems. One of the main elements of these metaheuristics is the solution seed structure. Solution seed represent the coding structure of real solution. In this paper, a new solution seed for job shop scheduling is presented. This solution seed is compared with a famous solution seed presented for the job shop scheduling. Since the problem is well known as NP-Hard class, a Tabu search algorithm is developed to solve large scale problems. The proposed solution seed are examined using an example and tabu search algorithm.

Sign in / Sign up

Export Citation Format

Share Document