期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 202, 期 1, 页码 1-7出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2009.04.007
关键词
Scheduling
We review the latest theoretical developments for the single-machine total tardiness 1//(T) over bar scheduling problem and propose extensions to some of them. We also review (and in some cases extend) exact algorithms, fully polynomial time approximation schemes, heuristic algorithms, special cases and generalizations of the 1//(T) over bar problem. Our findings indicate that the 1//(T) over bar problem continues to attract significant research interest from both a theoretical and a practical perspective. Even though the problem is ordinary NP-hard, the current state-of-the-art algorithms are capable of solving problems with up to 500 jobs. (C) 2009 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据