📚 A-Level CIE Mathematics: Critical Path Analysis Exam Essentials | A-Level CIE 数学：关键路径分析考点精讲
Critical path analysis (CPA) is a decision mathematics tool that allows project managers to break a complex project into individual activities, understand their dependencies, and calculate the minimum time needed to complete the entire project. In CIE A-Level Mathematics, this topic appears in the Decision Mathematics module and is assessed through construction of activity networks, forward and backward passes, float calculations, and identifying the critical path. Mastering CPA not only secures algorithm marks but also develops logical thinking that is directly tested in the exam. This guide covers every essential technique, common pitfalls, and exam strategies to help you answer questions with speed and accuracy.
关键路径分析（CPA）是一套决策数学工具，项目经理用它把复杂项目拆解成独立活动，理解活动之间的依赖关系，并计算完成整个项目所需的最短时间。在 CIE A-Level 数学中，该内容属于决策数学模块，考查活动网络的构建、正向和反向遍历、时差计算以及关键路径的识别。掌握 CPA 不仅能稳拿算法分，还能培养逻辑思维，这一点在考试中会被直接检验。本文覆盖所有必考技巧、常见陷阱和应试策略，助你快速准确地答题。
1. The Purpose of Critical Path Analysis | 关键路径分析的目的
Critical path analysis is used to schedule a project efficiently by determining which sequence of activities dictates the overall duration. The 'critical' activities have zero float, meaning any delay in them will directly postpone the project finish date. Non-critical activities, on the other hand, have spare time that can be absorbed without affecting the overall timeline. Exam questions typically present a table of activities, their durations, and immediate predecessors; your task is to model the problem using a precedence network, calculate earliest and latest start times, and finally extract the critical path and project duration.
关键路径分析用于高效安排项目进度，找出哪一系列活动决定了整个项目的工期。“关键”活动的时差为零，意味着其中任何一个延迟都会直接推迟项目完成日期。非关键活动则拥有可缓冲的自由时间，不会影响总进度。考试题目通常会给出活动、工期及紧前活动表；考生需要建立前导网络模型，计算最早和最晚开始时间，最终得出关键路径和项目工期。
2. Activity Networks: Nodes and Arcs | 活动网络：节点与弧
In CIE Decision Mathematics, we use the activity-on-node (AON) representation. Each node represents an activity, and an arc (directed edge) shows a precedence relationship. Every node is drawn as a box divided into sections to record the activity identifier, duration, earliest start time (EST), earliest finish time (EFT), latest start time (LST), and latest finish time (LFT). CIE expects a specific layout: the top row contains the earliest times, the middle row carries the activity letter, and the bottom row holds the latest times. For example, a typical node looks like:
在 CIE 决策数学中，我们使用节点活动图（AON）表示法。每个节点代表一项活动，弧（有向边）表示前导关系。每个节点绘制成分为多格的方框，用于记录活动代号、工期、最早开始时间（EST）、最早完成时间（EFT）、最晚开始时间（LST）和最晚完成时间（LFT）。CIE 规定了特定布局：顶行存放最早时间，中间行写活动字母，底行存放最晚时间。典型节点如下所示：
| EST | EFT |
| Activity A | |
| LST | LFT |
Duration is written near the node or inside the upper-middle cell. Arcs are added from A to B if A must be completed before B starts.
工期写在节点旁边或上中格内。如果活动 A 必须在活动 B 开始前完成，则从 A 向 B 画一条弧。
3. Precedence Relations and Dependencies | 前导关系与依赖关系
An activity's immediate predecessors are those activities that must be finished before it can begin. CIE often provides this in a precedence table. It is essential to read the table carefully: 'depends on' means an arrow head points into the activity. If the table lists no predecessors for an activity, it is a start activity. If an activity does not appear in anyone else's predecessor list, it may be an end activity. Some problems include dummy activities – activities with zero duration that are used purely to maintain logical dependencies without altering timing. Dummies are represented by a dashed arrow and a node with zero duration.
一个活动的紧前活动是指那些必须在它开始之前完成的活动。CIE 常常用前导表给出。仔细读表很重要：“依赖于”意味着箭头指向该活动。如果表中某活动没有紧前活动，它就是开始活动。如果某个活动没有出现在其他任何活动的紧前列中，它可能是结束活动。有些问题会包含虚活动——工期为零的活动，纯粹为了维持逻辑依赖而不改变时间。虚活动用虚线箭头和零工期节点表示。
4. Constructing the Activity-on-Node (AON) Diagram | 构建节点活动图
Start by placing all activities without predecessors at the leftmost side. Then, draw arrows from each activity to its successors. The network must be neat and logically correct. CIE examiners penalise missing arcs, backward arcs, or unnecessary dummies. A top tip is to list activities in an order that satisfies all dependencies before drawing, then check each relationship twice. If two activities share the same predecessors, they can be drawn in parallel, but be careful not to create redundant dependencies. Remember that the entire network must flow from a single start node (often labelled 'Start' or left blank) to a single end node (often 'End').
首先把所有无紧前活动的节点放在最左侧，然后从每个活动画出指向后续活动的箭头。网络图必须整洁且逻辑正确。CIE 考官会扣掉遗漏弧、反向弧或不必要虚活动的分。一个实用技巧是：在绘制前按满足所有依赖关系的顺序列出活动，然后逐一复查每个关系。如果两个活动有相同的紧前活动，它们可以并行绘制，但要当心不要制造多余的依赖关系。记住，整个网络必须从单一开始节点（通常标为“Start”或留空）流向单一结束节点（通常标为“End”）。
5. Forward Pass: Earliest Start Times (EST) | 正向遍历：最早开始时间
For any other activity, EST is the maximum of the EFT values of all its immediate predecessors. The EFT is simply EST + duration. Work through the network systematically from left to right, putting values in the top half of each node. In formula terms:
EFT = EST + Duration
EST (for a node) = max{EFT of all predecessors}
正向遍历计算每个活动的最早可能开始时间。对于开始节点，EST = 0。对于其他活动，EST 是其所有紧前活动 EFT 的最大值。EFT 就是 EST 加上工期。从左到右系统处理整个网络，将数值填入各节点上半部。公式如下：
EFT = EST + 工期
EST（某节点）= max{所有紧前活动的 EFT}
The maximum EFT at the end node gives the minimum project completion time. Write this value down – it will be used in the backward pass.
结束节点处的最大 EFT 就是项目的最低完成时间。记下这个值——它将在反向遍历中使用。
6. Backward Pass: Latest Start Times (LST) | 反向遍历：最晚开始时间
The backward pass computes the latest time each activity can start without delaying the project. Start at the end node: set LFT equal to the project completion time found in the forward pass. Then compute LFT for earlier activities as the minimum of the LST values of all immediate successors. The LST is then LFT minus duration. Work backwards from right to left, filling the bottom half of each node. The rules are:
LST = LFT – Duration
LFT (for a node) = min{LST of all successors}
反向遍历计算每个活动在不推迟项目的前提下可以开始的最晚时间。从结束节点开始：令 LFT 等于正向遍历求出的项目完成时间。然后计算前面活动的 LFT，取所有紧后活动 LST 的最小值。再计算 LST = LFT - 工期。从右向左倒推，填入各节点的下半部。规则为：
LST = LFT – 工期
LFT（某节点）= min{所有紧后活动的 LST}
heir EST = EFT and LST = LFT, and they simply pass the time values through without change.
注意虚活动：将其视为工期为零的活动，因此 EST = EFT，LST = LFT，它们只是原封不动地传递时间值。
7. Float Times: Total, Free and Independent | 浮动时间：总时差、自由时差和独立时差
Float (or slack) is the amount of time an activity can be delayed without affecting the overall project or subsequent activities. There are three types you must know for CIE exams:
时差（或称松弛）是活动可以延迟的时间量，而不影响整个项目或后续活动。CIE 考试中必须掌握的三种类型为：
| Total Float 总时差 | LST – EST or LFT – EFT | Delay possible without affecting project end date |
| Free Float 自由时差 | EST(next) – EFT (for immediate successors) | Delay possible without affecting any successor’s early start |
| Independent Float 独立时差 | EST(next) – LFT(prev) – Duration | Delay when all predecessors finish as late as possible and all successors start as early as possible |
total float; independent float ≤ free float. You may be asked to interpret these in a scheduling context.
总时差最易计算，并直接识别关键活动：若总时差 = 0，该活动就是关键活动。自由时差 ≤ 总时差；独立时差 ≤ 自由时差。考试可能要求你在调度语境下解释这些时差。
8. Identifying the Critical Path | 确定关键路径
The critical path is the continuous chain of activities from start to end that have zero total float. It determines the minimum project duration. Write this path as a sequence such as A – C – F – H. Be aware that there may be more than one critical path if multiple routes share the same total duration; in that case, list both. CIE often asks to 'state the critical path and its length'. Make sure you give the length (total duration) as a number with appropriate units (e.g., days, hours). A common error is forgetting to include the start node or misreading an activity’s duration – double‑check by adding up durations along the path and comparing with the project EFT.
关键路径是从开始到结束、总时差为零的活动组成的连续链条。它决定了项目的最短工期。写出如 A – C – F – H 的序列。注意，可能有多条关键路径，如果多条路线总工期相同，那么全部列出。CIE 常要求“写出关键路径及其长度”。一定要用带单位的数字（如天数、小时）给出长度。常见错误包括漏掉开始节点或误读活动工期——请沿路径累加工期并与项目 EFT 核对。
9. Scheduling and Gantt Charts | 调度与甘特图
A Gantt chart (also called a cascade chart) is a horizontal bar chart that represents each activity plotted against time, using the EST as the earliest possible start. For scheduled activities, the bars should not overlap in a way that violates precedence or resource constraints. Exam tasks often include plotting activities on a grid, shading to show float, and showing the critical path clearly. Usually each activity is drawn twice: once scheduled at its earliest start time, and then with a dashed extension indicating its float. The critical activities have no such extension.
甘特图（也称级联图）是水平条形图，根据时间绘制每个活动，用 EST 作为最早可能开始时间。对于已调度的活动，条形不应以违反前导关系或资源约束的方式重叠。考试任务常包括在网格纸上绘制活动、用阴影表示时差，并清晰显示关键路径。通常每项活动绘制两次：第一次按其最早开始时间调度，另一次用虚线延长表示其时差。关键活动则没有这种延伸。
When constructing a Gantt chart from a resource histogram, aim to schedule non-critical activities as late as possible to delay resource demand, or use float to smooth resource usage. The logic is directly linked to float calculations.
从资源直方图构建甘特图时，尽量把非关键活动安排得尽可能晚，以延迟资源需求，或利用时差平滑资源使用。其逻辑直接与时差计算关联。
10. Resource Levelling and Smoothing | 资源平衡与平滑
Resource histograms plot the number of workers or machines required each day if all activities start at their earliest times. The histogram often shows peaks and troughs. Resource levelling aims to minimise the maximum resource requirement, possibly extending the project duration. Resource smoothing moves activities within their float to reduce peaks without delaying the project. CIE questions may ask you to redraw the histogram after delaying a specific activity or to explain the effect. The technique involves systematically shifting non-critical activities to flatten the resource profile.
资源直方图描绘了如果所有活动都按最早时间开始时，每天所需的工人或机器数。直方图常出现波峰与波谷。资源平衡旨在最小化最大资源需求，可能延长项目工期。资源平滑则是在不推迟项目的前提下，将活动在时差范围内移动以减少波峰。CIE 题目可能会要求推迟某项特定活动后重绘直方图，或解释其影响。技术要点是系统地将非关键活动平移以拉平资源分布。
11. Exam-style Examples and Common Pitfalls | 考试风格示例与常见误区
ives EST(A)=0, EFT(A)=3; EST(B)=3, EFT(B)=8; EST(C)=3, EFT(C)=5; EST(D)=max(8,5)=8, EFT(D)=14. The project duration is 14 days. Backward pass: LFT(D)=14, LST(D)=8; LFT(B)=min(LST(D))=8, LST(B)=3; LFT(C)=8, LST(C)=6; LFT(A)=min(LST(B), LST(C))=3, LST(A)=0. Total floats: A:0, B:0, C:3, D:0. Critical path is A – B – D. Free float for C = EST(D) – EFT(C) = 8 – 5 = 3. Independent float for C = EST(D) – LFT(A) – Duration(C) = 8 – 3 – um LST. Always draw the network neatly; messy diagrams lead to misreading of dependencies.
来看一个简单项目：活动 A（3 天）、B（5 天，依赖于 A）、C（2 天，依赖于 A）、D（6 天，依赖于 B 和 C）。正向遍历得 EST(A)=0, EFT(A)=3；EST(B)=3, EFT(B)=8；EST(C)=3, EFT(C)=5；EST(D)=max(8,5)=8, EFT(D)=14。项目工期 14 天。反向遍历：LFT(D)=14, LST(D)=8；LFT(B)=min(LST(D))=8, LST(B)=3；LFT(C)=8, LST(C)=6；LFT(A)=min(LST(B), LST(C))=3, LST(A)=0。总时差：A:0, B:0, C:3, D:0。关键路径为 A – B – D。活动 C 的自由时差 = EST(D) – EFT(C) = 8 – 5 = 3。独立时差 = EST(D) – LFT(A) – 工期(C) = 8 – 3 – 2 = 3。很多学生因忘记反向遍历取最小 LST 而算错。务必保持网络图整洁；混乱的图易导致依赖关系误读。
12. Summary and Key Takeaways | 总结与关键要点
Critical path analysis is a highly algorithmic topic that rewards systematic working. Always draw a clear activity-on-node network, perform forward and backward passes stepwise, calculate floats methodically, and then state the critical path explicitly. Remember the critical path has zero total float; float values must be checked with both EST/LST and EFT/LFT methods to ensure consistency. Practise with resource histograms and Gantt charts, as they appear regularly. Armed with these techniques, you can confidently pick up full marks on this section of the CIE Decision Mathematics paper.
关键路径分析是高度算法化的主题，系统解答必有回报。始终绘制清晰的节点活动网络图，逐步执行正向和反向遍历，有条理地计算时差，然后明确写出关键路径。记住关键路径的总时差为零；时差值需用 EST/LST 和 EFT/LFT 两种方式交叉校验以确保一致性。经常练习资源直方图和甘特图，因为它们是常考题型。掌握这些技巧，你就能充满信心地在 CIE 决策数学试卷的这一部分夺取满分。
Published by TutorHao | Decision Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图