Dummy Activities in Critical Path Analysis | 关键路径分析中的虚活动

📚 Dummy Activities in Critical Path Analysis | 关键路径分析中的虚活动

In project management and decision mathematics, accurately modelling the logical sequence of tasks is essential for determining the minimum project completion time. When we construct an activity-on-arc (AoA) network, certain dependency relationships cannot be represented simply by drawing standard arcs between nodes. This is where dummy activities come into play. A dummy activity is a special type of activity that has zero duration and consumes no resources; its sole purpose is to maintain correct precedence logic without allowing any timing or resource implications to distort the project schedule. Understanding how and when to use dummy activities is a core skill for the Edexcel A-Level Decision Mathematics syllabus, and it is frequently tested in network analysis questions.

在项目管理和决策数学中，准确地对任务逻辑顺序进行建模，对于确定项目的最短完成时间至关重要。当我们构建箭线图（AoA）网络时，某些依赖关系无法仅通过节点间的标准箭线来表示。这就是虚活动发挥作用的地方。虚活动是一种特殊的活动，其持续时间为零且不消耗任何资源；它唯一的目的是维持正确的先后逻辑，而不让任何时间或资源影响扭曲项目进度。理解如何使用以及在何时使用虚活动是Edexcel A-Level决策数学教学大纲中的核心技能，并且经常在网络分析题型中受到考查。

1. What Is a Dummy Activity? | 什么是虚活动？

A dummy activity is a logical connector drawn as a dashed arrow in an activity-on-arc network. Unlike real activities, which carry a duration and often require labour, materials or money, a dummy has no time value — its duration is always zero. Think of it as a 'ghost' activity that exists purely to enforce sequencing rules. For instance, if Activity C can only start after both Activity A and Activity B are finished, but B also has its own separate successor D, we might need a dummy to avoid incorrectly implying that D depends on A. The dummy simply ties the end of A to the start of C without affecting any other path.

虚活动是一个逻辑连接符，在箭线图中以虚线箭线绘制。与实际活动不同——实际活动具有持续时间并且常常需要劳动力、材料或资金——虚活动没有任何时间值，其持续时间始终为零。可以把它想象成一个“幽灵”活动，纯粹是为了强制执行顺序规则而存在。例如，如果活动C只能在活动A和活动B都完成后才开始，但B又有自己单独的后继活动D，我们就可能需要一个虚活动来避免错误地暗示D依赖于A。虚活动只是将A的结束与C的开始相连接，并不影响任何其他路径。

2. Why Dummy Activities Are Necessary | 为什么虚活动是必要的

The fundamental challenge in activity-on-arc networks is that activities are represented by arcs, and nodes represent events (points in time). Each activity must be uniquely identified by its start and end event pair. If two activities share the same start and end nodes, they become indistinguishable, which violates network conventions. More importantly, the network must faithfully reflect all logical dependencies given in a precedence table. Without dummy activities, it is often impossible to represent situations where some, but not all, successor activities depend on a particular predecessor. Dummies provide the extra flexibility needed to separate paths and avoid generating false dependencies.

箭线图网络的基本挑战在于，活动由箭线表示，而节点表示事件（时间点）。每个活动必须由其起始事件和结束事件对唯一标识。如果两个活动共享相同的起始和结束节点，它们将无法区分，这违反了网络惯例。更重要的是，网络必须忠实地反映前驱关系表中给出的所有逻辑依赖关系。如果不使用虚活动，通常不可能表示出某些（但不是全部）后继活动依赖于某一特定前驱活动的情况。虚活动提供了额外的灵活性，以便分开路径并避免产生错误的依赖关系。

3. Representing Dependencies Correctly | 正确表示依赖关系

Correct representation means that every path through the network corresponds exactly to the constraints described in the project specification. For example, suppose we have four activities: A, B, C and D. The precedence table states: A must finish before C starts; B must finish before both C and D start. If we simply connect A to C and B to C, the network would indicate that D starts after B, but would not show that C requires both A and B. To force C to wait for A as well, we need to insert a dummy from the end of A to the node where C begins, merging the paths correctly. This ensures the event signifying 'ready to start C' only occurs when both A and B are complete.

