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.
CITATION STYLE
M., D., & M., T. (1993). Applying Tabu Search to the Job-Shop Scheduling Problem. Annals of Operations Research, 41, 231–252.
Mendeley helps you to discover research relevant for your work.