Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling

Details Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling

2009-06-27

arxiv.org/abs/0906.5070v1

IJCSIS June 2009 Issue, Vol. 2, No. 1

Computer Science

Data Structures and Algorithms

6 pages, International Journal of Computer Science and Information Security (IJCSIS)

Scientific paper

This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of the proposed algorithm is derived from Genetic Algorithms. Most of the scheduling problems require either exponential time or space to generate an optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and it is a NP-complete problem, but it is difficult to find the optimal solution. This paper applies Genetic Algorithms and Tabu Search for Job Shop Scheduling problem and compares the results obtained by each. With the implementation of our approach the JSS problems reaches optimal solution and minimize the makespan.

Affiliated with

Also associated with

No associations

Rating

Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Integrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-306216