A NOTE ON "A SIMPLE CPM TIME-COST TRADEOFF ALGORITHM"

This article describes a modified algorithm for critical path method time-cost tradeoff. The algorithm suggests rules for choosing paths and minimizing the total cost of expediting activities in order to complete projects in the time desired. Several examples of the algorithm's usage are presented. The author observes that the algorithm presented in this paper provides the optimum solution to all the network problems he solved. Comparisons are made of the effectiveness of the critical path method time-cost tradeoff algorithm and other algorithms.