The present work considers the reduction of the mean completion time and the makespan in the single machine scheduling problem with ready times. A Tabu-Search-based heuristic procedure is proposed to find the sequence that allows to reach a value of the cost function as close as possible to the global minimum. Computational tests are carried out to compare the performance of the Tabu Search procedure with those of other heuristics. Comparisons are made both in terms of mean completion time and makespan.
Tabu search for the single machine sequencing problem with ready times / Braglia, M; Melloni, Riccardo. - 2:(1995), pp. 395-403. (Intervento presentato al convegno Proceedings of the 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. Part 1 (of 3) tenutosi a Paris, Fr, null nel 1995).
Tabu search for the single machine sequencing problem with ready times
MELLONI, Riccardo
1995
Abstract
The present work considers the reduction of the mean completion time and the makespan in the single machine scheduling problem with ready times. A Tabu-Search-based heuristic procedure is proposed to find the sequence that allows to reach a value of the cost function as close as possible to the global minimum. Computational tests are carried out to compare the performance of the Tabu Search procedure with those of other heuristics. Comparisons are made both in terms of mean completion time and makespan.
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
