文献类型：会议论文

英文题名：An Improved PSO Algorithm and Its Application to Grid Scheduling Problem

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

机构：[1]E China Univ Sci & Technol, Res Inst Automat, Shanghai 200237, Peoples R China;[2]Shanghai Jiao Tong Univ, Sch Technol, Shanghai 200041, Peoples R China;[3]East China Univ Sci & Technol, Sch Business, Shanghai 200041, Peoples R China

会议论文集：International Symposium on Computer Science and Computational Technology

会议日期：DEC 20-22, 2008

会议地点：Shanghai, PEOPLES R CHINA

语种：英文

外文关键词：PSO algorithm; grid; task scheduling; makespan

摘要：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.