Solving job shop scheduling problems utilizing the properties of backbone and big valley

In this paper, a new metaheuristic for the job shop scheduling problem is proposed. Our approach uses the backbone and "big valley" properties of the job shop scheduling problem. The results of the computational experiments have demonstrated the high efficiency of our approach. New upper bounds have been obtained for many problems.