正确表示意味着网络中的每一条路径都准确地对应项目规范中描述的约束。例如，假设我们有四个活动：A、B、C和D。前驱关系表规定：A必须在C开始前完成；B必须在C和D开始前完成。如果我们简单地将A连接到C，并将B连接到C，网络将表明D在B之后开始，但不会显示C需要A和B两者都完成。为了迫使C也等待A，我们需要从A的结束处向C开始的节点插入一个虚活动，将路径正确合并。这确保了表示“可以开始C”的事件仅在A和B都完成时才发生。

4. Avoiding Duplicate Activities | 避免重复活动

In an activity-on-arc network, two different real activities cannot be identified by the same ordered pair of nodes (i, j). If, according to the logic, two activities both start at the same event and finish at the same event, we cannot draw them as two parallel solid arrows connecting the same two nodes. This is where a dummy activity is used to split one of the arrows. By redirecting one activity through a new intermediate node using a dummy, we give it a unique (i, j) pair. The dummy itself becomes a separate arc with zero duration, eliminating the duplication while preserving the correct logical structure.

在箭线图网络中，两个不同的实际活动不能由同一有序节点对(i, j)来标识。如果按照逻辑，两个活动都在同一事件开始并在同一事件结束，我们就不能将它们绘制成两条连接相同节点的平行实线箭线。这时就需要使用虚活动来分开其中一条箭线。通过使用一个虚活动将其中一个活动重定向，经过一个新的中间节点，我们为它赋予一个独特的(i, j)对。虚活动本身成为一条持续时间为零的独立弧线，在消除重复的同时保留了正确的逻辑结构。

5. Dummy Activities in Activity-on-Arc (AoA) Networks | 箭线图（AoA）网络中的虚活动

Activity-on-arc is the standard representation examined in Edexcel Decision Mathematics. In this model, activities are drawn on the arcs and events on the nodes. A dummy activity is denoted by a dashed arrow and labelled with a zero duration. When constructing the network from a precedence table, you will often need to introduce dummy activities to handle situations where activities share some but not all predecessors, or where there is a complex chain of dependencies. The key is to draw the network iteratively: start with the activities that have no predecessors, then add each subsequent activity, inserting dummies wherever necessary to maintain correct precedence without creating false links.

箭线图是Edexcel决策数学中考查的标准表示方法。在该模型中，活动绘制在弧线上，事件绘制在节点上。虚活动由虚线箭线表示，并标记为持续时间为零。在根据前驱关系表构建网络时，你经常需要引入虚活动，以处理活动共享部分（而非全部）前驱活动，或者存在复杂依赖链的情况。关键在于迭代式地绘制网络：从没有前驱活动的活动开始，然后添加每个后续活动，必要时插入虚活动，以维持正确的前驱关系而不产生错误的链接。

6. Rules for Using Dummy Activities | 使用虚活动的规则

There are several conventions that must be followed when inserting dummy activities. First, a dummy must always have zero duration — it does not appear in the calculation of earliest start times or latest finish times as a time-consuming element. Second, dummies are drawn as dashed arrows with an arrowhead showing direction. Third, each dummy must be uniquely identifiable by its start and end nodes. Fourth, a dummy should never be used to start or end the entire project; the project should still begin at a single start node and end at a single finish node, even if some dummies link to them. Finally, aim to use the minimum number of dummies needed to represent the logic correctly — overusing dummies can clutter the diagram but does not usually lose marks if the logic is correct.

插入虚活动时必须遵守若干惯例。第一，虚活动的持续时间必须始终为零——在计算最早开始时间或最晚完成时间时，它不会作为一个耗时的元素出现。第二，虚活动用虚线箭线绘制，箭头表明方向。第三，每个虚活动必须能通过其开始和结束节点唯一标识。第四，虚活动绝不应用于开始或结束整个项目；项目仍应始于单个起始节点并终止于单个结束节点，即使某些虚活动连接到它们也是如此。最后，应尽量使用最少量的虚活动来正确表达逻辑——过多使用虚活动会使图形变得杂乱，但只要逻辑正确通常不会丢分。

