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

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

0.00 Avg rating0 Votes
Article ID: iaor20053074
Country: Netherlands
Volume: 160
Issue: 2
Start Page Number: 576
End Page Number: 578
Publication Date: Jan 2005
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: branch and bound
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.

Reviews

Required fields are marked *. Your email address will not be published.