A recent paper (Davidovi'et al 2012) presented a bee colony metaheuristic for scheduling independent tasks to identical processors, evaluating its performance on a benchmark set of instances from the literature. We examine two exact algorithms from the literature, the former published in 1995, the latter in 2008 (and not cited by the authors). We show that both such algorithms solve to proven optimality all the considered instances in a computing time that is several orders of magnitude smaller than the time taken by the new algorithm to produce an approximate solution.
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem / Dell'Amico, Mauro; Iori, Manuel; S., Martello; M., Monaci. - In: JOURNAL OF HEURISTICS. - ISSN 1381-1231. - STAMPA. - 18:6(2012), pp. 939-942. [10.1007/s10732-012-9209-3]
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem
DELL'AMICO, Mauro;IORI, MANUEL;
2012
Abstract
A recent paper (Davidovi'et al 2012) presented a bee colony metaheuristic for scheduling independent tasks to identical processors, evaluating its performance on a benchmark set of instances from the literature. We examine two exact algorithms from the literature, the former published in 1995, the latter in 2008 (and not cited by the authors). We show that both such algorithms solve to proven optimality all the considered instances in a computing time that is several orders of magnitude smaller than the time taken by the new algorithm to produce an approximate solution.File | Dimensione | Formato | |
---|---|---|---|
s10732-012-9209-3.pdf
Accesso riservato
Tipologia:
Versione pubblicata dall'editore
Dimensione
235.72 kB
Formato
Adobe PDF
|
235.72 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
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