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 available as:
[img]
Preview
PDF
License: Creative Commons Attribution Non-commercial

Download (100kB) | Preview

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
Document type
Article
Creators
CreatorsAffiliationORCID
Dell’Amico, Mauro
Martello, Silvano
Keywords
operations research, parallel processing systems, scheduling, problem solving, computational complexity, algorithms
Subjects
ISSN
0377-2217
DOI
Deposit date
07 Apr 2006
Last modified
31 Oct 2012 11:50
URI

Other metadata

Downloads

Downloads

Staff only: View the document

^