Task scheduling is an important part in Grid computing.As it has been proven to be NP- complete, it is adopt to be solved by heuristics.
英
美
- 摘要 在网格计算中,任务调度是一个重要的组成部分,并被证明为NP完全问题,以启发式方法求解较为适合。