Simplification of Large Scale Network in Time-cost Tradeoff Problem

摘要

For the time-cost tradeoff problem, if the involved super large-scale CPM network is simplified, then any correlative algorithm which used to solve the problem is simplified too. According to the idea, firstly, property of free float and relation of free float and path length is analyzed, and some new conceptions and free float theorem are deduced; secondly, an algorithm of simplifying the super large-scale network in time-cost tradeoff problem is designed by using these conceptions and the theorem, and validity of the algorithm is proved; finally, application of the algorithm is discussed by illustration. The theoretic proof and illustration show that if the algorithm is used to simplify the time-cost tradeoff problem, any correlative algorithm which used to solve the problem could be greatly simplified.