Task scheduling in grid by using an improved bee colony algorithm

Job Scheduling means assigning tasks to resources such that the time termination and average waiting time criteria and the number of required machines are optimized. Scheduling of jobs is challenging and NP-complete and this is why the algorithms applied to this problem are heuristic or meta-heuristic. The presented method tries to optimize all of the mentioned criteria with improved artificial bee colony algorithm.After mapping tasks to resources, we use the ‘min-min” algorithm for resources which have been allocated more than one task. To review the accuracy of better performance, the recommended method is compared with basic bee algorithm and the results obtained were then presented as a diagram. The most important feature of the recommended method is that it has been able to present a lesser total time average.

کلیدواژه ها:

Task Scheduling ، Computational Grid ، Bee colony Algorithm ، Optimization