A tabu search algorithm based on quasi-physics and quasi-human for solving the job shop scheduling problem

In this paper, an hybrid search algorithm, called TS&QQ, is proposed to solve the job shop scheduling problem. The algorithm combines tabu search and quasi-physics and quasi-human method. It uses tabu search to find the feasible solution and used quasi-physics and quasi-human method to trap from the local optimal, called off-trap strategy. This algorithm has been tested on many common problem benchmarks with various sizes. Computational experiments show that this algorithm is efficient heuristic algorithm for the problem and is better than BQ&Q, HA and IQ&Q.