Machines process sequencing problem with due date Windows in NP hard in the strong sense, traditional algorithms usually are not satisfied.
具有窗口式交货期的加工排序问题是一个强np困难问题，传统方法的计算效果往往不能令人满意。
We show that the scheduling problem is NP-hard in the strong sense.
本文证明了上述排序模型是强NP困难的。
We show that the scheduling problem is NP-hard in the strong sense.
本文证明了上述排序模型是强NP困难的。
应用推荐