Simplification of Large Scale Network in Time-Cost Tradeoff Problem

In time-cost tradeoff problem, if the involved CPM super large-scale network is simplified, any correlative algorithm which used to resolve the problem is simplified too. According to the thought, firstly, speciality of free float and relation of free float and path length is analyzed, and some new conceptions and free float theorem are deduced. Then, algorithm of simplifying super large-scale network in time-cost tradeoff problem is worked out by using these conceptions and theorem, and validity of the algorithm is proved. Finally, application of the algorithm is discussed by illustration. Theoretic proof and illustration show that if the algorithm is used to simplify time-cost tradeoff problem, any correlative algorithm used to resolve the problem could be much simplified.