期刊
OPERATIONS RESEARCH LETTERS
卷 41, 期 4, 页码 363-365出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2013.04.007
关键词
Single machine; Earliness; Tardiness; NP-hard
资金
- NSFC [11271338, 11171313]
This paper revisits the classic single-machine scheduling to minimize the total earliness and tardiness. It is known that the problem is NP-hard in the ordinary sense, but the exact complexity of the problem is long-standing open. We show in this paper that this problem is strongly NP-hard. (C) 2013 Published by Elsevier B.V.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据