Title: A hybrid algorithm based on Tabu search for no-wait flow shop
Abstract: To the problem that it takes minimum makespan problem of no-wait flow shop scheduling, a hybrid algorithm based on tabu search is proposed. Scheduling rules is used to create the initial solution, Tabu search algorithm of varying neighborhood is applied to improve the last solution. The algorithm reduces the size of neighborhood and running time with reachability. Information of the unvisited candidate solutions is recollected, intensive search and dispersive search is reasonably balanced. Numerical experiments show that the algorithm is applicable and effective.
Publication Year: 2008
Publication Date: 2008-07-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 2
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot