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

A recently published paper by Mokotoff presents an exact algorithm for the classical P\\C-max 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. (C) 2004 Elsevier B.V. All rights reserved.