np-hard การใช้
ประโยค
- ตัวอย่างการใช้เพิ่มเติม: 1 2 3 4 5 6 7
- It has been proven in theory that the jssp is a classical np - hard
- Because it can " t finish in polynomial time , the scheduling problem is known to be np - hard
- Because building optimal fuzzy decision tree is np - hard , it is necessary to study the heuristics
- The genetic algorithm ( ga ) is a new parallel optimize algorithm , which can be used to solve many kinds of np - hard problems
- In real shopfloor scheduling scenarios , resource restriction coexists with process restriction , which makes shopfloor scheduling problems np - hard