A note on exact algorithms for the identical parallel machine scheduling problem

Dell’Amico, Mauro ; Martello, Silvano (2005) A note on exact algorithms for the identical parallel machine scheduling problem. European Journal of Operational Research, 160 (2). pp. 576-578. ISSN 0377-2217
Full text disponibile come:
[img]
Anteprima
Documento PDF
Licenza: Creative Commons Attribution Non-commercial (CC BY-NC 3.0)

Download (100kB) | Anteprima

Abstract

A recently published paper by Mokotoff presents an exact algorithm for the classical P//Cmax 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

Abstract
Tipologia del documento
Articolo
Autori
AutoreAffiliazioneORCID
Dell’Amico, Mauro
Martello, Silvano
Parole chiave
operations research, parallel processing systems, scheduling, problem solving, computational complexity, algorithms
Settori scientifico-disciplinari
ISSN
0377-2217
DOI
Data di deposito
07 Apr 2006
Ultima modifica
31 Ott 2012 11:50
URI

Altri metadati

Statistica sui download

Statistica sui download

Gestione del documento: Visualizza il documento

^