Title: Hybrid tabu search for scheduling reentrant jobs on parallel machines
Abstract: A hybrid tabu search algorithm was proposed in this paper for the reentrant scheduling problem on parallel machines with a remote service equipment.Concerning that only one start-point was used in the traditional tabu search algorithm which made it trapped in local optimum easily,a Restart method was established in the hybrid tabu search algorithm.When the traditional tabu search algorithm was trapped in local optimum,the Restart method was used to rebuild the initial solution and preceded with the tabu search algorithm.Thus,the traditional single start-point search was changed into multiple start-points search.Comparisons were made between the hybrid tabu search algorithm and a Coordinate Scheduling(CS) algorithm.The computational experiments show the effectiveness of the hybrid tabu search algorithm,whose optimization performance is superior to the CS algorithm.Moreover,the computation time is acceptable.
Publication Year: 2012
Publication Date: 2012-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot