Job scheduling of Grid is a NP-hard problem.The inherent parallelism and scalability of ant algorithm make the algorithm very suitable for job scheduling in the Computational Grid.

• 摘要网格环境下的作业调度是一个NP难问题，蚂蚁算法内在的并行性和可扩充性使其非常适合网格作业调度。