📚 Critical Path Analysis Essentials for IB AQA Mathematics | IB AQA 数学：关键路径分析 考点精讲
Critical path analysis (CPA) is a powerful project management tool that helps schedule and coordinate the activities involved in a complex task. Within the IB AQA Mathematics specification, this topic draws on the construction of activity networks, the identification of earliest and latest start times, and the determination of the critical path itself. Mastering CPA not only prepares you for exam questions but also builds logical thinking highly valued in fields such as engineering, logistics, and software development.
关键路径分析（CPA）是一种强大的项目管理工具，用于安排和协调复杂任务中的各项活动。在 IB AQA 数学考纲中，该主题涉及活动网络的构建、最早和最晚开始时间的识别，以及关键路径的确定。掌握 CPA 不仅能帮助你应对考试题目，还能培养在工程、物流和软件开发等领域备受推崇的逻辑思维能力。
1. The Big Picture of Critical Path Analysis | 关键路径分析的整体图景
Critical path analysis models a project as a collection of activities, each with a known duration and a set of dependencies. The goal is to find the longest path through the network, which dictates the minimum time needed to complete the entire project. Activities on this path have no slack or float; any delay to them directly delays the project finish date. Understanding this core idea is the first step towards solving any CPA problem.
关键路径分析将一个项目建模为一系列活动的集合，每个活动都有已知的持续时间和一组依赖关系。目标是找出贯穿网络的最长路径，这条路径决定了完成整个项目所需的最短时间。位于这条路径上的活动没有松弛时间或浮动时间；它们的任何延误都会直接推迟项目的完成日期。理解这一核心思想是解决任何 CPA 问题的第一步。
In IB AQA exam papers, candidates are typically asked to draw an activity-on-node diagram from a precedence table, perform forward and backward passes, calculate float, and state the critical path. Occasionally, you may need to interpret changes, such as the effect of delaying a non-critical activity by a given amount. The notation used must be precise: early event time, late event time, and total float are central.
在 IB AQA 考试中，考生通常需要根据前导表绘制节点活动图，进行正向和反向遍历，计算浮动时间，并写出关键路径。偶尔还需要解读变化，例如将某个非关键活动延迟一定时间所产生的影响。所使用的符号必须准确：最早事件时间、最晚事件时间和总浮动时间是核心。
2. Activity Networks and Precedence Tables | 活动网络与前导表
An activity network is a weighted directed graph where nodes (or arcs, depending on the convention) represent activities. In the IB AQA syllabus, the activity-on-node convention is standard: each node is drawn as a box divided into cells that record the activity name, duration, earliest start time, and latest start time. Dependencies are shown by directed arrows. A precedence table lists each activity, its duration, and its immediate predecessors.
活动网络是一个带权有向图，其中节点（或弧，取决于约定）表示活动。在 IB AQA 教学大纲中，节点活动图是标准惯例：每个节点画成一个矩形框，分为几个格子，分别记录活动名称、持续时间、最早开始时间和最晚开始时间。依赖关系用有向箭头表示。前导表列出了每个活动及其持续时间，以及它的直接前驱活动。
For example, consider the following precedence table:
例如，考虑以下前导表：
| Activity | Duration (days) | Immediate Predecessors |
|---|---|---|
| A | 3 | – |
| B | 4 | A |
| C | 2 | A |
| D | 5 | B, C |
The first step in solving is to translate this table into a clear network diagram. Always start by identifying activities with no predecessors (like A) and place them at the beginning. Then add activities that depend only on A (B and C). Finally, D depends on both B and C, so it must have two incoming arrows.
解题的第一步是将该表格转化为清晰的网络图。始终先找出没有前驱的活动（如 A），并将其放在网络的开头。然后添加只依赖于 A 的活动（B 和 C）。最后，D 依赖 B 和 C 两者，因此必须有两条入箭头。
3. The Forward Pass: Earliest Start Times | 正向遍历：最早开始时间
The forward pass calculates the earliest time each activity can start, assuming the project begins at time 0. In activity-on-node diagrams, this value is often written in the top-left or top-right cell of the node. The rule is simple: for an activity to start, all its immediate predecessors must be finished. Therefore, its earliest start time (EST) equals the maximum of the earliest finish times (EFT) of its predecessors.
正向遍历计算每个活动可以开始的最早时间，假设项目从时间 0 开始。在节点活动图中，这个值通常写在节点的左上角或右上角格子中。规则很简单：一个活动要开始，其所有直接前驱都必须完成。因此，它的最早开始时间（EST）等于其所有前驱的最早完成时间（EFT）中的最大值。
Earliest finish time (EFT) = Earliest start time (EST) + duration. Using the table above, EST for A is 0, so EFT(A) = 0 + 3 = 3. For B, EST(B) = EFT(A) = 3, EFT(B) = 3 + 4 = 7. For C, EST(C) = 3, EFT(C) = 3 + 2 = 5. For D, EST(D) = max(EFT(B), EFT(C)) = max(7, 5) = 7. EFT(D) = 7 + 5 = 12. The minimum project duration is therefore 12 days.
最早完成时间（EFT）= 最早开始时间（EST）+ 持续时间。使用上表，A 的 EST 为 0，因此 EFT(A) = 0 + 3 = 3。对于 B，EST(B) = EFT(A) = 3，EFT(B) = 3 + 4 = 7。对于 C，EST(C) = 3，EFT(C) = 3 + 2 = 5。对于 D，EST(D) = max(EFT(B), EFT(C)) = max(7, 5) = 7。EFT(D) = 7 + 5 = 12。因此最短项目周期为 12 天。
In exam answers, show the calculation step by step. Clearly label each node with EST and EFT as you work from left to right across the network. This logical progression earns method marks even if arithmetic errors occur later.
在考试作答时，要逐步展示计算过程。在从左到右遍历网络的过程中，要清楚地给每个节点标上 EST 和 EFT。哪怕后面出现算术错误，这种逻辑递进也能赢得方法分。
4. The Backward Pass: Latest Start Times | 反向遍历：最晚开始时间
The backward pass determines the latest time each activity can start without delaying the whole project. We begin at the final activity and set its latest finish time (LFT) equal to the project duration (12 days in our example). Then we work right to left. The latest start time (LST) = latest finish time (LFT) – duration. For an activity, its LFT is the minimum of the LSTs of all its immediate successors.
反向遍历确定每个活动在不延误整个项目的前提下可以开始的最晚时间。我们从最终活动开始，将其最晚完成时间（LFT）设为项目周期（本例中为 12 天）。然后从右向左工作。最晚开始时间（LST）= 最晚完成时间（LFT）– 持续时间。对于某个活动，其 LFT 等于其所有直接后继活动的 LST 的最小值。
In the example, D has LFT = 12, so LST(D) = 12 – 5 = 7. For C, its only successor is D, so LFT(C) = LST(D) = 7, LST(C) = 7 – 2 = 5. For B, LFT(B) = 7, LST(B) = 7 – 4 = 3. For A, successors B and C have LST = 3 and 5; LFT(A) = min(3,5) = 3, so LST(A) = 3 – 3 = 0.
在例子中，D 的 LFT = 12，所以 LST(D) = 12 – 5 = 7。对于 C，它唯一的后继是 D，因此 LFT(C) = LST(D) = 7，LST(C) = 7 – 2 = 5。对于 B，LFT(B) = 7，LST(B) = 7 – 4 = 3。对于 A，其后继 B 和 C 的 LST 分别为 3 和 5；LFT(A) = min(3,5) = 3，因此 LST(A) = 3 – 3 = 0。
It is good practice to write both EST and LST inside the node box. A common IB AQA node layout is: top left for EST, top right for LST, bottom left for duration, bottom right for total float.
一种良好的习惯是将 EST 和 LST 都写在节点框内。常见的 IB AQA 节点布局是：左上角写 EST，右上角写 LST，左下角写持续时间，右下角写总浮动时间。
5. Total Float and Interpreting Slack | 总浮动时间及其解读
Total float (or total slack) is the amount of time an activity can be delayed without affecting the overall project duration. It is calculated as:
总浮动时间（或总时差）是指某个活动可以延误而不影响整体项目周期的时间量。其计算公式为：
Total float = LST – EST = LFT – EFT
If total float equals zero, the activity is critical; any delay to it will extend the project. A positive float indicates the activity can be delayed by that amount without harming the finish date. In our example, A, B, and D have float 0; C has float = 5 – 3 = 2 days, meaning C could start up to 2 days late without delaying D.
如果总浮动时间为零，则该活动是关键活动；任何延误都会延长项目。浮动时间为正表示该活动可以延误相应时间而不影响项目完成日期。在我们的例子中，A、B 和 D 的浮动时间为 0；C 的浮动时间为 5 – 3 = 2 天，这意味着 C 可以最多延误 2 天开始，而不会推迟 D。
Be careful: total float is not the same as free float. Free float is the delay possible without affecting the early start of any successor. IB AQA primarily tests total float, but free float may appear in extension problems. Free float = EST(successor) – EFT(current activity).
注意：总浮动时间与自由浮动时间不同。自由浮动时间是指在不影响任何后继活动最早开始时间的前提下可以延误的时间。IB AQA 主要考查总浮动时间，但自由浮动时间也可能出现在拓展题中。自由浮动时间 = 后继活动的 EST – 当前活动的 EFT。
6. Identifying the Critical Path | 识别关键路径
The critical path is the sequence of activities with zero total float connecting the start to the end of the project. It represents the longest path through the network. In our four-activity example, the critical path is A → B → D. Notice that C is not on it because its float is 2. The sum of durations on the critical path is 3 + 4 + 5 = 12, which matches the project duration.
关键路径是由总浮动时间为零的活动组成的序列，连接项目的开始和结束。它代表了网络中最长的一条路径。在我们的四活动例子中，关键路径为 A → B → D。注意 C 不在其列，因为它的浮动时间为 2。关键路径上活动的持续时间之和为 3 + 4 + 5 = 12，与项目周期一致。
In larger networks, there may be more than one critical path. If two or more paths tie for the maximum length, all are critical and must be stated. Common exam mistakes include listing activities that are not on the same continuous chain or forgetting to verify zero float for every activity in the claimed path.
在更复杂的网络中，可能存在多条关键路径。如果有两条或更多路径并列最长，则它们都是关键路径，必须全部列出。常见的考试错误包括：列出了不在同一条连续链上的活动，或者忘记验证所声称路径中每个活动的浮动时间均为零。
7. Dummy Activities and Dependency Representation | 虚拟活动与依赖关系表示
Sometimes precedence tables contain activities that share dependencies but not all of them, making it impossible to draw the network without ambiguity. In activity-on-node networks, this rarely arises because nodes represent activities and arrows represent dependencies directly. However, when activities must be uniquely represented and you need to show that two activities depend on a subset of the same predecessors, introducing a dummy activity (usually of zero duration, shown as a dashed arrow or box) can resolve logical conflicts. In IB AQA, dummy activities are much more common in activity-on-arc diagrams, but candidates should understand the concept of logical dependencies.
有时前导表中的活动共享部分依赖关系，但并非全部相同，如果不使用特殊手段就无法清晰地画出网络。在节点活动图中，这种情况较少出现，因为节点直接代表活动，箭头代表依赖。然而，当需要唯一表示活动，并表明两个活动依赖于同一组前驱中的一部分时，引入一个虚拟活动（通常持续时间为零，用虚线箭头或方框表示）可以解决逻辑冲突。在 IB AQA 中，虚拟活动在弧活动图中更为常见，但考生仍需理解逻辑依赖的概念。
For example, if activity X depends on A and B, while activity Y depends only on B, you might need a dummy node to avoid implying Y depends on A. The key principle is to keep dependencies explicit and correct.
例如，如果活动 X 依赖于 A 和 B，而活动 Y 仅依赖于 B，则可能需要一个虚拟节点，以避免暗示 Y 也依赖于 A。关键原则是让依赖关系保持明确和正确。
8. Interpreting and Adjusting Timings | 解读与调整时间安排
Once you have completed the forward and backward passes, the network provides a rich source of scheduling information. The minimum project duration is the EST of the finish node. The critical activities are those which must start exactly on time. Non-critical activities can be scheduled flexibly within their float. This allows resource smoothing: if labour or equipment is limited, you can delay some activities to redistribute workloads without extending the project.
一旦完成正向和反向遍历，网络就提供了丰富的排程信息。项目的最短周期即是终点节点的 EST。关键活动是那些必须准时开始的活动。非关键活动可以在其浮动时间范围内灵活安排。这有助于资源平滑：如果劳动力或设备有限，可以延迟某些活动以重新分配工作量，而不影响项目周期。
Exam questions sometimes ask: ‘Activity C is delayed by 3 days. What effect does this have on the project?’ Since C has a total float of 2, a 3-day delay uses up all the float and extends the project by 1 day. The new project duration becomes 13 days. In such cases, reassess the critical path; C may now become critical.
考试题目有时会问：“活动 C 延误了 3 天。这对项目有何影响？”由于 C 的总浮动时间为 2，延误 3 天将用尽所有浮动时间，并使项目周期延长 1 天。新的项目周期变为 13 天。在这种情况下，需要重新评估关键路径；C 现在可能成为关键活动。
9. Cascade Charts (Gantt Charts) for Scheduling | 甘特图用于排程
A cascade chart, often called a Gantt chart, is a visual representation of the project schedule where activities are plotted against time. The horizontal axis shows time, and each activity is drawn as a bar. The bar’s start corresponds to the activity’s earliest start time, and its length equals its duration. The float can be shown as a dashed extension beyond the bar. This diagram is extremely useful for communicating the schedule to stakeholders.
阶梯图，常称为甘特图，是项目进度的可视化表示，活动按时间绘制。横轴表示时间，每个活动画成一条横条。横条的起点对应活动的最早开始时间，长度等于其持续时间。浮动时间可以用横条之外的虚线延伸来表示。该图表对于向利益相关者传达进度非常有用。
To draw a cascade chart from your network, list activities on the vertical axis in an order that respects dependencies. For each activity, draw a solid bar from EST to EFT. Then, from EFT to LST+Duration, mark the float with a dotted line. Critical activities will show no dotted extension.
要根据网络绘制阶梯图，首先在纵轴上按尊重依赖关系的顺序列出活动。对于每个活动，从 EST 到 EFT 画一条实线横条。然后，从 EFT 到 LST+Duration，用虚线标出浮动时间。关键活动将不显示虚线延伸。
In IB AQA, you may be asked to draw a cascade chart from a given network or to interpret one. The ability to switch between network and cascade views demonstrates a thorough understanding of project scheduling.
在 IB AQA 中，可能会要求你根据给定网络绘制阶梯图，或解读一个阶梯图。能够在网络图和阶梯图之间转换，体现了对项目排程的透彻理解。
10. Common Pitfalls and Exam Tips | 常见陷阱与应试技巧
One common mistake is confusing the forward and backward pass rules. Remember: forward pass takes the maximum; backward pass takes the minimum. Another error is misaligning dependencies, especially when multiple arrows converge on a node. Always double-check that every predecessor listed in the table has an arrow pointing to the activity.
一个常见错误是混淆正向遍历和反向遍历的规则。记住：正向遍历取最大值；反向遍历取最小值。另一个错误是依赖关系对不齐，尤其是多条箭头汇聚到一个节点时。务必反复检查表中列出的每一个前驱是否都有箭头指向该活动。
Time management is crucial: these questions can become lengthy. Practice drawing the network quickly but neatly, using a ruler for straight lines. Label each node with EST/LST/duration/float in a consistent format. Show working for at least one forward and one backward calculation to earn method marks, even if you run out of time to complete all nodes.
时间管理至关重要：这类题目可能拉得很长。练习快速而整洁地绘制网络，借助直尺画出直线。以一致的格式给每个节点标上 EST/LST/持续时间/浮动时间。哪怕时间不够完成所有节点，也要展示至少一次正向和一次反向的计算过程，以赢得方法分。
Also, when stating the critical path, write it as a sequence (e.g., A – B – D). Do not simply list the critical activities; the order must form an unbroken chain from start to end.
此外，在陈述关键路径时，要写成一个序列（例如 A – B – D）。不能只是列出关键活动；其顺序必须形成一条从开始到结束的完整链条。
11. Practice Problem and Walkthrough | 练习题与分步详解
Consider a larger network with activities A(2), B(3) after A, C(4) after A, D(1) after B and C, E(2) after C, F(3) after D and E. Durations are in weeks. Let’s compute the critical path.
考虑一个更大的网络，包含活动 A（2），B（3）在 A 之后，C（4）在 A 之后，D（1）在 B 和 C 之后，E（2）在 C 之后，F（3）在 D 和 E 之后。持续时间以周为单位。我们来计算关键路径。
Forward pass: EST(A)=0, EFT=2. B: EST=2, EFT=5. C: EST=2, EFT=6. D: EST = max(5,6)=6, EFT=7. E: EST=6, EFT=8. F: EST = max(7,8)=8, EFT=11. Project duration = 11 weeks.
正向遍历：EST(A)=0，EFT=2。B：EST=2，EFT=5。C：EST=2，EFT=6。D：EST = max(5,6)=6，EFT=7。E：EST=6，EFT=8。F：EST = max(7,8)=8，EFT=11。项目周期 = 11 周。
Backward pass from F: LFT=11, LST=8. D: LFT = min(LST(F)) = 8, LST=7. E: LFT=8, LST=6. C: LFT = min(LST(D), LST(E)) = min(7,6) = 6, LST=2. B: LFT = LST(D)=7, LST=4. A: LFT = min(LST(B), LST(C)) = min(4,2)=2, LST=0.
从 F 开始反向遍历：LFT=11，LST=8。D：LFT = min(LST(F)) = 8，LST=7。E：LFT=8，LST=6。C：LFT = min(LST(D), LST(E)) = min(7,6) = 6，LST=2。B：LFT = LST(D)=7，LST=4。A：LFT = min(LST(B), LST(C)) = min(4,2)=2，LST=0。
Floats: A: 0, B: 4-2=2, C: 0, D: 7-6=1, E: 6-6=0, F: 0. Critical activities: A, C, E, F. Critical path: A – C – E – F. This path length is 2+4+2+3 = 11.
浮动时间：A：0，B：4-2=2，C：0，D：7-6=1，E：6-6=0，F：0。关键活动：A、C、E、F。关键路径：A – C – E – F。该路径长度为 2+4+2+3 = 11。
This walkthrough shows the power of systematic calculation. Even with multiple paths, the method remains identical. Highlighting the critical path on the diagram helps examiners see your final answer clearly.
这个分步示范展示了系统计算的力量。即使存在多条路径，方法仍然相同。在图表上高亮关键路径有助于阅卷人清楚地看到你的最终答案。
12. Conclusion and Further Practice | 小结与进一步练习
Critical path analysis is a methodical topic that rewards careful, step-by-step working. Start by interpreting the precedence table correctly, then perform forward and backward passes, compute floats, and extract the critical path. The ability to draw both activity networks and cascade charts ensures you can answer all styles of IB AQA questions.
关键路径分析是一个讲求条理的主题，细心、按部就班地解题就能获得回报。从正确解读前导表开始，然后执行正向和反向遍历，计算浮动时间，再提取关键路径。能够同时绘制活动网络和阶梯图，确保你可以应付 IB AQA 的各种题型。
To deepen understanding, create your own precedence tables from real-life scenarios (e.g., organizing a school event, baking a complex recipe) and model them. Compare your manual results with software tools like Microsoft Project, or simple online Gantt chart generators, to validate your logic. In the exam, neatness and clear labeling are your best allies. Trust the process, and you will find CPA both straightforward and highly scoring.
为加深理解，可以从现实生活场景（如组织学校活动、烘焙复杂食谱）中自创前导表，进行建模。将手工计算的结果与 Microsoft Project 等软件工具、或简单的在线甘特图生成器进行对比，来验证你的逻辑。考试中，整洁和标注清晰是你最好的帮手。相信这套流程，你会发现 CPA 既简单明了又易于得分。
Published by TutorHao | IB AQA Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导