Particle swarm optimization with justification and designed mechanisms for resource-constrained project scheduling problem

被引:91
作者
Chen, Ruey-Maw [1 ]
机构
[1] Natl Chin Yi Univ Technol, Dept Comp Sci & Informat Engn, Taichung 411, Taiwan
关键词
Scheduling; Particle swarm optimization; Justification; Resource-constrained project scheduling problem; GENETIC ALGORITHM;
D O I
10.1016/j.eswa.2010.12.059
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The studied resource-constrained project scheduling problem (RCPSP) is a classical well-known problem which involves resource, precedence, and temporal constraints and has been applied to many applications. However, the RCPSP is confirmed to be an NP-hard combinatorial problem. Restated, it is hard to be solved in a reasonable time. Therefore, there are many metaheuristics-based schemes for finding near optima of RCPSP were proposed. The particle swarm optimization (PSO) is one of the metaheuristics, and has been verified being an efficient nature-inspired algorithm for many optimization problems. For enhancing the PSO efficiency in solving RCPSP, an effective scheme is suggested. The justification technique is combined with PSO as the proposed justification particle swarm optimization (JPSO), which includes other designed mechanisms. The justification technique adjusts the start time of each activity of the yielded schedule to further shorten the makespan. Moreover, schedules are generated by both forward scheduling particle swarm and backward scheduling particle swarm in this work. Additionally, a mapping scheme and a modified communication mechanism among particles with a designed gbest ratio (GR) are also proposed to further improve the efficiency of the proposed JPSO. Simulation results demonstrate that the proposed JPSO provides an effective and efficient approach for solving RCPSP. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:7102 / 7111
页数:10
相关论文
共 36 条
[1]  
[Anonymous], 1 INT C SEM KNOWL GR
[2]  
[Anonymous], 5 INT C GRID COOP CO
[3]  
[Anonymous], 2008 IEEE INT C SYST
[4]  
[Anonymous], P 2 INT C GEN ALG
[5]  
[Anonymous], CZECH J FOOD SCI
[6]   SCHEDULING SUBJECT TO RESOURCE CONSTRAINTS - CLASSIFICATION AND COMPLEXITY [J].
BLAZEWICZ, J ;
LENSTRA, JK ;
KAN, AHGR .
DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) :11-24
[7]   A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version [J].
Bouleimen, K ;
Lecocq, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 149 (02) :268-281
[8]   Defining a standard for particle swarm optimization [J].
Bratton, Daniel ;
Kennedy, James .
2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, :120-+
[9]   A branch and bound algorithm for the resource-constrained project scheduling problem [J].
Brucker, P ;
Knust, S ;
Schoo, A ;
Thiele, O .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (02) :272-288
[10]   Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting [J].
Buddhakulsomsiri, Jirachai ;
Kim, David S. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 178 (02) :374-390