Independent Task Scheduling in Grid Computing Based on Queen Bee Algorithm

Zahra Pooranian, Mohammad Shojafar, Bahman Javadi


The inherent dynamicity in grid computing has made it extremely difficult to come up with near-optimal solutions to efficiently schedule tasks in grids. Task Scheduling plays crucial role in Grid computing. It is a challengeable issue among scientists to achieve better results especially in makespan based on various AI methods. Nowadays, non deterministic algorithms provide better results for these tasks. In this study the task scheduling problem in Grid computing environments has been addressed. In this paper, Queen Bee Algorithm is used for resolving scheduling problem and the obtained results are compared with several Meta–heuristic Algorithms which are developed to solve the problem. As it illustrated, queen bee algorithm is declined considerably makespan and execution time parameters rather than others in different states.



Grid computing; Scheduling;Queen-Bee;PSO;Genetic;SA

Full Text:



  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

IAES International Journal of Artificial Intelligence (IJ-AI)
ISSN/e-ISSN 2089-4872/2252-8938 
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

View IJAI Stats