| 1. | It has been proven in theory that the jssp is a classical np - hard
在理论上已经证明， jssp是一个np难题。 |
| 2. | Because it can " t finish in polynomial time , the scheduling problem is known to be np - hard
由于该问题不能在多项式时间内求得最优解，因而被公认为一个np完全问题。 |
| 3. | Because building optimal fuzzy decision tree is np - hard , it is necessary to study the heuristics
由于构建最优的模糊决策树是np - hard ，因此，针对启发式算法的研究是非常必要的。 |
| 4. | The genetic algorithm ( ga ) is a new parallel optimize algorithm , which can be used to solve many kinds of np - hard problems
遗传算法是一种用于解决优化问题的并行寻优算法,已被广泛用于解决各类np问题。 |
| 5. | In real shopfloor scheduling scenarios , resource restriction coexists with process restriction , which makes shopfloor scheduling problems np - hard
但是，资源约束和工艺约束的并存，使得车间调度成为一类np - hard问题。 |
| 6. | Now there does not exist an exactly effective method that can always provide an optimal solution for np - hard problems within a reasonable time limit
至今无严格有效的方法能保证在合理的计算时间内找出np难问题的最优解。 |
| 7. | The model is formulated as a non - linear integer - programming problem . it ' s a np - hard problem , and it ' s hard to be resolved
从模型的形式上看，该模型属于运筹学领域中的非线性0 - 1整数规划问题，在理论界属于np - hard问题，求解起来很困难。 |
| 8. | In concurrent engineering ( ce ) , digital product pre - assembly planning is one of the np - hard problems and becomes a research focus in industrial automation area
在并行工程中，数字化产品序列预装配规划问题属于np难题，是自动化领域研究的热点问题之一。 |
| 9. | Owing to the strong condition of equivalence relation , there exist some limits , and it has been proved to be np - hard to find all reductions and a minimal reduction
由于等价关系条件较强，有一定的局限性，已经证明求所有约简和最小约简是np - hard问题。 |
| 10. | The genetic algorithm , which has received more attentions in solving the np - hard problem , can make an efficient search in optimized problem for a better solution
对于np完全问题，近年来兴起的遗传算法( ga ， geneticalgorithm )是一个较好的解决方案，即在较短的时间内能找到较好的解。 |
