关键词: 项目进度管理, 最大网络时差, CPM网络计划, Fulkerson算法

Abstract: Network float of network planning denotes sum of floats which could be consumed practically by each activity in project, and it isn't the simple sum of floats in theory. Network float determines sum of the maximal reachable durations of all activities in practice under the condition of fixed total duration, and is closely correlative to cost management and time management of project engineering. The network float is variable, and is correlative to time schedule of each activity. It illustrates that value especial maximal value of the float could be decided the by adjusting time schedule of activities, and then realizes the optimization of cost and time. In this paper, firstly, the meaning of network float is analyzed from a new visual angle; secondly, algorithm to solve maximal network float is designed based on the above meanings, and the algorithm is that we transform the problem to especial “time-cost tradeoff problem” by founding and analyzing the model of maximal network float, which could be solved by using classic algorithm such as Fulkerson algorithm; and finally, the algorithm is demonstrated by an example.

Key words: project schedule management, maximal network float, CPM Network planning, Fulkerson algorithm