文献类型：期刊文献

英文题名：An improved PSO algorithm and its application to grid scheduling problem

作者：Bu, Yan-Ping[1,2]; Zhou, Wei[3]; Yu, Jin-Shou[1]

机构：[1] Research Institute of Automation, East China University of Science and Technology, Shanghai 200237, China; [2] School of Technology, Shanghai Jiaotong University, Shanghai 201101, China; [3] School of Business, East China University of Science and Technology, Shanghai 200237, China

年份：2008

卷号：1

起止页码：352

外文期刊名：Proceedings - International Symposium on Computer Science and Computational Technology, ISCSCT 2008

收录：EI(收录号：20091211971991)

语种：英文

外文关键词：Multitasking - Particle swarm optimization (PSO) - Scheduling

摘要：With the advent of the grid, task scheduling in heterogeneous environments becomes more and more important. The model of grid scheduling is analyzed in this paper. The optimal objective is to minimize the total completing time. This paper presents an improved particle swarm optimization (PSO) algorithm with discrete coding rule for grid scheduling problem. The improved PSO algorithm can keep all the advantages of the standard PSO, such as implementation simplicity, low computational burden, and few control parameters, etc. A set of experiments show that the algorithm is stable and presents low variability. The preliminary results obtained in this research are auspicious. We also tested the improved PSO algorithm against the MaxMin heuristic and found that improved PSO outperforms MaxMin by the total makespan and other performance. ? 2008 IEEE.