¹College of Computer Science & Information Engineering, Zhejiang Gongshang University, Hangzhou, P. R. China
²School of Business Administration, Zhejiang Gongshang University, Hangzhou, P. R. China
³Center for Studies of Modern Business, Zhejiang Gongshang University, Hangzhou, P. R. China

---

Abstract—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. Resourceconstrained 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 resourceconstrained 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.

Index Terms—Resource-constrained, Project Scheduling, Genetic Algorithm, NP-hard Problem.

[PDF]

Cite: Tinggui Chen, Guanglan Zhou, "Research on Project Scheduling Problem with Resource Constraints," Journal of Software vol. 8, no. 8, pp. 2058-2063, 2013.