An improved ant colony algorithm for independent tasks scheduling of grid

The article introduces an improved ant colony algorithm (IACO) for the grid independent tasks scheduling problem. Min-min algorithm can decide the resource which can complete the task early. Initializing the pheromone of ant colony algorithm with Min-min algorithm can improve the lack of initial pheromone, slowing speed of solving. To avoid the ¿premature¿ phenomenon of the latter part, this paper improves the parameters. The improved ant colony algorithm is more suited to the grid tasks scheduling and can make full use of the resource.