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

【摘要】：網(wǎng)絡(luò)計(jì)劃技術(shù)是二十世紀(jì)五十年代末在美國(guó)產(chǎn)生和發(fā)展起來(lái)的一種編制大型工程進(jìn)度計(jì)劃的項(xiàng)目管理方法,它是現(xiàn)代管理科學(xué)總結(jié)出的一種比較有效的管理手段。它的基本原理是以縮短工期、提高效率、節(jié)省勞力、降低成本消耗為最終目標(biāo),通過(guò)較為形象的工序關(guān)系圖即網(wǎng)絡(luò)圖來(lái)表示預(yù)定計(jì)劃任務(wù)的進(jìn)度安排,以及各個(gè)工序之間的相互聯(lián)系,并在此基礎(chǔ)上進(jìn)行系統(tǒng)分析、計(jì)算時(shí)間參數(shù)、找出關(guān)鍵路線和關(guān)鍵工序,然后利用機(jī)動(dòng)時(shí)間進(jìn)一步改進(jìn)施工方案,以求得工期、資源、成本等的優(yōu)化,從而對(duì)計(jì)劃進(jìn)行統(tǒng)籌規(guī)劃。網(wǎng)絡(luò)計(jì)劃技術(shù)是一種能縮一短工期、降低成本、用最快的速度順利完成計(jì)劃的有效方法。搭接網(wǎng)絡(luò)計(jì)劃技術(shù)是六十年代初出現(xiàn)的一種新的網(wǎng)絡(luò)計(jì)劃技術(shù),搭接網(wǎng)絡(luò)與一般的CPM/PERT等網(wǎng)絡(luò)相比較,增加了一般優(yōu)先關(guān)系,因此,更加具有普遍性,也更加符合實(shí)際。搭接關(guān)系的引入,不僅是某些工序之間特殊關(guān)系表達(dá)的需要,也是編制和控制復(fù)雜系統(tǒng)網(wǎng)絡(luò)計(jì)劃的需要。但是搭接網(wǎng)絡(luò)中也出現(xiàn)了一些悖論問(wèn)題,例如某一關(guān)鍵工序持續(xù)時(shí)間的延長(zhǎng),總工期反而縮短,關(guān)鍵工序持續(xù)時(shí)間的縮短,總工期反而延長(zhǎng)等等。本文將對(duì)傳統(tǒng)搭接網(wǎng)絡(luò)的悖論以及悖論引發(fā)的問(wèn)題進(jìn)行分析,包括總工期和關(guān)鍵工序持續(xù)時(shí)間悖論以及總時(shí)差悖論,并對(duì)悖論產(chǎn)生的原因進(jìn)行分析,找出悖論存在的根源;基于悖論分析提出新的搭接網(wǎng)絡(luò)模型及其計(jì)算方法,并對(duì)傳統(tǒng)的概念進(jìn)行修正,例如工序、節(jié)點(diǎn)等等,對(duì)工序持續(xù)時(shí)間、邏輯關(guān)系及其畫法進(jìn)重新定義,運(yùn)用具體算例對(duì)含有最小約束的搭接網(wǎng)絡(luò)進(jìn)行計(jì)算分析,總結(jié)出具體的計(jì)算步驟和計(jì)算方法,通過(guò)轉(zhuǎn)換成雙代號(hào)網(wǎng)絡(luò)來(lái)驗(yàn)證新的搭接網(wǎng)絡(luò)及其計(jì)算方法的正確性,并對(duì)新的搭接網(wǎng)絡(luò)的特征進(jìn)行歸納和總結(jié)。本文提出了新的搭接網(wǎng)絡(luò)模型,對(duì)搭接網(wǎng)絡(luò)圖形的表示方法與基本概念作了系統(tǒng)地論述,并在此基礎(chǔ)上提出了關(guān)鍵節(jié)點(diǎn)、工序合理持續(xù)時(shí)間等一些新的概念。新的搭接網(wǎng)絡(luò)模型不僅解決了悖論問(wèn)題,而且對(duì)于關(guān)鍵線路及關(guān)鍵工作的識(shí)別也更加直觀,為進(jìn)一步的工期優(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.
【學(xué)位授予單位】：華北電力大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：TU722

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

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

2 沈敏圣;張林;王成程;鄭萬(wàn)國(guó);張文建;任振;;網(wǎng)絡(luò)計(jì)劃技術(shù)在大科學(xué)工程計(jì)劃管理中的應(yīng)用[J];項(xiàng)目管理技術(shù);2016年02期

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

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

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

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

7 蘇志雄;乞建勛;王強(qiáng);;GPRs條件下時(shí)間-費(fèi)用權(quán)衡問(wèn)題的初始最優(yōu)解[J];管理工程學(xué)報(bào);2013年01期

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

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

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

相關(guān)博士學(xué)位論文 前1條

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

相關(guān)碩士學(xué)位論文 前1條

1 周夢(mèng);搭接網(wǎng)絡(luò)的簡(jiǎn)化計(jì)算方法研究[D];大連理工大學(xué);2012年

，

本文編號(hào)：2037024