A Modified Taboo Search Algorithm for the Job-Shop Problem
一种用于Job-Shop调度问题的改进禁忌搜索算法

In this paper, a modified taboo search algorithm is presented. The algorithm realized to forbid a solution of Job-Shop scheduling problem by encoding the solution 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.