基于悖论分析的新型搭接网络计划及其算法研究
发布时间:2018-06-18 22:07
本文选题:搭接网络 + 时间参数 ; 参考:《华北电力大学》2017年硕士论文
【摘要】:网络计划技术是二十世纪五十年代末在美国产生和发展起来的一种编制大型工程进度计划的项目管理方法,它是现代管理科学总结出的一种比较有效的管理手段。它的基本原理是以缩短工期、提高效率、节省劳力、降低成本消耗为最终目标,通过较为形象的工序关系图即网络图来表示预定计划任务的进度安排,以及各个工序之间的相互联系,并在此基础上进行系统分析、计算时间参数、找出关键路线和关键工序,然后利用机动时间进一步改进施工方案,以求得工期、资源、成本等的优化,从而对计划进行统筹规划。网络计划技术是一种能缩一短工期、降低成本、用最快的速度顺利完成计划的有效方法。搭接网络计划技术是六十年代初出现的一种新的网络计划技术,搭接网络与一般的CPM/PERT等网络相比较,增加了一般优先关系,因此,更加具有普遍性,也更加符合实际。搭接关系的引入,不仅是某些工序之间特殊关系表达的需要,也是编制和控制复杂系统网络计划的需要。但是搭接网络中也出现了一些悖论问题,例如某一关键工序持续时间的延长,总工期反而缩短,关键工序持续时间的缩短,总工期反而延长等等。本文将对传统搭接网络的悖论以及悖论引发的问题进行分析,包括总工期和关键工序持续时间悖论以及总时差悖论,并对悖论产生的原因进行分析,找出悖论存在的根源;基于悖论分析提出新的搭接网络模型及其计算方法,并对传统的概念进行修正,例如工序、节点等等,对工序持续时间、逻辑关系及其画法进重新定义,运用具体算例对含有最小约束的搭接网络进行计算分析,总结出具体的计算步骤和计算方法,通过转换成双代号网络来验证新的搭接网络及其计算方法的正确性,并对新的搭接网络的特征进行归纳和总结。本文提出了新的搭接网络模型,对搭接网络图形的表示方法与基本概念作了系统地论述,并在此基础上提出了关键节点、工序合理持续时间等一些新的概念。新的搭接网络模型不仅解决了悖论问题,而且对于关键线路及关键工作的识别也更加直观,为进一步的工期优化提供了便利。
[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 张国平;;论土建专业《工程项目管理》课程中的难点——双代号网络计划工作时间参数的计算[J];科技资讯;2016年12期
2 沈敏圣;张林;王成程;郑万国;张文建;任振;;网络计划技术在大科学工程计划管理中的应用[J];项目管理技术;2016年02期
3 苏志雄;乞建勋;阚芝南;;搭接网络的新表示方法与奇异现象研究[J];系统工程理论与实践;2015年01期
4 刘树良;熊俊;乞建勋;苏志雄;;搭接网络中关键工序的奇异现象[J];中国管理科学;2014年S1期
5 阚芝南;孔峰;乞建勋;;搭接网络中的路长悖论及其特性研究[J];中国管理科学;2014年05期
6 全世海;;流水施工搭接网络图的绘制[J];重庆建筑;2013年07期
7 苏志雄;乞建勋;王强;;GPRs条件下时间-费用权衡问题的初始最优解[J];管理工程学报;2013年01期
8 林雪峰;;网络计划技术概述[J];科技资讯;2011年20期
9 王磊;张茜茜;解超;;单代号网络搭接细分研究[J];山西建筑;2010年28期
10 李文涛;;双代号网络计划的时间参数计算及其要点[J];科技信息;2010年23期
相关博士学位论文 前1条
1 崔万安;广义优先关系网络关键性分析[D];华中科技大学;2006年
相关硕士学位论文 前1条
1 周梦;搭接网络的简化计算方法研究[D];大连理工大学;2012年
,本文编号:2037024
本文链接:https://www.wllwen.com/jianzhugongchenglunwen/2037024.html