摘要
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.
基金
This work is supported by the National Natural Science Foundation of China