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.
CITATION STYLE
Dell’Amico, M., & Trubian, M. (1993). Applying tabu search to the job-shop scheduling problem. Annals of Operations Research, 41(3), 231–252. https://doi.org/10.1007/BF02023076
Mendeley helps you to discover research relevant for your work.