广告 / Sponsored

7. How to Identify When a Dummy Is Required | 如何识别何时需要虚活动

Spotting the need for a dummy usually comes with practice, but there are clear indicators. Look at the precedence table and check for activities that have a set of immediate predecessors that is a subset of another activity's predecessors. For instance, if Activity X depends on {A} and Activity Y depends on {A, B}, then the path including B must be linked to Y via a dummy from B's end, while A connects directly to X and also via the dummy to Y's start if necessary. Another trigger is when two activities start at the same node but must have different end nodes, or when multiple activities converge at a node but require selective dependency. If you attempt to draw the network without a dummy and find that a path implies a dependency that is not stated, you need a dummy to break that link.

识别何时需要虚活动通常需要练习，但也存在明确的信号。查看前驱关系表，检查那些直接前驱活动集合是另一个活动前驱集合的子集的情况。例如，如果活动X依赖于{A}，而活动Y依赖于{A, B}，那么包含B的路径必须通过一个来自B末端的虚活动连接到Y，而A既直接连接到X，也通过虚活动连接到Y的开始（如有必要）。另一个触发因素是，当两个活动始于同一节点但必须拥有不同的结束节点时，或者当多个活动汇聚于一个节点但需要选择性依赖时。如果你尝试在不使用虚活动的情况下绘制网络，并发现某条路径暗示了一个并未指明的依赖关系，那么你就需要一个虚活动来打破这种链接。

8. Drawing the Network with Dummy Activities | 绘制含虚活动的网络图

A systematic approach is best. Begin by listing all activities and their immediate predecessors. Identify those with no predecessors and draw them from the start node. Then for each successive activity, create a node for its start. Trace back which predecessors need to flow into that node. If an activity's start event requires only a subset of incoming arcs, you must insert dummy activities to bring the necessary predecessor flows together at the correct node without forcing unwanted dependencies. In complex cases, you may need to redraw parts of the network. Always double-check that every dependency in the table is satisfied and that no extra dependencies have been created. Many students find it helpful to label the nodes with numbers or letters as they go.

最好采用系统性的方法。首先列出所有活动及其直接前驱活动。找出那些没有前驱活动的活动，并将它们从起始节点绘制出来。然后，对于每个后续活动，为其开始创建一个节点。回溯哪些前驱活动需要流入该节点。如果一个活动的开始事件只要求部分流入的弧，你必须插入虚活动，将必要的前驱流汇聚到正确的节点，而不强加不需要的依赖关系。在复杂的情形下，你可能需要重绘网络的某些部分。始终仔细核对，确保表中每个依赖关系都已满足，并且没有产生额外的依赖关系。许多学生发现，在绘制过程中给节点标上数字或字母很有帮助。

9. Dummy Activities and the Critical Path | 虚活动与关键路径

Dummy activities have zero duration, so they do not directly affect the project duration or the length of any path in terms of time. However, they can influence the critical path indirectly by determining which activities must be completed before others can begin. The critical path is the longest path through the network from start to finish. When performing forward and backward passes to calculate earliest and latest event times, you treat dummy activities as if they take no time — the earliest start time of a node connected by a dummy is simply the earliest finish time of the event at the dummy's tail. It is quite common for a dummy to lie on the critical path if the logical dependency it enforces is essential for the project's timing. Always include dummies in your float calculations; they can have zero total float but still be part of the critical chain.

虚活动的持续时间为零，因此它们不会直接影响项目持续时间或任何路径的时间长度。然而，它们可以通过决定哪些活动必须在其他活动开始之前完成，间接地影响关键路径。关键路径是网络中从开始到结束的最长路径。在进行前向和后向遍历以计算最早和最晚事件时间时，你将虚活动视为不消耗时间——通过虚活动连接的节点的最早开始时间就是虚活动尾部事件的最早完成时间。虚活动位于关键路径上的情况很常见，如果它所强制的逻辑依赖关系对项目时序至关重要。在时差计算中一定要包含虚活动；它们的总时差可能为零，但依然是关键链的一部分。

