Year: 2014
Type: article
Abstract: Since Resource-Constrained Project Scheduling Problem (RCPSP) is a well-known NP-hard problem, it is difficult to solve large-scale practical cases by using traditional exact algorithms. Genetic algorithm (GA) is a kind of intelligent algorithm for approximate optimization, which can ascertain global optimization or suboptimal solution within a reasonable time. This article presented a new simulation algorithm by using GA for solving Resource-Constrained Project Scheduling Problem. In the algorithm, the activity adjacency matrix and priority-based preemptive resource conflict resolution are used to prevent chromosome from generating infeasible schedules. Finally, the method was tested with an actual machine and electricity project case, and the results show that the presented method is efficient and practical for practical project cases.
Authors: L. Peng, P. Wuliang
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: hybrid
Award: 基于关键链的项目离散时间\成本\质量综合调度问题研究
OpenAlex ID: W2145155453
