Deconstructing Nowicki and Smutnicki's -TSAB tabu search algorithm for the job-shop scheduling problem

2006 ◽  
Vol 33 (9) ◽  
pp. 2623-2644 ◽  
Author(s):  
Jean-Paul Watson ◽  
Adele E. Howe ◽  
L. Darrell Whitley
Keyword(s):  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Tabu Search Algorithm ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling

scholarly journals A Tabu-Genetic Hybrid Search Algorithm for Job-shop Scheduling Problem

2019 ◽  
Vol 95 ◽  
pp. 04007
Author(s):  
Yan Ge ◽  
Aimin Wang ◽  
Zijin Zhao ◽  
Jieran Ye
Keyword(s):  
Genetic Algorithm ◽  
Tabu Search ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Search Algorithm ◽  
Search Performance ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Hybrid Search ◽  
Shop Scheduling

To deal with the job-shop scheduling problem (JSP), a tabu-genetic hybrid search algorithm is proposed. The algorithm generates several initial solutions distributed in the whole solution space for tabu search by genetic algorithm, which avoids the over-dependence on the initial solution of tabu search algorithm. With the mechanism mentioned above, the algorithm proposed has both global search performance of genetic algorithm and local search performance of labu search algorithm. Finally, a program was developed with the achral data of FT (10x 10). to verify the feasibility and effectiveness of the algorithm. The result shows that the algorithm achieves satisfactory results in all indexes mentioned above.

Sign in / Sign up

Export Citation Format

Share Document