学科分类
/ 1
1 个结果
  • 简介:InthispaperweprovethatthesinglemachinecommonduedateweightedtardinessproblemisNP-hard.

  • 标签: DUE DATE TARDINESS NP-COMPLETE