Abstract: The resourceconstrained project scheduling problem is addressed in this paper. As the basic particle swarm optimization (BPSO) method is easy to be trapped in a local optimum, a chaos particle swarm optimization (CPSO) algorithm is proposed. It combines the chaos algorithm with the BPSO and is used to solve the typical multiple resourcesconstrained project scheduling problem. To test the performance of the proposed method, both BPSO and CPSO are used to solve an instance. Comparison shows that CPSO performs better than BPSO in average deviation from the optimum and the percentage of reaching the optimal value, etc. Also, it has better convergence than BPSO. However, in the average time to achieve the optimum, the CPSO is not as good as BPSO.

Key words: chaos, particle swarm optimization (PSO), resourceconstrained project scheduling