CAJ | 학술논문

CPM网络计划的网络时差表示项目中各工序实际可使用的机动时间的总和（绝非理论上机动时间的简单加总），即CPM网络计划的总机动时间，它决定着在总工期不变的前提下，所有工序实际可以达到的最大工期的总和，与项目的成本管理和时间管理密切相关。网络时差是变量，取决于各工序的时间进度安排，说明可以通过调整工序的时间进度来决定该时差的取值，特别是其最大值，进而实现成本和时间优化。本文首先从新的角度分析了网络时差的含义；然后，在此基础上设计了求解最大网络时差的算法，其思路为，通过建立和分析最大网络时差模型，将其转化为特殊的“时间-费用权衡问题”，进而可运用Fulkerson 算法等经典算法求解；最后，通过应用举例对该算法进行了演示。
CPM망락계화적망락시차표시항목중각공서실제가사용적궤동시간적총화（절비이론상궤동시간적간단가총），즉CPM망락계화적총궤동시간，타결정착재총공기불변적전제하，소유공서실제가이체도적최대공기적총화，여항목적성본관리화시간관리밀절상관。망락시차시변량，취결우각공서적시간진도안배，설명가이통과조정공서적시간진도래결정해시차적취치，특별시기최대치，진이실현성본화시간우화。본문수선종신적각도분석료망락시차적함의；연후，재차기출상설계료구해최대망락시차적산법，기사로위，통과건립화분석최대망락시차모형，장기전화위특수적“시간-비용권형문제”，진이가운용Fulkerson 산법등경전산법구해；최후，통과응용거례대해산법진행료연시。
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 correla-tive 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 prob-lem 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 dem-onstrated by an example .