“…In addition, we assume that the total number of search points is limited in this paper. Therefore, the assignment of the local search effort and the global search effort, and the optimal size of the neighborhood are adopted according to the results obtained from the paper (Nakano et al, 2001). The proposed algorithm is applied to solving classical JSSPs, and the effectiveness is examined by comparing it with GA.…”