Using discounted cash flow heuristics to improve project net present valve
研究了资源受限项目调度中最大化净现值的十七种启发式方法，其中十种为原创，发现两种新方法在提高净现值方面显著优于标准方法，而传统方法Minslack和SPT表现不佳。
Abstract 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 (SPT), that performed well in previous studies are shown to be poor performers at maximizing project NPV.