A recently published paper by Mokotoff presents an exact algorithm for the classical PiCmax scheduling problem, evaluating its average performance through computational experiments on a series of randomly generated test problems. It is shown that, on the same types of instances, an exact algorithm proposed 10 years ago by the authors of the present note outperforms the new algorithm by some orders of magnitude.
A Note on Exact Algorithms for the Identical Parallel Machine Scheduling Problem / Dell'Amico, Mauro; S., Martello. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - STAMPA. - 160:2(2005), pp. 576-578. [10.1016/j.ejor.2004.06.002]
A Note on Exact Algorithms for the Identical Parallel Machine Scheduling Problem.
DELL'AMICO, Mauro;
2005
Abstract
A recently published paper by Mokotoff presents an exact algorithm for the classical PiCmax scheduling problem, evaluating its average performance through computational experiments on a series of randomly generated test problems. It is shown that, on the same types of instances, an exact algorithm proposed 10 years ago by the authors of the present note outperforms the new algorithm by some orders of magnitude.
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S037722170400339X-main.pdf
Accesso riservato
Tipologia:
Versione pubblicata dall'editore
Dimensione
232.98 kB
Formato
Adobe PDF
|
232.98 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
Note.pdf
Open access
Tipologia:
Versione originale dell'autore proposta per la pubblicazione
Dimensione
97.83 kB
Formato
Adobe PDF
|
97.83 kB | Adobe PDF | Visualizza/Apri |
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
