摘要：Resource-constrained project scheduling problem is the traditional optimization problem considering constraint conditions of resource supply, which makes the problem more difficult to solve in real life. Resource-constrained project scheduling problem is a typical NP-hard problem, which is quite popular issue in recent years. This article firstly analyzes the literature review of resource-constrained project scheduling problem. And then, the mathematical model of this problem is established, and the solution via the genetic algorithm is also developed. Finally, the numerical experiment is adopted to verify the effectiveness and efficiency of the proposed model and algorithm.
关键词：Resource-constrained;Project Scheduling;Genetic Algorithm;NP-hard Problem
