Optimization Of Resource-Constrained Project Scheduling Problem Based On The Genetic Algorithm

The Resource-Constrained Project Scheduling Problem (RCPSP) is a NP-hard problem. To handle this problem, a genetic algorithm for solving resource-constrained project scheduling is presented in this paper. The suggested approach employs a way of encoding genetics based on activity precedence. The violation of activity precedence that exists within potential genetics can well be detected by using the activity matrix. Then, the resource conflict among activities of projects can be avoided by means of preempt-based resources assignment. This algorithm for solving RCPSP is implemented using VC++6.0 software, and the experiment shows that a better solution can be found in a reasonable time.