We show that the scheduling problem is NP-hard in the strong sense.

本文证明了上述排序模型是强NP困难的。

youdao

We show that the scheduling problem is NP-hard in the strong sense.

本文证明了上述排序模型是强NP困难的。

youdao