10. Common Mistakes and How to Avoid Them | 常见错误及避免方法

One frequent error is forgetting to include a required dummy, which leads to missing dependencies and an incorrect critical path analysis. Another is adding unnecessary dummies that complicate the diagram but do not change the logic, which can confuse both the student and the examiner. Some students mistakenly give a dummy a non-zero duration, perhaps confusing it with a real activity. Others incorrectly treat dummy activities as if they can start a project or serve as the final activity; the project network should always have a clear single start and single end node. To avoid these pitfalls, always work methodically from the precedence table, and after drawing the network, verify each dependency one by one.

一个常见的错误是忘记包含所需的虚活动，从而导致遗漏依赖关系和不正确的关键路径分析。另一个错误是添加不必要的虚活动，使图形复杂化但并未改变逻辑，这可能会让学生和考官都感到困惑。有些学生错误地赋予虚活动非零持续时间，或许将其与实际活动混淆。其他人则错误地将虚活动视为可以启动项目或作为最终活动；项目网络应始终具有明确的单个起始节点和单个结束节点。为了避免这些陷阱，务必有条理地从前驱关系表开始工作，并在绘制网络后逐一验证每个依赖关系。

11. Worked Example | 实例讲解

Consider a small project with the following activities and immediate predecessors: A (none), B (none), C (A), D (A, B), E (B). Let's build the network. A and B start at node ①. A leads to C, so draw A from ① to ②, then C from ② onwards. B needs to go to both D and E. Activity D depends on A and B, so D cannot start at ② because that would imply E also depends on A. We create node ③ for B's completion, and draw E directly from ③. Now D needs both A and B to be finished. A finishes at ②, B finishes at ③. To merge these, we insert a dummy from ② to ③ (or vice versa depending on convention), ensuring D starts only after both are done. This dummy represents a logical link and lies on the critical path if A and B are critical.

考虑一个小型项目，包含以下活动及其直接前驱：A（无），B（无），C（A），D（A, B），E（B）。我们来构建网络。A和B从节点①开始。A指向C，所以从①到②绘制A，然后C从②往后绘制。B需要同时指向D和E。活动D依赖于A和B，因此D不能在②开始，因为那会暗示E也依赖于A。我们为B的完成创建节点③，并从③直接绘制E。现在D需要A和B都已完成。A在②完成，B在③完成。为了合并这些，我们从②到③插入一个虚活动（或根据惯例反向），确保D仅在两者都完成后才开始。这个虚活动代表一个逻辑链接，如果A和B是关键活动，它就位于关键路径上。

12. Summary and Key Points | 总结与要点

Dummy activities are an indispensable tool for building accurate activity-on-arc networks. They enforce correct precedence, resolve identity conflicts, and ensure the critical path analysis yields reliable results. Remember: dummies always have zero duration, are drawn as dashed arrows, and must never carry work or time. When you encounter a precedence table, look for subset dependencies and potential duplication of start–end pairs; these indicate the need for a dummy. Practice drawing networks step by step, and always verify the final diagram against the original constraints. Mastering dummy activities will not only boost your exam performance but also give you a deeper understanding of how project logic translates into a mathematical model.

虚活动是构建准确箭线图网络不可或缺的工具。它们强制执行正确的前驱关系，解决身份冲突，并确保关键路径分析产生可靠的结果。请记住：虚活动的持续时间始终为零，以虚线箭线绘制，并且绝不能承载工作或时间。当你遇到前驱关系表时，要寻找子集依赖以及潜在的开始–结束对重复；这些都表明需要使用虚活动。练习逐步绘制网络，并始终对照原始约束条件验证最终图形。掌握虚活动不仅能提高你的考试成绩，还能让你更深刻地理解项目逻辑如何转化为数学模型。

Published by TutorHao | Decision Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）