Most of computer science is somewhere in the middle, and involves finding an efficient (if not optimal) solution to a problem with real requirements.
很多的计算机科学是一种折中的选择，和包含找到一种解决现实需求的有效（不是最理想的）方法。
Finding an optimal scheduling for such an environment is a NP-hard problem, and so heuristic approaches must be used in general to get an optimal approximation solution.
由于在这样的环境中找到一个最优的调度是一个NP难问题，通常运用各种启发式算法来找到近似最优解。
Its optimal solution is obtained by finding a nonnegative solution of compatible equations.
其最优解是通过求一个相容方程组的非负解而得到。
应用推荐