發(fā)布時間：2018-04-21 16:04

  本文選題：項目管理 + 機動時間　； 參考：《華北電力大學(xué)》2014年博士論文

【摘要】：工程項目中,各部門在時間方面日益激烈的競爭已成為當(dāng)前的趨勢。時間在上世紀(jì)八十年代就被認(rèn)為是一種競爭優(yōu)勢資源,并且項目的時間性能現(xiàn)已是吸引項目管理者致力于改進(jìn)的一個主要目標(biāo)。 項目的時間性能可通過時間網(wǎng)絡(luò)直觀地展示出來。本論文針對經(jīng)典的時間網(wǎng)絡(luò)(CPM網(wǎng)絡(luò)和GPRs網(wǎng)絡(luò)),從新的視角對其機動時間的特性進(jìn)行了研究。本文的研究重點是機動時間的奇異特性,例如,發(fā)現(xiàn)了：1)有些工序的機動時間會越用越多；2)有些工序越趕工,對總工期的威脅越大；3)有些工序的機動時間有多個值,用于約束工序的各類調(diào)度方式；4)有些工序的工期縮短也有機動時間約束。這些特性不同于已有的理論,更是在傳統(tǒng)觀念下無法認(rèn)知的,甚至否定了傳統(tǒng)觀念和公理。在揭示并分析了機動時間的特性后,本文進(jìn)一步研究了它們的應(yīng)用,主要針對它們在項目調(diào)度中的影響和作用,例如資源限制項目調(diào)度問題、時間-費用權(quán)衡問題等,特別是帶有GPRs的問題,總結(jié)了其應(yīng)用規(guī)律。另外,現(xiàn)有的機動時間概念及特性只局限在時間網(wǎng)絡(luò)中,本文拓廣了機動時間特性的應(yīng)用領(lǐng)域,將其擴展到長度網(wǎng)絡(luò),特別是無向長度網(wǎng)絡(luò)。這些特性揭示了無向網(wǎng)絡(luò)中路線的分布規(guī)律,有助于解決相關(guān)的路徑問題。該擴展研究體現(xiàn)了將機動時間的特性拓廣到其它領(lǐng)域的可能性,如交通網(wǎng)絡(luò)、流量網(wǎng)絡(luò)、通信網(wǎng)絡(luò)和電網(wǎng)絡(luò)等。 本論文的主要研究成果如下： (1)探索了GPRs網(wǎng)絡(luò)中機動時間的奇異特性。 本文發(fā)現(xiàn)了GPRs網(wǎng)絡(luò)中的奇異現(xiàn)象——工序的機動時間會越用越多。時間可看作資源,這一現(xiàn)象意味著“資源越用越多”的可能性。另外,本文還發(fā)現(xiàn)了另一個奇異現(xiàn)象——趕工悖論。某工序趕工是為了縮短工期,從而在后期有更多的機動時間,減小對總工期的威脅,但是這一奇異現(xiàn)象卻揭示了這樣的方式很可能適得其反。本文通過研究這些奇異現(xiàn)象,發(fā)現(xiàn)了機動時間的奇異特性——總時差多值性。工序的各類調(diào)度方式(如推遲開始時間、延長和縮短工期)都會受相應(yīng)的總時差限制。針對這些不同的方式,本文提出了不同類型的總時差的新概念,以及計算方法,揭示了它們的差異,為GPRs網(wǎng)絡(luò)的準(zhǔn)確應(yīng)用提供了理論指導(dǎo)和依據(jù)。 (2)研究了機動時間的特性(特別是奇異特性)在項目調(diào)度中的應(yīng)用。 對于帶有GPRs的資源限制項目調(diào)度問題,總時差的多值性至關(guān)重要,需要根據(jù)不同的調(diào)度方式(推遲工序開始時間或延長工序工期)選擇使用不同類型的總時差,否則將導(dǎo)致錯誤的結(jié)果。對于時間-費用權(quán)衡問題,特別是非線性和離散型問題(NP-hard),利用機動時間的特性實現(xiàn)問題的等效化簡,從而大幅減少求解時的計算量。這是處理大型復(fù)雜問題的最有效的途徑之一。“總費用最低”是項目調(diào)度的一個主要目標(biāo),也是處理很多優(yōu)化調(diào)度問題的重要起點。對于帶有GPRs的項目最小費用問題,直接求解較為困難。本文利用GPRs網(wǎng)絡(luò)的特性和對偶原理,將該問題轉(zhuǎn)化為兩個等效的特殊問題——最小費用最大流問題和產(chǎn)銷平衡的運輸問題。這兩個問題能夠運用現(xiàn)有的簡單算法求解,從而有效地解決了原問題。 (3)研究了機動時間特性的拓展。 本文將機動時間的特性從時間網(wǎng)絡(luò)拓展到長度網(wǎng)絡(luò),特別是,拓展到無向網(wǎng)絡(luò)中,利用這些特性揭示了這些網(wǎng)絡(luò)中路線的規(guī)律,有助于求解相關(guān)的路徑問題。
[Abstract]:In the project, the increasingly fierce competition between the departments has become the current trend. Time was considered as a competitive advantage in the 80s of last century, and the time performance of the project has now been a major goal to attract project managers to improve.
The time performance of the project can be displayed intuitively through the time network. This paper studies the characteristics of its maneuver time from a new perspective for the classic time network (CPM network and GPRs network). This paper focuses on the singular characteristics of the maneuvering time, for example, 1) the more mobile time of some processes will be used, the more the more mobile time will be used. 2) the more working in some processes, the greater the threat to the total time limit; 3) the maneuvering time of some processes has multiple values, which is used to restrict various scheduling methods; 4) the shortening of the working period and the maneuvering time constraints in some processes. These characteristics are different from the existing theories, but are not recognized in the traditional concept, and even negate the traditional concept. And axiom. After revealing and analyzing the characteristics of maneuvering time, this paper further studies their applications, mainly in view of their influence and effect on project scheduling, such as resource restriction project scheduling problem, time cost tradeoff problem, especially the problem with GPRs, and summarizes the existing maneuvering time. The concept and characteristics are limited to the time network. This paper extends the application domain of the maneuvering time characteristics and extends it to the length network, especially the undirected length network. These characteristics reveal the distribution of the route in the undirected network, and help to solve the related path problems. This extension study embodies the characteristics of the maneuvering time. To other areas such as transportation network, traffic network, communication network and electric network.
The main research results of this paper are as follows:
(1) we explored the singular characteristics of maneuvering time in GPRs networks.
This article discovered the strange phenomenon in the GPRs Network - the more mobile time of the process will be used. Time can be considered as a resource. This phenomenon means the possibility of "more use of resources". In addition, this article also finds another strange phenomenon, the labor paradox. A working process is to shorten the time limit, so that there are more machines in the later period. This singular phenomenon is likely to be counterproductive. By studying these strange phenomena, this paper finds the singular characteristics of the maneuvering time, the multivalue of the total time difference. The various scheduling methods of the process (such as postponing the start time, prolonging and shortening the duration of the work) will be correspondingly affected. The total time difference is limited. In this paper, the new concepts of different types of TDOA and calculation methods are proposed, and their differences are revealed, which provide theoretical guidance and basis for the accurate application of GPRs network.
(2) the application of the characteristics of maneuvering time (especially the singularity) in project scheduling is studied.
For resource constrained project scheduling problem with GPRs, the multivalue of TDOA is very important. It is necessary to use different types of TDOA according to different scheduling methods (postponing process start time or lengthening process time), otherwise it will lead to wrong results. For time cost tradeoff, especially nonlinear and discrete questions Problem (NP-hard), using the characteristics of maneuvering time to realize the equivalent reduction of the problem, thus greatly reducing the amount of calculation in the solution. This is one of the most effective ways to deal with large and complex problems. "The lowest total cost" is a major goal of the project scheduling and an important starting point for dealing with many optimal scheduling problems. For the items with GPRs The problem of minimizing the cost of the target is difficult to solve directly. By using the characteristics of GPRs network and the dual principle, this paper transforms the problem into two equivalent special problems, the minimum cost maximum flow problem and the transportation problem of the balance of production and marketing. These two problems can be solved by the existing simple calculation method, thus effectively solving the original problem.
(3) the expansion of the maneuvering time characteristics is studied.
In this paper, the characteristics of maneuvering time are extended from time network to length network. In particular, it is extended to undirected networks. These characteristics are used to reveal the rules of the routes in these networks and help to solve the related path problems.

