A Fast Algorithm for Grid Job Scheduling
一种快速网格任务调度策略

In a grid environment, the goals of the user and the resource provider can be conflicting, that is, the user may have the goals of minimizing turn-around time and the cost for the job, while a resource provider may have the goals of improving the throughput of the resources. So grid job scheduling is not only an NP-Hard problem, but also a multi-object optimization problem. In this paper, we propose a grid scheduler based on Ant Colony Algorithm, which satisfies the mutually conflicting goals of the users and the resource provider, as well as improves the velocity of the scheduler, by taking advantage of historical information on scheduling to form the initial information pheromone.