Please use this identifier to cite or link to this item:
|Title:||New algorithm for analyzing performance of neighborhood strategies in solving job shop scheduling problems|
|Authors:||Eswaramurthy, V P|
|Keywords:||Job shop scheduling;Makespan;Neighborhood structures;Pheromone trail;Tabu length;Tabu list|
|Abstract:||This paper presents tabu search to solve job shop scheduling problems. Various neighborhood strategies are introduced and an algorithm is developed to analyze performance of these strategies with new dynamic tabu length strategy. Performance of algorithm is tested using well-known benchmark problems and also compared with other algorithms.|
|Appears in Collections:|| JSIR Vol.67(08) [August 2008]|
Items in NOPR are protected by copyright, with all rights reserved, unless otherwise indicated.