A note on exact algorithms for the identical parallel machine scheduling problem
暂无分享,去创建一个
Abstract 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.
[1] Ethel Mokotoff,et al. Production , Manufacturing and Logistics An exact algorithm for the identical parallel machine scheduling problem , 2003 .
[2] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Mauro Dell'Amico,et al. Optimal Scheduling of Tasks on Identical Parallel Processors , 1995, INFORMS J. Comput..