| 多处理机调度问题的粒子群优化算法 |
| |
| 引用本文： | 高尚,杨静宇.多处理机调度问题的粒子群优化算法[J].计算机工程与应用,2005,41(27):72-73,104. |
| |
| 作者姓名： | 高尚 杨静宇 |
| |
| 作者单位： | 江苏科技大学电子信息学院,镇江,212003;南京理工大学计算机科学与技术系,南京,210094;南京理工大学计算机科学与技术系,南京,210094 |
| |
| 摘 要： | 建立了多处理机调度问题数学模型,结合遗传算法的思想提出了粒子群算法来解决多处理机调度问题。经过比较测试,4种粒子群算法的效果都比较好,特别是交叉策略A和变异策略A的混合粒子群算法是最好的且简单有效的算法。
|
| 关 键 词： | 粒子群 多处理机调度问题 优化 |
| 文章编号： | 1002-8331-（2005）27-0072-02 |
| 收稿时间： | 2004-12 |
| 修稿时间： | 2004-12 |
Solving Multiprocessor Scheduling Problem by Particle Swarm Optimization Algorithm |
| |
| Gao Shang,Yang Jingyu.Solving Multiprocessor Scheduling Problem by Particle Swarm Optimization Algorithm[J].Computer Engineering and Applications,2005,41(27):72-73,104. |
| |
| Authors: | Gao Shang Yang Jingyu |
| |
| Affiliation: | 1 School of Electronics and Information,Jiangsu University of Science and Technology,Zhenjiang 212003; 2 Department of of Computer Science and Technology,Nanjing University Science and Technology, Nanjing 210094 |
| |
| Abstract: | An optimization mathematical model of multiprocessor scheduling problem is given in this paper.The particle swarm optimization algorithm combining the ideal of the genetic algorithm is recommended to solve muhiprocessor scheduling problem.All the 4 particle swarm optimization algorithms are proved effective.Especially the particle swarm optimization algorithm with across strategy A and mutation strategy A is a simple and effective better algorithm than others. |
| |
| Keywords: | particle swarm muhiprocessor scheduling problem optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
