| THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM |
| |
| 作者姓名： | YUAN Jinjiang |
| |
| 作者单位： | Department of Mathematics，Zhengzhou University，Zhengzhou 450052，China |
| |
| 基金项目： | This work is supported by the National Natural Science Foundation of China |
| |
| 摘 要： | In this paper we prove that the single machine common due dateweighted tardiness problem is NP-hard.
|
THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM |
| |
| YUAN Jinjiang.THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM[J].Journal of Systems Science and Complexity,1992(4). |
| |
| Authors: | YUAN Jinjiang |
| |
| Abstract: | In this paper we prove that the single machine common due date
weighted tardiness problem is NP-hard. |
| |
| Keywords: | Due date tardiness NP-complete |
| 本文献已被 CNKI 等数据库收录！ |
