Applying tabu search to the job-shop scheduling problem

Abstract

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 method dominates both a previous approach with tabu search and the other heuristics based on iterative improvements. © 1993 J.C. Baltzer AG, Science Publishers.