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

Salva citazione

Citato da

Full text disponibile come:

Anteprima

Documento PDF
Licenza: Creative Commons Attribution Non-commercial 3.0 (CC BY-NC 3.0)
Download (100kB) | Anteprima

URL ufficiale: http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6VCT-4CVWW3P-9-1&_cdi=5963&_user=606145&_orig=search&_coverDate=01%2F16%2F2005&_qd=1&_sk=998399997&view=c&wchp=dGLbVzz-zSkWb&md5=0a337e02afbea69389455088e52471ae&ie=/sdarticle.pdf

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

Autore	Affiliazione	ORCID
Dell’Amico, Mauro
Martello, Silvano

Parole chiave

operations research, parallel processing systems, scheduling, problem solving, computational complexity, algorithms

Settori scientifico-disciplinari

Area 01 - Scienze matematiche e informatiche > MAT/09 Ricerca operativa

ISSN

0377-2217

DOI

10.1016/j.ejor.2004.06.002

Data di deposito

07 Apr 2006

Ultima modifica

31 Ott 2012 11:50

URI

https://amsacta.unibo.it/id/eprint/2116

Altri metadati

Statistica sui download

Vedi altre statistiche

Gestione del documento:

Strumenti di navigazione

Collezioni AlmaDL

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

Abstract

Altri metadati

Statistica sui download

Statistica sui download