本文選題：搭接網(wǎng)絡 + 時間參數(shù)��； 參考：《華北電力大學》2017年碩士論文

【摘要】：網(wǎng)絡計劃技術是二十世紀五十年代末在美國產(chǎn)生和發(fā)展起來的一種編制大型工程進度計劃的項目管理方法,它是現(xiàn)代管理科學總結出的一種比較有效的管理手段。它的基本原理是以縮短工期、提高效率、節(jié)省勞力、降低成本消耗為最終目標,通過較為形象的工序關系圖即網(wǎng)絡圖來表示預定計劃任務的進度安排,以及各個工序之間的相互聯(lián)系,并在此基礎上進行系統(tǒng)分析、計算時間參數(shù)、找出關鍵路線和關鍵工序,然后利用機動時間進一步改進施工方案,以求得工期、資源、成本等的優(yōu)化,從而對計劃進行統(tǒng)籌規(guī)劃。網(wǎng)絡計劃技術是一種能縮一短工期、降低成本、用最快的速度順利完成計劃的有效方法。搭接網(wǎng)絡計劃技術是六十年代初出現(xiàn)的一種新的網(wǎng)絡計劃技術,搭接網(wǎng)絡與一般的CPM/PERT等網(wǎng)絡相比較,增加了一般優(yōu)先關系,因此,更加具有普遍性,也更加符合實際。搭接關系的引入,不僅是某些工序之間特殊關系表達的需要,也是編制和控制復雜系統(tǒng)網(wǎng)絡計劃的需要。但是搭接網(wǎng)絡中也出現(xiàn)了一些悖論問題,例如某一關鍵工序持續(xù)時間的延長,總工期反而縮短,關鍵工序持續(xù)時間的縮短,總工期反而延長等等。本文將對傳統(tǒng)搭接網(wǎng)絡的悖論以及悖論引發(fā)的問題進行分析,包括總工期和關鍵工序持續(xù)時間悖論以及總時差悖論,并對悖論產(chǎn)生的原因進行分析,找出悖論存在的根源;基于悖論分析提出新的搭接網(wǎng)絡模型及其計算方法,并對傳統(tǒng)的概念進行修正,例如工序、節(jié)點等等,對工序持續(xù)時間、邏輯關系及其畫法進重新定義,運用具體算例對含有最小約束的搭接網(wǎng)絡進行計算分析,總結出具體的計算步驟和計算方法,通過轉換成雙代號網(wǎng)絡來驗證新的搭接網(wǎng)絡及其計算方法的正確性,并對新的搭接網(wǎng)絡的特征進行歸納和總結。本文提出了新的搭接網(wǎng)絡模型,對搭接網(wǎng)絡圖形的表示方法與基本概念作了系統(tǒng)地論述,并在此基礎上提出了關鍵節(jié)點、工序合理持續(xù)時間等一些新的概念。新的搭接網(wǎng)絡模型不僅解決了悖論問題,而且對于關鍵線路及關鍵工作的識別也更加直觀,為進一步的工期優(yōu)化提供了便利。
[Abstract]:Network planning technology is a kind of project management method developed in the United States at the end of 1950s. It is a more effective management method summarized by modern management science. Its basic principle is to shorten the time limit, improve the efficiency, save labor, reduce the cost consumption as the ultimate goal, and express the schedule of the scheduled task through the more vivid process relation diagram, that is, the network diagram. On the basis of the analysis, the time parameter is calculated, the key route and the key working procedure are found, and the construction scheme is further improved by using the maneuver time, so as to obtain the time limit and the resource. The optimization of cost and so on, thus carries on the overall plan to the plan. Network planning technology is an effective method which can shorten the time limit, reduce the cost and complete the plan with the fastest speed. Lap network planning technology is a new network planning technology which appeared in the early 1960s. Compared with the common CPM / Pert network, the overlay network increases the general priority relationship, so it is more universal and more practical. The introduction of overlay relation is not only the need to express the special relationship between some processes, but also the need to draw up and control the network plan of complex system. However, there are some paradoxical problems in the overlay network, such as the prolongation of the duration of a key process, the shortening of the total duration, the shortening of the duration of the key process, and the extension of the total duration, and so on. In this paper, the paradox of the traditional overlay network and the problems caused by the paradox are analyzed, including the paradox of total duration and duration of key working procedure and the paradox of total time difference, and the causes of the paradox are analyzed to find out the root of the paradox. Based on the paradox analysis, a new overlay network model and its calculation method are proposed, and the traditional concepts, such as process, node, etc., are revised, and the process duration, logic relation and its drawing are redefined. A concrete example is used to calculate and analyze the lap network with minimum constraints, and the concrete calculation steps and calculation methods are summarized. The correctness of the new lap network and its calculation method is verified by converting it into a double code name network. The characteristics of the new overlay network are summarized and summarized. In this paper, a new overlay network model is proposed, the representation method and basic concept of the graph of the lap network are discussed systematically, and some new concepts, such as the key node, the reasonable duration of the working procedure, and so on, are put forward. The new overlay network model not only solves the paradox problem, but also makes the identification of key routes and key work more intuitive, which provides convenience for the further optimization of time limit.
【學位授予單位】：華北電力大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TU722

【參考文獻】

相關期刊論文 前10條

1 張國平;;論土建專業(yè)《工程項目管理》課程中的難點——雙代號網(wǎng)絡計劃工作時間參數(shù)的計算[J];科技資訊;2016年12期

2 沈敏圣;張林;王成程;鄭萬國;張文建;任振;;網(wǎng)絡計劃技術在大科學工程計劃管理中的應用[J];項目管理技術;2016年02期

3 蘇志雄;乞建勛;闞芝南;;搭接網(wǎng)絡的新表示方法與奇異現(xiàn)象研究[J];系統(tǒng)工程理論與實踐;2015年01期

4 劉樹良;熊俊;乞建勛;蘇志雄;;搭接網(wǎng)絡中關鍵工序的奇異現(xiàn)象[J];中國管理科學;2014年S1期

5 闞芝南;孔峰;乞建勛;;搭接網(wǎng)絡中的路長悖論及其特性研究[J];中國管理科學;2014年05期

6 全世海;;流水施工搭接網(wǎng)絡圖的繪制[J];重慶建筑;2013年07期

7 蘇志雄;乞建勛;王強;;GPRs條件下時間-費用權衡問題的初始最優(yōu)解[J];管理工程學報;2013年01期

8 林雪峰;;網(wǎng)絡計劃技術概述[J];科技資訊;2011年20期

9 王磊;張茜茜;解超;;單代號網(wǎng)絡搭接細分研究[J];山西建筑;2010年28期

10 李文濤;;雙代號網(wǎng)絡計劃的時間參數(shù)計算及其要點[J];科技信息;2010年23期

相關博士學位論文 前1條

1 崔萬安;廣義優(yōu)先關系網(wǎng)絡關鍵性分析[D];華中科技大學;2006年

相關碩士學位論文 前1條

1 周夢;搭接網(wǎng)絡的簡化計算方法研究[D];大連理工大學;2012年

，

本文編號：2037024