Scheduling optimization problem has been mathematically proven to be NP Hard problem, that there exists a polynomial solution of this problem is not to obtain the optimal solution, so the conventional algorithm can not effectively solve such problems.

mine production optimization problem in mathematics, has been proven to be a N - P Hard problem, namely, the problem did not exist polynomial solutions to optimize the conventional algorithm, and therefore cannot be an effective solution to the problem.

Set up to produce the optimized question in mathematics already by the proof was N-P the Hard question, namely this question did not have the multinomial solution to obtain the optimal solution, therefore the conventional algorithm could not effective addressing this kind of question.

Scheduling optimization problems are mathematically proved N-P Hard problems, it this problem is polynomial method for optimal solution, General algorithms cannot effectively resolve such issues it.

Scheduling optimization problem has been mathematically proven to be NP Hard problem, that there exists a polynomial solution of this problem is not to obtain the optimal solution, so the conventional algorithm can not effectively solve such problems.