Title: Research on a Tabu Search Algorithm for Solving Job-Shop Scheduling
Abstract: This paper presents a tabu search algorithm for solving the minimum makespan problem of Job-Shop scheduling. In the algorithm , an insertion method is used to create the initial solution and then the tabu search algorithm is applied to improve the last solution. The information of the unvisited candidate solutions is recollected , intensive search and dispersive search are reasonably balanced .Computer simulation experiments on a set of benchmark instances show that the algorithm is applicable and effective.
Publication Year: 2006
Publication Date: 2006-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot