The problem is known as NP hard no matter whether group sub lotting is admissible or not.
无论是对于成组加工情形还是分组情形，该问题都可以被证明是NP困难的。
The transport problem with fixed charge is a kind of NP problem, and there is no polynomial algorithm which can solve it.
带固定费用的运输问题是一类NP难题，没有多项式算法可以求解。
No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。
From this we can conclude your problem is NP-Hard as well, and there is no known polynomial solution for your problem.
从这一点来看，我们可以得出你的问题赋权，没有已知多项式解决你的问题。
From this we can conclude your problem is NP-Hard as well, and there is no known polynomial solution for your problem.
从这一点来看，我们可以得出你的问题赋权，没有已知多项式解决你的问题。
应用推荐