The development of cash flow weight procedures for maximizing the net present value of a project
开发了启发式程序，通过为活动分配基于累计现金流的权重，并应用多遍移位算法搜索改进方案，以最大化大型项目的净现值。
Abstract We describe in this paper the development of heuristic procedures for obtaining improved solutions to the maximize ion of net present value in a network problem. Optimization techniques have not been successful in solving this limited resource problem for large projects. As a result, rule‐of‐thumb heuristic approaches have historically been used to improve the financial returns from project activity. The heuristic procedures we describe assign weights to activities based upon the cumulative cash flows for the activity and all of its logical successors. Subsequent application of multi‐pass shifting algorithms search locally for improved activity assignments, resulting in increased project net present value over the initial solution obtained. Results reported demonstrate the efficacy of this approach over more traditional methods for solving this problem. We also contrast the cash flow weighting heuristics developed with other implementations of cash flow weighting procedures. Despite their inherent simplicity, the procedures described quite often produce improved results over other approaches when maximum net present value solutions are desired.