| Article ID: | iaor19932206 |
| Country: | Switzerland |
| Volume: | 41 |
| Issue: | 1/4 |
| Start Page Number: | 231 |
| End Page Number: | 252 |
| Publication Date: | May 1993 |
| Journal: | Annals of Operations Research |
| Authors: | DellAmico Mauro, Trubian Marco |
| Keywords: | tabu search |
In this paper, the authors apply the tabu-search technique to the job-shop scheduling problem, a notoriously difficult problem in combinatorial optimization. They show that the present implementation of this method dominates both a previous approach with tabu search and the other heuristics based on iterative improvements.