DocumentCode :
2566357
Title :
A Particle Swarm Optimization for Resource-Constrained Multi-Project Scheduling Problem
Author :
Linyi, Deng ; Yan, Lin
fYear :
2007
fDate :
15-19 Dec. 2007
Firstpage :
1010
Lastpage :
1014
Abstract :
This paper considers the resource-constrained multi-project scheduling problem (RCMPSP) and makespan minimization as objective. We present a new particle swarm optimization (PSO) approach to solve this problem. The particle representation is based on precedence feasible of activities list. Based on the particle representation, a new update method based on one-point crossover is proposed. The framework of PSO for the RCMPSP according to the representation and the update method is developed. We test the algorithm, and the experimental results show that our PSO outperforms other heuristic methods.
Keywords :
Computational complexity; Computational intelligence; Computer security; Genetic algorithms; Job shop scheduling; Marine vehicles; Particle swarm optimization; Processor scheduling; Production; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security, 2007 International Conference on
Conference_Location :
Harbin
Print_ISBN :
0-7695-3072-9
Electronic_ISBN :
978-0-7695-3072-7
Type :
conf
DOI :
10.1109/CIS.2007.157
Filename :
4415500
Link To Document :
بازگشت