简介:InthispaperweprovethatthesinglemachinecommonduedateweightedtardinessproblemisNP-hard.
THE NP-HARDNESS OF THE SINGLE MACHINE COMMON DUE DATE WEIGHTED TARDINESS PROBLEM