Applying Tabu Search to theJob-Shop Scheduling Problem

In this paper we apply the tabu-search technique to the job shop scheduling problem , a notoriously difficult problem in combinatorial optimization. We show that our implementation of this methods dominates both a previous approach with tabu search and other heuristics based on iterative improvements