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.
Applying Tabu Search to theJob-Shop Scheduling Problem / Dell'Amico, Mauro; M., Trubian. - In: ANNALS OF OPERATIONS RESEARCH. - ISSN 0254-5330. - STAMPA. - 41:(1993), pp. 231-252.
Applying Tabu Search to theJob-Shop Scheduling Problem
DELL'AMICO, Mauro;
1993
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 methods dominates both a previous approach with tabu search and other heuristics based on iterative improvements.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
