📚 Critical Activities in Project Network Analysis | 项目网络分析中的关键活动
In project management and decision mathematics, critical activities form the backbone of effective scheduling and resource allocation. Understanding which activities are critical allows project managers to identify tasks that directly determine the overall project duration. These activities cannot be delayed without extending the entire project timeline, making them the central focus of monitoring and control. This article explores the definition, identification methods, and practical significance of critical activities within the context of A-Level Edexcel Decision Mathematics, particularly focusing on precedence networks, activity-on-node diagrams, and forward/backward pass calculations.
在项目管理和决策数学中，关键活动构成了有效调度和资源分配的支柱。理解哪些活动是关键活动，使项目经理能够识别直接决定整个项目工期持续时间的任务。这些活动不能延迟，否则整个项目时间表都会延长，因此它们成为监控和控制的中心焦点。本文在A-Level Edexcel决策数学的背景下，探讨关键活动的定义、识别方法及其实际意义，特别聚焦于前趋网络、节点活动图以及正向/反向推算。
1. Defining Critical Activities | 关键活动的定义
A critical activity is a task within a project network that lies on the critical path. The critical path is the longest sequence of dependent activities from the start to the finish of the project, and its total duration equals the minimum possible time required to complete the entire project. If any critical activity experiences a delay, the project's overall completion date will be pushed back by exactly the same amount of time, unless compensatory measures such as crashing or fast-tracking are applied. Critical activities possess zero total float, meaning there is absolutely no room for slippage without affecting the project end date.
关键活动是项目网络中位于关键路径上的任务。关键路径是从项目开始到结束最长的依赖活动序列，其总持续时间等于完成整个项目所需的最短可能时间。如果任何关键活动发生延迟，项目的整体完成日期将被推迟完全相同的时间，除非采取赶工或快速跟进等补救措施。关键活动具有零总浮动时间，意味着在不影响项目结束日期的前提下，完全没有滑移的余地。
2. Activity-on-Node Representation | 节点活动图表示法
In Edexcel Decision Mathematics, the standard notation for representing activities uses activity-on-node (AON) diagrams, often called precedence networks. Each node is drawn as a rectangle partitioned into several sections, displaying the earliest start time (EST), duration, earliest finish time (EFT), latest start time (LST), and latest finish time (LFT). The node also includes the activity name or code. The structure is standardised as follows: the top half typically shows the earliest times, while the bottom half shows the latest times, with the duration in the centre and the activity label at the top.
在Edexcel决策数学中，表示活动的标准符号使用节点活动图（AON），通常称为前趋网络。每个节点绘制为一个分为若干部分的矩形，显示最早开始时间（EST）、持续时间、最早完成时间（EFT）、最晚开始时间（LST）和最晚完成时间（LFT）。节点还包括活动名称或代码。其结构标准化如下：上半部分通常显示最早时间，下半部分显示最晚时间，持续时间在中间，活动标签在顶部。
3. Forward Pass for Earliest Times | 计算最早时间的正向推算
d through the network by adding the duration of each activity to its EST to obtain its EFT. The EST of a successor activity is determined by the maximum EFT among all its immediate predecessors. This rule ensures that all prerequisite work is completed before any dependent task begins. The forward pass defines the minimum possible project duration, which is the EFT of the final activity.
正向推算计算每项活动的最早开始时间和最早完成时间。从EST等于0的初始节点开始，通过将每项活动的持续时间加到其EST上来获得其EFT，逐步推进网络。后续活动的EST由其所有紧前活动中最大的EFT决定。这一规则确保在从属任务开始之前，所有前置工作均已完成。正向推算定义了项目可能的最短持续时间，即最终活动的EFT。
4. Backward Pass for Latest Times | 计算最晚时间的反向推算
The backward pass begins at the final activity, setting its LFT equal to the project duration determined during the forward pass. Working backwards through the network, the LFT of a predecessor activity equals the minimum LST among all its immediate successors. The LST is then found by subtracting the activity duration from its LFT. This process yields the latest possible times each activity can start and finish without causing a delay to the overall project. The backward pass is essential for identifying float and criticality.
反向推算从最终活动开始，将其LFT设为正向推算期间确定的项目持续时间。向后遍历网络，前置活动的LFT等于其所有紧后活动中最小的LST。然后通过从活动的LFT中减去其持续时间来得出LST。该过程产生了每项活动可以开始和完成的最晚可能时间，而不会导致整个项目延迟。反向推算对于识别浮动时间和关键性至关重要。
5. Calculating Total Float | 总浮动时间的计算
art without delaying the entire project completion date. Mathematically, total float = LFT – EFT or equivalently total float = LST – scheduling. Total float is a key metric in project monitoring because it highlights where resources can be temporarily redirected without jeopardising deadlines.
总浮动时间表示一项活动可以超出其最早开始时间延迟而不会推迟整个项目完成日期的时间量。在数学上，总浮动时间 = LFT – EFT，或等同于总浮动时间 = LST – EST。总浮动时间为零的活动是关键活动。正的总浮动时间表示有松弛，允许活动管理者在调度上有一定的灵活性。总浮动时间是项目监控中的关键指标，因为它突显了在不危及截止日期的前提下，可以临时重新分配资源的地方。
6. Critical Path Identification Algorithm | 关键路径识别算法
To systematically identify critical activities, follow this algorithm: first, construct the complete precedence network using the given dependencies and durations. Second, perform the forward pass to compute EST and EFT for every node. Third, set the LFT of the final node equal to its EFT and perform the backward pass to compute LST and LFT for all nodes. Fourth, calculate the total float for each activity using LFT minus EFT. Finally, trace the continuous chain of activities from start to finish where total float equals zero. This chain is the critical path, and all activities on it are critical.
为了系统地识别关键活动，遵循以下算法：首先，使用给定的依赖关系和持续时间构建完整的前趋网络。第二，执行正向推算，计算每个节点的EST和EFT。第三，将最终节点的LFT设为其EFT，并执行反向推算，计算所有节点的LST和LFT。第四，使用LFT减去EFT计算每项活动的总浮动时间。最后，追踪从开始到结束总浮动时间为零的连续活动链。该链即为关键路径，上面的所有活动都是关键活动。
7. Multiple Critical Paths | 多条关键路径
Some project networks contain more than one critical path. When two or more paths through the network share the same maximum total duration, they are all critical. In such cases, delaying any activity on any of these paths will extend the project duration. Multiple critical paths increase project risk because more activities have zero float, reducing overall scheduling flexibility. Identifying all critical paths requires careful examination of total float values across all sequences; any alternative path achieving the same end-to-end duration as the longest path must also consist exclusively of critical activities.
一些项目网络包含不止一条关键路径。当通过网络的两条或更多路径具有相同的最大总持续时间时，它们都是关键路径。在这种情况下，延迟这些路径上的任何活动都会延长项目持续时间。多条关键路径增加了项目风险，因为更多的活动具有零浮动时间，降低了整体调度的灵活性。识别所有关键路径需要仔细检查所有序列中的总浮动时间值；任何达到与最长路径相同的端到端持续时间的替代路径，也必须完全由关键活动组成。
8. Interpreting Gantt Charts and Cascade Diagrams | 解读甘特图与级联图
Gantt charts provide a visual representation of activity schedules, with horizontal bars indicating the timing of each task based on earliest start times. Critical activities are often highlighted in a distinct colour or pattern. When the chart is adjusted to show latest start times, the float becomes visible for non-critical activities while critical activities remain fixed. Cascade diagrams extend this concept by shading the float regions alongside the activity bars, making it immediately obvious which tasks have flexibility and which are rigidly fixed on the critical path.
甘特图提供了活动调度的可视化表示，水平条指示基于最早开始时间的每项任务的时间安排。关键活动通常以不同的颜色或图案突出显示。当图表调整为显示最晚开始时间时，非关键活动的浮动时间变得可见，而关键活动保持固定。级联图扩展了这一概念，通过在活动条旁边对浮动区域进行着色，使得哪些任务具有灵活性、哪些任务在关键路径上严格固定一目了然。
9. Resource Levelling and Critical Activities | 资源平衡与关键活动
Resource levelling aims to resolve over-allocation of resources while maintaining the project deadline. Since critical activities cannot be moved without extending the project, resource levelling primarily adjusts non-critical activities within their available float. However, when resource constraints are severe, some critical activities may need to be re-sequenced using alternative logic, but this invariably increases project duration. In such situations, project managers must negotiate extensions or apply crashing techniques, allocating additional resources to critical tasks to compress their durations.
资源平衡旨在解决资源过度分配问题，同时保持项目截止日期。由于关键活动无法在不延长项目的情况下移动，资源平衡主要在其可用浮动时间内调整非关键活动。然而，当资源约束严重时，一些关键活动可能需要使用替代逻辑进行重新排序，但这不可避免地会增加项目持续时间。在这种情况下，项目经理必须协商延期或应用赶工技术，为关键任务分配额外资源以压缩其持续时间。
10. Real-World Application in Examination Context | 考试背景下的实际应用
In Edexcel Decision Mathematics examinations, questions often present a table of activities with their durations and immediate predecessors. Candidates must construct the precedence network, calculate EST, LFT, and total float, and then clearly state the critical activities and the minimum project duration. Marks are awarded for correct node layout, accurate arithmetic, and clear identification of the critical path. Common pitfalls include misreading dependencies, incorrectly applying the maximum rule during the forward pass, and forgetting to set the final LFT equal to the project duration before starting the backward pass.
在Edexcel决策数学考试中，题目通常给出一张包含活动、持续时间及紧前活动的表格。考生必须构建前趋网络，计算EST、LFT和总浮动时间，然后明确阐述关键活动和最短项目持续时间。正确的节点布局、准确的算术运算以及清晰的关键路径识别均可获得分数。常见的失分点包括误读依赖关系、在正向推算中错误应用最大值规则，以及在开始反向推算之前忘记将最终LFT设为项目持续时间。
Published by TutorHao | Decision Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图