📚 IB Edexcel Mathematics: Critical Path Analysis Essentials | IB Edexcel 数学：关键路径分析考点精讲
Critical Path Analysis (CPA) is a decision mathematics tool used to schedule complex projects, minimise delays, and allocate resources efficiently. It is a core topic in IB Mathematics: Applications and Interpretation HL and Edexcel A Level Decision Mathematics. Mastering CPA involves understanding activity networks, forward and backward passes, float calculation, and critical path identification.
关键路径分析 (CPA) 是一种决策数学工具，用于安排复杂项目、减少延迟并有效分配资源。它是 IB 数学：应用与解释高级水平以及 Edexcel A Level 决策数学的核心主题。掌握 CPA 需要理解活动网络、前推法和后推法、浮动时间计算以及关键路径识别。
1. Core Concepts: Activities, Nodes and Dependencies | 核心概念：活动、节点与依赖关系
In critical path analysis, a project is broken down into individual activities, each with a known duration. An activity-on-node network represents each activity as a node, typically drawn as a rectangle or circle, containing the activity label and duration.
在关键路径分析中，项目被分解为各个活动，每个活动都有一个已知的持续时间。节点式网络将每个活动表示为一个节点，通常画为矩形或圆形，包含活动标签和持续时间。
Arrows between nodes indicate precedence relationships. An activity cannot begin until all its immediate predecessors have been completed. This dependency structure defines the logical order of the project.
节点之间的箭头表示先后关系。一个活动在所有紧前活动完成之前不能开始。这种依赖结构定义了项目的逻辑顺序。
The network must have a single start node and a single end node. All activities must be connected, and there must be no loops or hanging activities.
网络必须有唯一的起始节点和唯一的结束节点。所有活动必须连接，不得有循环或悬空的活动。
2. Drawing Activity Networks | 绘制活动网络
To construct an activity network, first list all activities, their durations, and their immediate predecessors in a precedence table. This table is the foundation for drawing the network correctly.
要构建活动网络，首先在前导表中列出所有活动、它们的持续时间及紧前活动。该表是正确绘制网络的基础。
Start from the initial activities (those with no predecessors) and connect them to a start node. Then add subsequent activities according to the dependency list, ensuring that each activity’s incoming arrows come from all its direct predecessors.
从初始活动（没有紧前活动的活动）开始，将它们连接到一个起始节点。然后根据依赖列表添加后续活动，确保每个活动的入箭头来自其所有直接前驱。
When two activities share the same predecessors but must logically start at different points, or when dependencies are more complex, a dummy activity with zero duration may be needed to preserve logic without adding extra time.
当两个活动共享相同的前驱但在逻辑上必须从不同点开始，或者依赖关系更复杂时，可能需要持续时间为零的虚活动来保持逻辑而不增加额外时间。
3. Forward Pass: Earliest Start and Finish Times | 前推法：最早开始与完成时间
The forward pass calculates the earliest start time (EST) and earliest finish time (EFT) for every activity, beginning from the project start. The main rule: for the first activity, EST = 0; then EFT = EST + duration.
前推法从项目开始起计算每个活动的最早开始时间 (EST) 和最早完成时间 (EFT)。主要规则：对于第一个活动，EST = 0；然后 EFT = EST + 持续时间。
For any subsequent activity, its EST is the maximum EFT of all activities that directly precede it. This rule ensures that the activity cannot start until all required previous work is finished.
对于任何后续活动，其 EST 是所有直接前驱活动 EFT 的最大值。此规则确保活动在所有必需的前期工作完成后才能开始。
Continue this process through the network until you reach the final activity. Its EFT gives the earliest possible project completion time, which is the minimum duration required to finish the whole project.
将此过程继续遍历网络，直到到达最终活动。它的 EFT 给出了项目可能的最早完成时间，即完成整个项目所需的最短工期。
4. Backward Pass: Latest Start and Finish Times | 后推法：最晚开始与完成时间
The backward pass works from the end of the network to determine the latest start time (LST) and latest finish time (LFT) for each activity without delaying the project. For the final activity, set LFT equal to its EFT (the project duration), then LST = LFT – duration.
后推法从网络末端开始，确定每个活动在不延迟项目前提下的最晚开始时间 (LST) 和最晚完成时间 (LFT)。对于最后一个活动，设 LFT 等于其 EFT（项目工期），然后 LST = LFT – 持续时间。
For any predecessor activity, its LFT is the minimum LST of all activities that immediately follow it. By taking the minimum, you respect the tightest deadline imposed by succeeding tasks.
对于任何前驱活动，其 LFT 是所有直接后续活动 LST 的最小值。通过取最小值，你遵守了后续任务施加的最紧迫截止时间。
Once all LFT and LST values are obtained, you can compare them with the earliest times to assess scheduling flexibility.
一旦获得所有 LFT 和 LST 值，就可以将它们与最早时间进行比较，以评估调度灵活性。
5. Total Float and Critical Path Identification | 总浮动时间与关键路径识别
Total float (TF) is the amount of time an activity can be delayed without causing the overall project to be late. It is calculated as TF = LST – EST, which also equals LFT – EFT.
总浮动时间 (TF) 是指在不导致整个项目延误的前提下，一个活动可以被延迟的时间量。计算公式为 TF = LST – EST，它也等于 LFT – EFT。
Activities that have a total float of zero are called critical activities. They cannot be postponed at all without extending the project completion date. The sequence of critical activities forms the critical path, which is the longest path through the network in terms of duration.
总浮动时间为零的活动称为关键活动。它们完全不能被推迟，否则会延长项目完成日期。关键活动的序列构成了关键路径，它是网络中以持续时间计算的最长路径。
To identify the critical path, list all activities where LST = EST (or LFT = EFT) and trace them from start to finish. There may be more than one critical path; if so, the project is even more sensitive to delays.
要识别关键路径，列出所有满足 LST = EST（或 LFT = EFT）的活动，并从开始到结束追踪它们。可能存在多条关键路径；如果有，项目对延误更加敏感。
6. Interpreting the Critical Path and Float | 解读关键路径与浮动时间
The critical path tells project managers exactly which activities must be monitored most closely. A delay in any critical activity will directly delay the entire project, so resources should be allocated to ensure these tasks stay on schedule.
关键路径准确地告诉项目管理者必须最密切监控哪些活动。任何关键活动的延迟都会直接推迟整个项目，因此应分配资源以确保这些任务按计划进行。
Non-critical activities have positive total float, meaning they can be delayed to some extent without affecting the project finish date. This flexibility allows managers to level resources or handle minor disruptions.
非关键活动具有正的总浮动时间，意味着它们可以在一定程度上延迟而不影响项目完成日期。这种灵活性允许管理者平衡资源或处理小的干扰。
While total float is the key metric in most exams, free float (the delay possible without affecting the early start of any successor) may also appear in advanced questions.
尽管总浮动时间是大多数考试中的关键指标，但自由浮动时间（在不影响任何后续活动最早开始的前提下可能的延迟）也可能出现在高级题目中。
7. Dummy Activities: Purpose and Correct Usage | 虚活动：目的与正确使用
A dummy activity is a logical connector with a duration of zero. In activity-on-arrow networks, it is drawn as a dashed arrow; in activity-on-node diagrams, it may be a dotted arrow or a special node. Its only role is to enforce a dependency without consuming time.
虚活动是一个持续时间为零的逻辑连接器。在箭线式网络中，它画作虚线箭头；在节点式网络中，它可能是虚线箭头或特殊节点。它的唯一作用是强制依赖关系而不消耗时间。
Use dummy activities when two or more activities depend on a common predecessor but also have different additional predecessors. A dummy ensures that the common part is correctly represented, avoiding the mistake of suggesting that both activities can start together unconditionally.
当两个或多个活动依赖于一个共同前驱，但又有不同的额外前驱时，使用虚活动。虚活动确保共同部分被正确表示，避免错误地暗示两个活动可以无条件地同时开始。
A classic error is to insert dummies incorrectly, which either creates false dependencies or breaks the network logic. Always verify that the dummy does not accidentally impose an extra predecessor constraint or remove a necessary one.
一个典型错误是不正确地插入虚活动，这会导致错误的依赖关系或破坏网络逻辑。务必检查虚活动不会意外地施加额外的紧前约束或删除必要的约束。
8. Common Mistakes and How to Avoid Them | 常见错误与避免方法
One frequent mistake is forgetting to take the maximum EST from multiple predecessors during the forward pass. Instead, students may incorrectly take the minimum or an earlier EFT, leading to an underestimation of project duration.
一个常见错误是在前推法中忘记从多个前驱活动取最大 EST。相反，学生可能会错误地取最小值或较早的 EFT，导致低估项目工期。
During the backward pass, the opposite error occurs: choosing the maximum LST of successors instead of the minimum. This results in overly generous late times and an incorrect float calculation.
在后推法中会发生相反的错误：选择后续活动 LST 的最大值而不是最小值。这会导致过分宽松的最晚时间以及错误的浮动时间计算。
Another pitfall is mislabelling nodes or arrows, especially when transferring a precedence table onto a network. Double-check that each activity’s incoming arrows come exactly from the listed immediate predecessors.
另一个陷阱是错误标记节点或箭头，尤其是在将前导表转移到网络时。仔细检查每个活动的入箭头是否恰好来自所列出的直接前驱。
Finally, students sometimes neglect to confirm that the network has exactly one start and one end. Merging end points unnecessarily or leaving multiple starts can confuse the backward pass.
最后，学生有时会忽略确认网络是否有且仅有一个起点和一个终点。不必要地合并终点或留下多个起点会混淆后推法。
9. Step-by-Step Worked Example | 逐步解析的示例
Consider a small project with the following activities and dependencies:
考虑一个小型项目，其活动和依赖关系如下：
| Activity | Duration (days) | Immediate Predecessors |
|---|---|---|
| A | 3 | – |
| B | 4 | – |
| C | 2 | A |
| D | 5 | A, B |
| E | 1 | C, D |
Forward pass: Activity A has EST=0, EFT=3. Activity B has EST=0, EFT=4. Activity C depends only on A, so EST=3, EFT=3+2=5. Activity D depends on A and B, so EST=max(3,4)=4, EFT=4+5=9. Activity E depends on C and D, so EST=max(5,9)=9, EFT=9+1=10. Project duration = 10 days.
前推法：活动 A 的 EST=0，EFT=3。活动 B 的 EST=0，EFT=4。活动 C 仅依赖 A，因此 EST=3，EFT=3+2=5。活动 D 依赖 A 和 B，因此 EST=max(3,4)=4，EFT=4+5=9。活动 E 依赖 C 和 D，因此 EST=max(5,9)=9，EFT=9+1=10。项目工期 = 10 天。
Backward pass: Final activity E has LFT=10, LST=10-1=9. For D: LFT = minimum LST of its successor E = 9, LST=9-5=4. For C: LFT = 9, LST=9-2=7. For B: successor is D, so LFT=4, LST=4-4=0. For A: successors are C (LST=7) and D (LST=4); LFT=min(7,4)=4, LST=4-3=1.
后推法：最终活动 E 的 LFT=10，LST=10-1=9。对于 D：LFT = 后续活动 E 的 LST 最小值 = 9，LST=9-5=4。对于 C：LFT = 9，LST=9-2=7。对于 B：后续活动是 D，因此 LFT=4，LST=4-4=0。对于 A：后续活动是 C (LST=7) 和 D (LST=4)；LFT=min(7,4)=4，LST=4-3=1。
Total floats: A: 1-0=1. B: 0-0=0. C: 7-3=4. D: 4-4=0. E: 9-9=0. Critical path consists of activities with zero total float: B → D → E. The critical duration is 10 days.
总浮动时间：A: 1-0=1。B: 0-0=0。C: 7-3=4。D: 4-4=0。E: 9-9=0。关键路径由总浮动时间为零的活动组成：B → D → E。关键工期为 10 天。
10. Exam Tips and Typical Question Types | 考试技巧与常见题型
In both IB and Edexcel examinations, you can expect to see questions that provide a precedence table and ask you to draw the activity network, compute earliest and latest event times, and determine the critical path and project duration.
在 IB 和 Edexcel 考试中，你可以预期会看到提供前导表并要求你绘制活动网络、计算最早和最晚事件时间、确定关键路径和项目工期的题目。
Always present your working clearly, perhaps by annotating nodes with EST and LFT (or EST/EFT/LST/LFT) directly on the diagram. Marks are awarded for correct numerical values and for correctly stating the critical activities.
务必清晰地呈现你的计算过程，例如在图中直接标注节点的 EST 和 LFT（或 EST/EFT/LST/LFT）。正确的数值以及正确陈述关键活动都会得分。
When drawing the network, use a pencil and be neat. Ensure arrows flow from left to right as much as possible. If a question asks ‘state the critical path’, write it as a sequence of nodes or activities, e.g., Start – B – D – E – Finish.
在绘制网络时，使用铅笔并保持整洁。确保箭头尽可能从左向右流动。如果题目要求“陈述关键路径”，请将其写为节点或活动序列，例如 Start – B – D – E – Finish。
Practice with past papers to become fluent in both activity-on-node and activity-on-arrow representations if your syllabus requires both. Recognise that the underlying logic is identical, only the visual notation differs.
如果你的教学大纲要求两者，通过历年真题练习以熟练运用节点式和箭线式表述。要认识到底层逻辑是相同的，只是视觉符号不同。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply