THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM  

作　　者：YUAN Jinjiang (Department of Mathematics,Zhengzhou University,Zhengzhou 450052,China) 

出　　处：《Systems Science and Mathematical Sciences》1992年第4期328-333,共6页

基　　金：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.In this paper we prove that the single machine common due dateweighted tardiness problem is NP-hard.

关 键 词：DUE DATE TARDINESS NP-COMPLETE 

分 类 号：N94[自然科学总论—系统科学]