A stochastic strategy for solving job shop scheduling problem

A computationally effective heuristic algorithm for finding the minimum make-span problem of job shop scheduling is presented. The proposed local search method is based on a new tabu search technique and on a modification of an improved shifting bottleneck procedure with a stochastic strategy. Computational experiments show that our algorithm finds shorter make-span than some typical approximation approaches discussed in the literatures.