期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 160, 期 2, 页码 576-578出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2004.06.002
关键词
scheduling; identical parallel machines; exact solution; branch-and-bound
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据