关键词: 多资源约束项目调度问题, 离散粒子群算法, 整数编码

Abstract: A discrete particle swarm optimization algorithm for solving Resource Constrained Project Scheduling Problem （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 problems. The instance test results demonstrate its effectiveness and feasibility.

Key words: multiple resource constrained project scheduling problem, discrete particle swarm optimization, integer coding