An Tentative Taboo Search Algorithm for Job Shop Scheduling

An effective heuristic algorithm for solving the minimum makespan problem of job shop scheduling is presented. With a given feasible solution as a start point, we use Taboo Search technique to get a schedule for each neighbor of all its neighbors, and select the best one of the schedules as the new start point. We repeat the procedure, unless the new start point is not better than the proceeding one. To make sure of better results, we introduce reverse technique to the algorithm as well. The computational experiments of the 45 standard instances show that our algorithm yields better results than TSAB algorithm.