期刊文献+

THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM 被引量:10

THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM
原文传递
导出
摘要 In this paper we prove that the single machine common due dateweighted tardiness problem is NP-hard. In this paper we prove that the single machine common due dateweighted tardiness problem is NP-hard.
出处 《Systems Science and Mathematical Sciences》 SCIE EI CSCD 1992年第4期328-333,共6页
基金 This work is supported by the National Natural Science Foundation of China
关键词 DUE DATE TARDINESS NP-COMPLETE Due date tardiness NP-complete
  • 相关文献

同被引文献11

引证文献10

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部