Grid resource scheduling problem is proved to be an NP complete problem, and genetic algorithms are proved to be sharpen tools to solve NP-complete problem.
网格资源调度问题被证明是一个NP完全问题，而遗传算法是解决NP完全问题的锐利工具。
Resource allocation and task scheduling of Grid is an NP-hard problem. Ant algorithm has proved to be a kind of effective algorithm to solve this kind of problems.
网格环境下的资源分配与调度是一个NP难问题，蚂蚁算法是解决这类问题的有效算法。
The resource-constrained project scheduling problem (RCPSP) is NP problem, most of commercial project management software usually employ simple priority rules for solving the problem.
资源平衡优化问题即资源有限项目调度问题，是一个NP难问题，现在商用项目管理软件系统中的资源平衡优化问题多采用基于优先规则的启发式算法。
The resource-constrained project scheduling problem (RCPSP) is NP problem, most of commercial project management software usually employ simple priority rules for solving the problem.
资源平衡优化问题即资源有限项目调度问题，是一个NP难问题，现在商用项目管理软件系统中的资源平衡优化问题多采用基于优先规则的启发式算法。
应用推荐