【學(xué)位授予單位】：華北電力大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2014
【分類號】：TU722

【參考文獻(xiàn)】

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

1 楊冰;搭接網(wǎng)絡(luò)計劃模型分析[J];北方交通大學(xué)學(xué)報;2002年05期

2 閆瑾,張奉舉,閆睿;單代號搭接網(wǎng)絡(luò)模糊工期的計算方法[J];河南城建高等�？茖W(xué)校學(xué)報;2000年03期

3 魏道升,張智洪;搭接網(wǎng)絡(luò)計劃在公路和橋梁施工項目管理中的應(yīng)用[J];重慶交通學(xué)院學(xué)報(社會科學(xué)版);2001年03期

4 黃彬;孟國勇;;工程搭接網(wǎng)絡(luò)計劃淺議[J];大眾科技;2009年02期

5 吳喚群,唐莉,孫相軍,莫連光;搭接施工網(wǎng)絡(luò)工期優(yōu)化研究[J];系統(tǒng)工程;2001年04期

6 李星梅;乞建勛;蘇志雄;;自由時差定理與k階次關(guān)鍵路線的求法[J];管理科學(xué)學(xué)報;2009年02期

7 乞建勛;李星梅;王強;;等效子網(wǎng)絡(luò)構(gòu)建的理論與方法[J];管理科學(xué)學(xué)報;2010年01期

8 李全云;搭接網(wǎng)絡(luò)計劃時間參數(shù)計算方法的改進(jìn)[J];建筑科學(xué);2005年02期

9 任世賢;;論網(wǎng)絡(luò)時差[J];科技進(jìn)步與對策;2009年21期

10 周夢;杜志達(dá);;含有最大時距的搭接網(wǎng)絡(luò)計算方法研究[J];工程管理學(xué)報;2012年04期

，

本文編號：1783133