The problem of scheduling resource-constrained projects to maximize their Net Present Value (NPV) is studied in this paper. The performance of seventeen scheduling heuristics, ten of which are original to this work, is evaluated. Heuristic performance is rated separately on maximization of project NPV and minimization of project duration. Two of the new heuristics are significantly better than the standard heuristics at yielding higher project NPVs. These two heuristics also perform well at reducing project duration. Two heuristics, Minslack and Shortest Processing Time, that performed well in previous studies are shown to be poor performers at maximizing project NPV.
