📚 GCSE Maths: Critical Path Analysis Expert Guide | GCSE 数学：关键路径分析 考点精讲
Critical Path Analysis (CPA) is a powerful project management tool that helps us schedule complex projects efficiently. It allows you to identify which tasks are “critical” — meaning any delay to them will delay the entire project — and which tasks have “float” or slack time. For GCSE Maths, mastering CPA involves understanding precedence tables, drawing activity networks, performing forward and backward passes, and calculating total float. This guide will walk you through every concept with clear examples and step-by-step methods.
关键路径分析（CPA）是一种强大的项目管理工具，帮助我们高效地安排复杂项目。它能让你识别哪些任务是”关键”的——即对这些任务的任何延误都会推迟整个项目——以及哪些任务具有”浮动”或松弛时间。对于GCSE数学，掌握CPA涉及理解前导表、绘制活动网络图、进行正向和逆向遍历，以及计算总浮动时间。本指南将通过清晰的示例和分步方法带你学习每一个概念。
1. What is Critical Path Analysis? | 什么是关键路径分析？
Critical Path Analysis is a method used to plan and control large-scale projects by breaking them down into individual activities. Each activity has a duration and may depend on the completion of other activities before it can begin. The “critical path” is the longest path through the network from start to finish, and it determines the minimum time needed to complete the entire project. Activities on this path cannot be delayed without extending the project’s overall duration.
关键路径分析是一种通过将大规模项目分解为单个活动来进行计划和控制的方法。每个活动都有一个持续时间，并且可能依赖于其他活动的完成才能开始。”关键路径”是从开始到结束穿越网络的最长路径，它决定了完成整个项目所需的最短时间。此路径上的活动不能被延迟，否则会延长项目的总持续时间。
2. Activity-on-Node (AON) Networks | 节点活动（AON）网络图
In GCSE Maths, we primarily use the Activity-on-Node (AON) representation, where each activity is represented by a node (a box or circle), and arrows show the dependencies between activities. A node typically contains the activity name or letter and its duration. The network always has a single start node and a single end node. Edges (arrows) only indicate precedence — they do not represent activities themselves, and they carry no duration.
在GCSE数学中，我们主要使用节点活动（AON）表示法，其中每个活动由一个节点（方框或圆圈）表示，箭头显示活动之间的依赖关系。节点通常包含活动名称或字母及其持续时间。网络图始终有一个开始节点和一个结束节点。边（箭头）仅表示先后关系——它们不代表活动本身，也不带有持续时间。
3. Precedence Tables and Dependency | 前导表与依赖关系
A precedence table lists every activity in the project along with its duration and any immediate predecessors that must be finished before it can start. Some activities may have no predecessors and can begin as soon as the project starts. Understanding the dependencies is the crucial first step before drawing the network. You must check that every dependency is satisfied by the arrangement of nodes and arrows.
前导表列出了项目中的每个活动及其持续时间，以及在其开始之前必须完成的任何紧前活动。有些活动可能没有前导活动，可以在项目开始时立即启动。理解依赖关系是绘制网络图之前关键的第一步。你必须检查每个依赖关系是否都通过节点和箭头的安排得到满足。
Example Precedence Table | 示例前导表：
| Activity | 活动 | Duration (days) | 持续时间（天） | Predecessors | 前导活动 |
|---|---|---|
| A | 5 | None | 无 |
| B | 3 | A |
| C | 4 | A |
| D | 2 | B, C |
4. Drawing the Activity Network | 绘制活动网络图
Start by placing the activities that have no predecessors first, and connect them forward according to the dependencies. Use a single start node and a single end node — if multiple activities can start at the beginning, they all follow from the start. If multiple activities finish at the end without successors, they all point into the finish node. Arrows go from predecessor to successor. Make sure no activity appears before its predecessors, and check that every arrow correctly reflects the precedence table.
首先放置没有前导活动的活动，并根据依赖关系向前连接它们。使用单个开始节点和单个结束节点——如果多个活动可以在开始时启动，它们都从开始节点出发。如果多个活动在结束时没有后续活动，它们都指向结束节点。箭头从前导活动指向后续活动。确保没有活动出现在其前导活动之前，并检查每个箭头是否正确反映了前导表。
5. Forward Pass and Earliest Start Times (EST) | 正向遍历与最早开始时间（EST）
The forward pass calculates how early each activity can begin. The earliest start time (EST) for the initial activities is 0. For any activity, its EST is the maximum of the earliest finish times (EFT) of all its immediate predecessors. The earliest finish time (EFT) is calculated as: EFT = EST + Duration. You work from left to right through the network, recording these values in the nodes. The EST of the finish node gives the minimum project completion time.
正向遍历计算每个活动最早可以开始的时间。初始活动的最早开始时间（EST）为0。对于任何活动，其EST是其所有紧前活动的最早完成时间（EFT）中的最大值。最早完成时间（EFT）计算为：EFT = EST + 持续时间。你从左到右遍历网络图，将这些值记录在节点中。结束节点的EST给出了最短项目完成时间。
EFT = EST + Duration | 最早完成时间 = 最早开始时间 + 持续时间
6. Backward Pass and Latest Finish Times (LFT) | 逆向遍历与最晚完成时间（LFT）
The backward pass determines how late each activity can finish without delaying the project. Begin by setting the latest finish time (LFT) of the end node equal to the project’s minimum completion time found in the forward pass. For any activity, its LFT is the minimum of the latest start times (LST) of all its immediate successors. The latest start time (LST) is calculated as: LST = LFT − Duration. Work from right to left through the network, recording these values.
逆向遍历确定每个活动可以在不延误项目的情况下最晚完成的时间。首先将结束节点的最晚完成时间（LFT）设置为正向遍历中找到的项目最短完成时间。对于任何活动，其LFT是其所有紧后活动的最晚开始时间（LST）中的最小值。最晚开始时间（LST）计算为：LST = LFT − 持续时间。从右到左遍历网络图，记录这些值。
LST = LFT − Duration | 最晚开始时间 = 最晚完成时间 − 持续时间
7. Total Float and Critical Activities | 总浮动时间与关键活动
Total float is the amount of time an activity can be delayed without affecting the overall project duration. It is calculated as: Total Float = LFT − EST − Duration, or equivalently, Total Float = LFT − EFT or Total Float = LST − EST. Activities with zero total float are called critical activities — they lie on the critical path and cannot be delayed at all. The critical path is the continuous chain of critical activities from start to finish.
总浮动时间是一个活动可以在不影响整体项目持续时间的情况下被延迟的时间量。它计算为：总浮动时间 = LFT − EST − 持续时间，或等价地，总浮动时间 = LFT − EFT 或 总浮动时间 = LST − EST。总浮动时间为零的活动称为关键活动——它们位于关键路径上，完全不能被延迟。关键路径是从开始到结束贯穿关键活动的连续链条。
8. Identifying the Critical Path Step by Step | 逐步识别关键路径
After completing both the forward and backward passes, calculate the total float for every activity. List all activities with total float equal to zero. Trace a path from the start node to the end node using only these zero-float activities. This path is the critical path. If there is more than one such path, the project has multiple critical paths — all must be managed with equal care because a delay on any one of them will delay the entire project.
在完成正向和逆向遍历之后，计算每个活动的总浮动时间。列出所有总浮动时间为零的活动。仅使用这些零浮动时间活动，从开始节点到结束节点追踪出一条路径。这条路径就是关键路径。如果存在不止一条这样的路径，项目就有多条关键路径——所有这些路径都必须同样谨慎管理，因为它们中任何一条的延误都会推迟整个项目。
9. Gantt Charts and Cascade Diagrams | 甘特图与级联图
Once you have determined the EST, LST, and total float for each activity, you can represent the schedule visually using a Gantt chart (also called a cascade diagram in some GCSE specifications). Each activity is shown as a horizontal bar starting at its EST and extending for its duration. The float is shown as a dotted extension from the end of the bar up to the LST plus duration. Critical activities have no dotted extension. This visual representation makes it easy to see where slack exists.
一旦确定了每个活动的EST、LST和总浮动时间，你就可以使用甘特图（在某些GCSE规范中也称为级联图）将进度可视化。每个活动显示为一个水平条，从其EST开始，延伸其持续时间。浮动时间显示为从条的末端到LST加持续时间的虚线延伸。关键活动没有虚线延伸。这种可视化表示使得松弛时间一目了然。
10. Resource Levelling and Scheduling | 资源均衡与调度
Resource levelling uses the float information to adjust the start times of non-critical activities so that resources (such as workers or machines) are used as evenly as possible throughout the project. By delaying some activities within their available float, you can avoid peaks of resource demand. This might mean starting an activity at its LST rather than its EST, provided it does not become critical. The goal is to create a more balanced and cost-effective schedule.
资源均衡利用浮动时间信息来调整非关键活动的开始时间，使资源（如工人或机器）在整个项目中尽可能均匀使用。通过在可用浮动时间内延迟某些活动，可以避免资源需求的高峰。这可能意味着在其LST而不是EST开始某项活动，前提是它不会变成关键活动。目标是创建一个更平衡、更具成本效益的进度表。
11. Common GCSE Exam Question Types | GCSE常见考试题型
GCSE questions on critical path analysis typically ask you to draw an activity network from a precedence table, perform forward and backward passes, calculate total floats, identify the critical path, state the minimum project duration, and construct a Gantt chart. You may also be asked to explain the effect of delaying a specific activity or to schedule resources. Marks are awarded for correct node labelling, accurate calculations, and clear methodology. Always show your working clearly in the node boxes.
GCSE关于关键路径分析的考题通常要求你根据前导表绘制活动网络图，进行正向和逆向遍历，计算总浮动时间，识别关键路径，说明最短项目持续时间，并构建甘特图。你可能还会被要求解释延迟特定活动的影响或进行资源调度。正确的节点标注、准确的计算和清晰的方法都能得分。务必在节点框中清楚地展示你的计算过程。
12. Tips for Exam Success | 考试成功小贴士
Always double-check your precedence table against your network diagram before beginning calculations — a single missing arrow can lead to all subsequent values being incorrect. When performing the forward pass, take the maximum of predecessor EFTs; when doing the backward pass, take the minimum of successor LSTs. This is a very common error point. Remember that total float can never be negative — if you get a negative value, you have made a mistake. Practice drawing cascade diagrams neatly, as they are often worth several marks and must clearly distinguish between activity bars and float extensions.
在开始计算之前，务必对照你的网络图仔细核对前导表——一个遗漏的箭头可能导致所有后续数值出错。进行正向遍历时，取前导活动EFT的最大值；进行逆向遍历时，取后续活动LST的最小值。这是一个非常常见的易错点。请记住，总浮动时间永远不能为负——如果你得到负值，一定是出错了。练习整齐地绘制级联图，因为它们通常值好几分，必须清楚地区分活动条和浮动延伸部分。
Published by TutorHao | GCSE Maths Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply