New algorithm for analyzing performance of neighborhood strategies in solving job shop scheduling problems

摘要

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.