In this paper, we present an innovative and applicable algorithm for solving the project scheduling
to maximize net present value (NPV). Our algorithm has been coded in visual C++ and tested by some random
problems. The obtained results show that the proposed algorithm can solve the projects with more than 700
activities and two complexity network coefficient (CNC) in less than two seconds. Also it is able to improve the
NPV of project with 200 activities, 2 CNC, discount rate of 24% and 100 days receiving periods, about 10.73%.