@article {10.3844/jcssp.2013.1669.1679, article_type = {journal}, title = {A SURVEY: PARTICLE SWARM OPTIMIZATION-BASED ALGORITHMS FOR GRID COMPUTING SCHEDULING SYSTEMS}, author = {Ambursa, Faruku Umar and Latip, Rohaya}, volume = {9}, number = {12}, year = {2013}, month = {Nov}, pages = {1669-1679}, doi = {10.3844/jcssp.2013.1669.1679}, url = {https://thescipub.com/abstract/jcssp.2013.1669.1679}, abstract = {Bio-inspired heuristics have been promising in solving complex scheduling optimization problems. Several researches have been conducted to tackle the problems of task scheduling for the heterogeneous and dynamic grid systems using different bio-inspired mechanisms such as Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO). PSO has been proven to have a relatively more promissing performance in dealing with most of the task scheduling challenges. However, to achieve optimum performance, new models and techniques for PSO need to be developed. This study surveys PSO-based scheduling algorithms for Grid systems and presents a classification for the various approaches adopted. Metatask-based and workflow-based are the main categories explored. Each scheduling algorithm is described and discussed under the suitable category.}, journal = {Journal of Computer Science}, publisher = {Science Publications} }