The problem is known to he NP-hard when the waiting-time extension coefficients have two arbitrary values.

在两合机器的情况下，当延伸系数允许取两个不同值时，该问题已被证明是难问题。

youdao

The problem is known to he NP-hard when the waiting-time extension coefficients have two arbitrary values.

在两合机器的情况下，当延伸系数允许取两个不同值时，该问题已被证明是难问题。

youdao