📚 Critical Path Analysis in A-Level Mathematics | A-Level 数学：关键路径分析 考点精讲
Critical Path Analysis (CPA) is a powerful project management tool used to schedule complex sequences of activities. By identifying the longest chain of dependent tasks, it helps managers allocate resources, minimise delays, and ensure timely project completion. In A-Level Mathematics, CPA appears as a decision-making topic where you learn to construct activity networks, calculate early and late event times, determine floats, and interpret Gantt charts.
关键路径分析是一种强大的项目管理工具，用于排定复杂活动的顺序。通过找出最长的依赖任务链，它帮助管理者分配资源、减少延误并确保项目按时完成。在 A-Level 数学中，关键路径分析作为一个决策数学专题出现，你将学习构建活动网络、计算最早和最晚事件时间、确定时差以及解读甘特图。
1. Introduction to Critical Path Analysis | 关键路径分析简介
Critical Path Analysis breaks down a project into individual activities and examines the dependencies between them. Each activity has a duration, and some activities cannot start until certain predecessors are complete. The 'critical path' is the sequence of activities that determines the overall project duration; any delay on this path will delay the whole project.
关键路径分析将项目分解为单个活动并检查它们之间的依赖关系。每个活动都有一个持续时间，某些活动必须在其前置活动完成后才能开始。“关键路径”是决定整个项目工期的一系列活动；这条路径上的任何延误都将推迟整个项目。
The technique was developed in the 1950s for large-scale engineering and construction projects, but it is now a standard part of A-Level Decision Mathematics. Students need to master both algorithmic procedures (forward pass, backward pass) and interpretative skills (reading Gantt charts, resource levelling).
该技术于 20 世纪 50 年代为大型工程和建筑项目开发，如今已是 A-Level 决策数学的标准内容。学生既要掌握算法流程（向前传递、向后传递），也要具备解读技能（阅读甘特图、资源平衡）。
2. Activity Networks and Dependencies | 活动网络与依赖关系
An activity network is a directed graph where nodes represent activities and arrows indicate dependencies. The most common representation at A-Level is 'activity-on-node', where each node is a rectangle containing the activity name or label, its duration, and later the calculated times (EST, LFT, etc.). Edges show precedence constraints.
活动网络是一个有向图，节点表示活动，箭头表示依赖关系。A-Level 中最常用的表示方法是“节点表示活动”，每个节点是一个矩形，内含活动名称或标记、持续时间以及随后计算的时间（最早开始时间、最晚完成时间等）。边表示前置约束。
For example, if activity B depends on activity A, an arrow goes from A to B. Dependencies are typically given in a precedence table:
例如，如果活动 B 依赖于活动 A，则一条从 A 到 B 的箭头。依赖关系通常用前导表给出：
| Activity | Duration (days) | Preceding activities |
|---|---|---|
| A | 3 | - |
| B | 4 | A |
| C | 2 | A |
| D | 5 | B, C |
表格含义：活动 A 持续 3 天，无前置；B 需 A 完成后开始，持续 4 天；C 也需 A，持续 2 天；D 需要 B 和 C 都完成，持续 5 天。
3. Constructing an Activity-on-Node Diagram | 构建节点活动图
Start by drawing a begin node (often labelled 'Start' or 'Source') and an end node ('Finish' or 'Sink') if needed. Arrange activities so that no arrow crosses another unnecessarily and all dependencies are honoured. Sometimes dummy arcs are required in activity-on-arrow diagrams, but with activity-on-node they are rarely needed; however, you may add a dummy start or finish node to tie multiple beginnings or endings together.
首先绘制一个开始节点（通常标记为“开始”或“源”）和一个结束节点（“结束”或“汇”）。合理安排活动，使箭线尽量不交叉，并尊重所有依赖关系。在箭线表示活动图中有时需要虚工作，但节点活动图很少需要；不过，你可能需要添加虚拟的开始或结束节点来连接多个起点或终点。
A carefully drawn network lays the foundation for accurate time calculations. Use the precedence table to check that every dependency has a corresponding arrow and that there are no missing links.
精心绘制的网络是准确计算时间的基础。使用前导表检查每个依赖关系都有对应的箭头，且没有遗漏的连接。
4. Forward Pass: Earliest Start and Finish Times | 向前传递：最早开始与完成时间
ty, EST is the maximum of the EFTs of all its immediate predecessors. EFT = EST + duration.
向前传递计算每个活动最早可以开始的时间（EST）和最早可以完成的时间（EFT）。第一个活动的 EST 为 0。对于任何后续活动，EST 等于其所有直接前置活动中最大的 EFT。EFT = EST + 持续时间。
Mathematically, for activity j with set of predecessors P(j):
数学上，对于有前置集合 P(j) 的活动 j：
EST(j) = max { EFT(i) | i ∈ P(j) }
EFT(j) = EST(j) + duration(j)
(D) = max(7,5) = 7. EFT(D) = 7+5 = 12. The project’s minimum completion time is the maximum EFT among all activities: 12 days.
以我们的表格为例：A 的 EST=0，EFT=3。B 和 C 都依赖于 A，所以它们的 EST = EFT(A) = 3。B 的 EFT = 3+4=7；C 的 EFT = 3+2=5。D 依赖于 B 和 C，所以 EST(D) = max(7,5) = 7。EFT(D) = 7+5=12。项目的最短完成时间是所有活动中最大的 EFT：12 天。
5. Backward Pass: Latest Start and Finish Times | 向后传递：最晚开始与完成时间
ng the entire project. The LFT of the final activity equals its EFT. For any activity, LFT is the minimum of the LSTs of all its immediate successors. LST = LFT - duration.
向后传递从结束节点开始，反向计算每个活动在不延误整个项目的前提下最晚可以开始的时间（LST）和最晚可以完成的时间（LFT）。最终活动的 LFT 等于其 EFT。对于任何活动，LFT 等于其所有直接后继活动中最小的 LST。LST = LFT - 持续时间。
For activity i with set of successors S(i):
对于有后继集合 S(i) 的活动 i：
LFT(i) = min { LST(j) | j ∈ S(i) }
LST(i) = LFT(i) - duration(i)
LST=7-4=3; for C, LST=7-2=5. For A, LFT = min(LST(B), LST(C)) = min(3,5)=3. LST(A)=3-3=0.
继续示例：D 是最后的，LFT(D)=EFT(D)=12，LST(D)=12-5=7。对于 B 和 C，LFT = LST(D) = 7。B 的 LST = 7-4=3；C 的 LST = 7-2=5。对于 A，LFT = min(3,5)=3。LST(A)=3-3=0。
6. Total Float and Identifying the Critical Path | 总时差与关键路径识别
Total float is the amount of time an activity can be delayed without affecting the overall project completion time. It is calculated as:
总时差是指在不影响整个项目完成时间的情况下，一个活动可以延迟的时间量。计算公式为：
Total Float = LST - EST or LFT - EFT
-3=0; D 7-7=0). Activity C has Float = LST(C)-EST(C)=5-3=2 days. Thus the critical path is A → B → D.
总时差为零的活动是关键活动，它们位于关键路径上。在我们的例子中，A、B 和 D 的时差均为 0（检查：A LST-EST=0-0=0；B 3-3=0；D 7-7=0）。活动 C 的时差 = 5-3=2 天。因此关键路径为 A → B → D。
Sometimes there can be more than one critical path. If two parallel paths both have zero total float, any delay on either path will delay the project. A-Level exam questions often ask you to list all critical activities and state the critical path(s).
有时可能有不止一条关键路径。如果两条并行路径的总时差都为零，则任何一条路径上的延误都会推迟项目。A-Level 考题常要求列出所有关键活动并说明关键路径。
7. Interpreting the Critical Path and Its Importance | 关键路径的解读及其重要性
The critical path shows where management attention must focus. Non-critical activities have slack (float), meaning resources can potentially be shifted from them to critical tasks if needed. However, if a non-critical activity uses up all its float, it becomes critical, potentially creating a new critical path.
关键路径表明管理者必须关注的重点。非关键活动有时差（浮动时间），意味着如果需要，资源可以从它们转移到关键任务上。然而，如果一个非关键活动用尽了所有时差，它就会变为关键活动，可能产生新的关键路径。
Exam tip: when a scenario asks about the effect of an activity overrunning, first check whether that activity is on the critical path. If yes, the whole project is delayed by the overrun amount. If no, calculate the new float after the delay to see if the project is still on schedule.
考试技巧：当题目问某个活动超期的影响时，首先检查该活动是否在关键路径上。如果在，整个项目将延迟超出的时长。如果不在，计算延迟后的新时差，看项目是否仍按计划进行。
8. Gantt Charts (Cascade Charts) | 甘特图（级联图）
A Gantt chart is a horizontal bar chart that visualises the schedule of activities. Each activity is drawn as a bar whose length corresponds to its duration, placed on a time axis starting at its EST. Critical activities are often shaded differently. Float can be shown as a dotted extension.
甘特图是一个水平条形图，用于可视化活动的时间安排。每个活动画作一个长条，其长度对应持续时间，放在时间轴上从它的 EST 开始。关键活动通常用不同颜色或阴影标识。时差可用虚线延长部分表示。
Drawing a Gantt chart from the activity network helps with resource analysis. For example, if two activities require the same specialist team and overlap, you might need to delay one (resource levelling). A-Level questions often provide a partly completed Gantt chart and ask you to fill in missing bars or identify float.
从活动网络绘制甘特图有助于资源分析。例如，如果两个活动需要同一支专业团队且时间重叠，你可能需要延迟其中一个（资源平衡）。A-Level 试题常给出部分完成的甘特图，要求补全条形或识别时差。
9. Resource Levelling and Smoothing | 资源平衡与平滑
Resource levelling aims to resolve over-allocation of resources by delaying non-critical activities within their float. The goal is to keep resource usage as constant as possible without extending the project duration. If levelling is impossible without delay, the project end date will slip.
资源平衡旨在通过在其时差范围内延迟非关键活动来解决资源过度分配问题。目标是使资源使用尽可能平稳，且不延长项目工期。如果无法在不延误的情况下平衡资源，项目完成日期将会推迟。
Resource smoothing is a similar concept but operates within the existing time constraints. It adjusts the start times of activities slightly to reduce peaks and troughs in resource demand. A-Level questions may present a resource histogram and ask you to reschedule activities to achieve a smoother profile.
资源平滑的概念类似，但在现有时间约束内操作。它略微调整活动的开始时间以减少资源需求的峰谷波动。A-Level 题目可能给出资源直方图，要求你重新安排活动以得到更平滑的分布。
10. Common Pitfalls and Exam Tips | 常见易错点与考试技巧
1. Confusing EST/LST: EST comes from the forward pass taking the maximum; LST from the backward pass taking the minimum. A common error is mixing up the direction of extremum.
1. 混淆 EST/LST：EST 来自向前传递取最大值；LST 来自向后传递取最小值。常见错误是搞错极值的方向。
2. Forgetting to include all predecessors: when multiple arrows enter a node, EST relies on the longest predecessor path. Missing one can lead to an incorrectly short project time.
2. 忘记包含所有前置活动：当多条箭头进入一个节点时，EST 取决于最长的那条前置路径。遗漏一条可能导致项目时间计算过短。
LST - EST. Some candidates mistakenly use LFT - EST. Remember that LFT - EFT gives the same value, but be consistent.
3. 时差计算：总时差 = LST - EST。有些考生错误地使用 LFT - EST。记住 LFT - EFT 得到相同的值，但要保持一致。
s implied). Including it as a direct arrow is unnecessary and may complicate the network, but it is not usually penalised. However, ignoring indirect dependencies that are necessary is a bigger issue.
4. 冗余依赖：有时前导表包含一个已经间接隐含的依赖关系（例如，如果 A → B 且 B → C，则 A → C 已隐含）。将其画为直接箭头是多余的，可能会使网络复杂化，但通常不扣分。然而，忽略必要的间接依赖是更严重的问题。
5. Dummy activities in activity-on-node: you may use a 'Start' node with zero duration to collect all initial activities. Its EST=0, EFT=0, and it simplifies the forward pass. Similarly for a 'Finish' node.
5. 节点活动图中的虚拟活动：你可以使用一个持续时间为零的“开始”节点来汇集所有初始活动。其 EST=0，EFT=0，能简化向前传递。同样用“结束”节点。
11. Worked Example | 典型例题解析
Consider a project with following activities:
考虑以下活动的项目：
| Activity | Duration | Predecessors |
|---|---|---|
| P | 5 | - |
| Q | 3 | P |
| R | 6 | - |
| S | 2 | Q, R |
| T | 3 | R |
EFT(S)=10. T depends on R: EST(T)=6, EFT(T)=9. Project completion time = max(5,8,10,9)=10.
向前传递：EST(P)=0, EFT(P)=5。EST(R)=0, EFT(R)=6。Q 依赖 P：EST(Q)=5, EFT(Q)=8。S 依赖 Q 和 R：EST(S)=max(8,6)=8, EFT(S)=10。T 依赖 R：EST(T)=6, EFT(T)=9。项目完成时间 = max(5,8,10,9)=10。
ssor, assume finish constraint), LST(T)=7. LFT(R)=min(LST(S),LST(T))=min(8,7)=7, LST(R)=1.
向后传递：LFT(S)=10, LST(S)=8。LFT(Q)=8（后继为S），LST(Q)=5。LFT(P)=LST(Q)=5，LST(P)=0。LFT(T)=10（无后继，按结束约束），LST(T)=7。LFT(R)=min(8,7)=7，LST(R)=1。
8=0; T: 7-6=1. Critical path: P → Q → S (float 0). Note that R has float 1, T has float 1.
时差：P: 0-0=0；Q: 5-5=0；R: 1-0=1；S: 8-8=0；T: 7-6=1。关键路径：P → Q → S（时差 0）。注意 R 时差为 1，T 时差为 1。
12. Summary | 总结
Critical Path Analysis is a systematic method for project scheduling. Mastery involves accurately drawing the network from a precedence table, correctly executing forward and backward passes, computing total float, and identifying the critical path. Extensions to Gantt charts and resource levelling build on these foundations. Practice with varied examples, paying attention to dependencies that join or split the network, will give you confidence for exam questions.
关键路径分析是项目排程的系统方法。掌握它需要能根据前导表准确绘制网络图、正确执行向前和向后传递、计算总时差并识别关键路径。扩展到甘特图和资源平衡都建立在这些基础之上。通过多样化的例子练习，尤其是注意网络中的汇合与分支依赖关系，将使你在考试中充满信心。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图