It is one of the considerably complicated scheduling problems due to its NP-completeness.

由于其本身具有NP -完全的性质，求解具有很大的难度。

youdao

The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.

带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。

youdao

Scheduling algorithm for complicated resources management is not fit for active code, it debases transmission speed of capsules.

复杂的资源管理调度算法对主动代码的运行并不合适，相反会降低信包的传输速率。

youdao