Solving the Scheduling Problem in Computational Grid using Artificial Bee Colony Algorithm

Scheduling tasks on computational grids is known as NPcomplete problem. Scheduling tasks in Grid computing, means assigning tasks to resources such that the time termination andaverage waiting time criteria and the number of required machines are optimized. Based on heuristic or meta-heuristicsearch have been proposed to obtain optimal solutions. The presented method tries to optimize all of the mentioned criteria with artificial bee colony system with consideration to precedence of tasks. Bee colony optimization is one of algorithms which categorized in swarm intelligence that can be used in optimizationproblems. This algorithm is based on the intelligent behavior of honey bees in foraging process. The result shows using bees forsolving scheduling problem in computational grid makes better finish time and average waiting time

کلیدواژه ها:

artificial bee colony ، Grid scheduling ، communication cost ، precedence right