Grid jobs scheduling: The Alienated Ant Algorithm solution

Grid is a manifold and highly dynamic scenario. One of the fundamental issues in this environment is related to jobs scheduling; since jobs allocation to resources is a combinatorial optimization problem, NP-hard in most cases, several heuristics have been proposed to achieve near-optimal solutions. This paper proposes a job scheduling policy based on the Alienated Ant Algorithm (AAA), a new metaheuristic strategy freely inspired by the ants' self-organization ability. As it will be shown, AAA is able to find near-optimal solutions adapting its decisions to changing resources states and submitted workload. The experimental results show that the use of the proposed algorithm satisfies expectations.