计算机工程与应用Issue(14)：253-257,270,6.DOI:10.3778/j.issn.1002-8331.1307-0420
多资源约束的项目调度问题离散粒子群算法
Multiple resource constrained project scheduling problem with discrete particle swarm optimization
崔建双 1杨建华1
作者信息
- 1. 北京科技大学 东凌经济管理学院，北京 100083
- 折叠
摘要
Abstract
A discrete particle swarm optimization algorithm for solving Resource Constrained Project Scheduling Prob-lem(RCPSP)is presented. A priority-integer-coding list is used to represent a scheduling which uses the sparse adjacent matrix to judge the precedence constrains and the one-unit-time-putting-off policy to solve the resource conflicts. The main innovative point of this algorithm is that the project scheduling can directly involve in the iterative calculation and then the activity swaps occur following the calculation results. This totally resolves the discrete integer-coding issues in applying particle swarm optimization algorithm. The algorithm is simple and easy to do and can be applied to similar prob-lems. The instance test results demonstrate its effectiveness and feasibility.关键词
多资源约束项目调度问题/离散粒子群算法/整数编码Key words
multiple resource constrained project scheduling problem/discrete particle swarm optimization/integer coding分类
信息技术与安全科学引用本文复制引用
崔建双,杨建华..多资源约束的项目调度问题离散粒子群算法[J].计算机工程与应用,2015,(14):253-257,270,6.
