机动时间的奇异特性及其在项目调度中的应用

发布时间：2018-04-21 16:04

本文选题：项目管理 + 机动时间　；参考：《华北电力大学》2014年博士论文

【摘要】：工程项目中,各部门在时间方面日益激烈的竞争已成为当前的趋势。时间在上世纪八十年代就被认为是一种竞争优势资源,并且项目的时间性能现已是吸引项目管理者致力于改进的一个主要目标。项目的时间性能可通过时间网络直观地展示出来。本论文针对经典的时间网络(CPM网络和GPRs网络),从新的视角对其机动时间的特性进行了研究。本文的研究重点是机动时间的奇异特性,例如,发现了：1)有些工序的机动时间会越用越多；2)有些工序越赶工,对总工期的威胁越大；3)有些工序的机动时间有多个值,用于约束工序的各类调度方式；4)有些工序的工期缩短也有机动时间约束。这些特性不同于已有的理论,更是在传统观念下无法认知的,甚至否定了传统观念和公理。在揭示并分析了机动时间的特性后,本文进一步研究了它们的应用,主要针对它们在项目调度中的影响和作用,例如资源限制项目调度问题、时间-费用权衡问题等,特别是带有GPRs的问题,总结了其应用规律。另外,现有的机动时间概念及特性只局限在时间网络中,本文拓广了机动时间特性的应用领域,将其扩展到长度网络,特别是无向长度网络。这些特性揭示了无向网络中路线的分布规律,有助于解决相关的路径问题。该扩展研究体现了将机动时间的特性拓广到其它领域的可能性,如交通网络、流量网络、通信网络和电网络等。本论文的主要研究成果如下： (1)探索了GPRs网络中机动时间的奇异特性。本文发现了GPRs网络中的奇异现象——工序的机动时间会越用越多。时间可看作资源,这一现象意味着“资源越用越多”的可能性。另外,本文还发现了另一个奇异现象——赶工悖论。某工序赶工是为了缩短工期,从而在后期有更多的机动时间,减小对总工期的威胁,但是这一奇异现象却揭示了这样的方式很可能适得其反。本文通过研究这些奇异现象,发现了机动时间的奇异特性——总时差多值性。工序的各类调度方式(如推迟开始时间、延长和缩短工期)都会受相应的总时差限制。针对这些不同的方式,本文提出了不同类型的总时差的新概念,以及计算方法,揭示了它们的差异,为GPRs网络的准确应用提供了理论指导和依据。 (2)研究了机动时间的特性(特别是奇异特性)在项目调度中的应用。对于带有GPRs的资源限制项目调度问题,总时差的多值性至关重要,需要根据不同的调度方式(推迟工序开始时间或延长工序工期)选择使用不同类型的总时差,否则将导致错误的结果。对于时间-费用权衡问题,特别是非线性和离散型问题(NP-hard),利用机动时间的特性实现问题的等效化简,从而大幅减少求解时的计算量。这是处理大型复杂问题的最有效的途径之一。“总费用最低”是项目调度的一个主要目标,也是处理很多优化调度问题的重要起点。对于带有GPRs的项目最小费用问题,直接求解较为困难。本文利用GPRs网络的特性和对偶原理,将该问题转化为两个等效的特殊问题——最小费用最大流问题和产销平衡的运输问题。这两个问题能够运用现有的简单算法求解,从而有效地解决了原问题。 (3)研究了机动时间特性的拓展。本文将机动时间的特性从时间网络拓展到长度网络,特别是,拓展到无向网络中,利用这些特性揭示了这些网络中路线的规律,有助于求解相关的路径问题。
[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.

【学位授予单位】：华北电力大学
【学位级别】：博士
【学位授予年份】：2014
【分类号】：TU722

【参考文献】