A modified tabu search algorithm for the job-shop problem

In this paper, a modified tabu search algorithm is presented. The algorithm forbids a solution of Job-Shop scheduling problem by encoding the solutions visited during the search process and using hashing to keep track of the solution. A back visit strategy is used. The main idea of the strategy is to resume the search from unvisited neighbors of solutions previously generated. The results of computer simulation experiment indicate that the algorithm is applicable and effective.