📚 Critical Path Analysis | 关键路径分析
Critical Path Analysis (CPA) is a powerful project management tool that identifies the minimum time needed to complete a project and highlights the activities that cannot be delayed without affecting the overall schedule. In Edexcel A-Level Decision Mathematics, you will learn to construct activity-on-node networks, perform forward and backward passes to compute earliest and latest event times, calculate floats, and identify the critical path. These techniques then feed into cascade (Gantt) charts, resource histograms, and resource levelling, enabling efficient project planning.
关键路径分析（CPA）是一种强大的项目管理工具，它能够确定完成项目所需的最短时间，并突出那些一旦延误就会影响整体进度的活动。在Edexcel A-Level决策数学中，你将学习构建活动在节点上的网络图、进行前向与后向扫描以计算最早和最晚时间、计算浮动时间并识别关键路径。这些技术将进一步用于级联（甘特）图、资源直方图和资源平衡，从而实现高效的项目规划。
1. Understanding Critical Path Analysis | 理解关键路径分析
The core idea of CPA is to model a project as a network of activities, each with a known duration and a set of predecessor activities that must be completed first. By analysing these dependencies, we can compute the earliest possible finish date for the entire project. Any sequence of activities that directly determines the project's length is called a critical path. Activities on this path have zero slack; delaying them would push back the project completion date.
关键路径分析的核心思想是将一个项目建模为由若干活动组成的网络，每个活动都具有已知的持续时间，并依赖于一组必须先完成的前驱活动。通过分析这些依赖关系，我们可以计算出整个项目可能的最早完成日期。直接决定项目长度的活动序列称为关键路径。位于关键路径上的活动拥有零松弛；延迟它们就会推后项目的完成日期。
CPA originated in the 1950s as a joint effort by DuPont and Remington Rand to schedule plant maintenance projects. Today it is used in construction, aerospace, software development, and event planning. In an A-Level context, you will deal with smaller but conceptually identical problems. The methods are algorithmic and well suited to being scored accurately in an exam.
CPA 起源于 20 世纪 50 年代杜邦公司与雷明顿兰德公司为安排工厂维护项目而共同开发的技术。如今，它被广泛应用于建筑、航空航天、软件开发及活动策划等领域。在 A-Level 的语境下，你将处理规模较小但概念完全一致的问题。这些方法具有清晰的算法步骤，非常适合在考试中获得准确得分。
2. Representing Projects as Networks | 将项目表示为网络图
In Edexcel Decision Mathematics, we start with a precedence table. This table lists every activity, its duration, and the activities that must be finished before it can begin. From this, we draw an activity-on-node network. Each activity becomes a node (usually drawn as a rectangle or a box), and directed edges show the precedence constraints.
在Edexcel决策数学中，我们首先会得到一个先序关系表。该表列出了每项活动、它的持续时间，以及必须先于它完成的活动。基于此表，我们绘制活动在节点上的网络图。每项活动成为一个节点（通常画成矩形或方框），有向边则显示先后约束关系。
A simple example table might look like:
| Activity | Duration (days) | Immediate Predecessors |
|---|---|---|
| A | 3 | – |
| B | 5 | A |
| C | 4 | A |
| D | 2 | B, C |
The network begins with node A (no predecessors). From A, arrows go to B and C. Both B and C connect to D, meaning D can only start after B and C are both finished. The direction of arrows always goes from left to right as far as possible, and the network must never contain cycles.
网络从节点 A 开始（无前驱活动）。从 A 出发，箭头分别指向 B 和 C。B 和 C 共同指向 D，这意味着 D 只能在 B 和 C 均完成后才开始。箭头的方向应尽可能从左向右绘制，且网络图中绝对不能出现环。
3. Activity-on-Node Conventions | 活动在节点上的规范
Edexcel examinations expect you to use a standard node layout. A typical node is divided into four areas: the top-left corner holds the Earliest Start Time (EST), the top-right holds the Earliest Finish Time (EFT), the bottom-left holds the Latest Start Time (LST), and the bottom-right holds the Latest Finish Time (LFT). The activity name or letter is placed just above or inside the node, and its duration is recorded nearby, often beneath the activity label.
Edexcel 考试要求你采用标准的节点布局。一个典型的节点被分为四个区域：左上角记录最早开始时间（EST），右上角记录最早完成时间（EFT），左下角记录最晚开始时间（LST），右下角记录最晚完成时间（LFT）。活动名称或字母置于节点上方或内部，而持续时间则记录在附近，通常在活动标签下方。
This quadrants layout allows you to perform forward and backward passes systematically and to read off all necessary times at a glance. In many textbooks, the EST and EFT are filled during the forward pass and LST and LFT during the backward pass, making it easy to compute floats immediately after.
这种四象限布局使得你能够系统地进行前向和后向扫描，并一目了然地读取所有必要的时间信息。在许多教材中，EST 和 EFT 在前向扫描时填入，LST 和 LFT 在后向扫描时填入，这样随后就可以立即计算出浮动时间。
4. Forward Pass: Earliest Start and Finish Times | 前向扫描：最早开始和完成时间
The forward pass calculates the earliest times at which each activity can begin and end, progressing from the start of the network to the end. The rules are:
- The EST of the very first activity is 0.
- For any node, EFT = EST + duration.
- For any node with multiple predecessors, EST is the maximum of all predecessors' EFTs.
前向扫描计算每项活动最早可以开始和结束的时间，从网络图的起始端向终止端推进。其规则为：
- 第一个活动的 EST 为 0。
- 对于任意节点，EFT = EST + 持续时间。
- 对于拥有多个前驱节点的节点，EST 取所有前驱节点 EFT 的最大值。
EFT = EST + Duration
EST(node) = max{EFT(predecessors)}
= 7. D has predecessors B and C, so its EST = max(8,7) = 8; EFT = 8+2 = 10. The overall project duration is therefore 10 days.
使用前面的例子：A（持续时间3）的 EST = 0，因此 EFT = 3。B（持续时间5）从 A 获得 EST = 3，故 EFT = 8。C（持续时间4）同样 EST = 3，EFT = 7。D 的前驱为 B 和 C，因此 EST = max(8,7) = 8；EFT = 8+2 = 10。因此，整个项目的工期为 10 天。
s 3 and 7; D has 8 and 10. In an exam, you must show these values clearly on your diagram.
这一过程会记录在节点上：A 的左上角为 EST=0，右上角为 EFT=3；B 为 3 和 8；C 为 3 和 7；D 为 8 和 10。在考试中，你需要将这些数值清晰地标注在图表上。
5. Backward Pass: Latest Start and Finish Times | 后向扫描：最晚开始和完成时间
The backward pass works from the end of the network back to the start, determining the latest times that activities can start and finish without delaying the overall project. To begin, we set the LFT of the terminal node equal to the project duration (its own EFT). Then, moving right to left:
- LST = LFT – duration.
- For any node, its LFT is the minimum of all its successors' LSTs.
后向扫描从网络末端向起始端进行，确定活动在不延误整个项目的前提下最晚可以开始和结束的时间。首先，将结束节点的 LFT 设为项目工期（即其自身的 EFT）。然后从右向左移动：
- LST = LFT – 持续时间。
- 对于任意节点，其 LFT 取所有后继节点 LST 的最小值。
LST = LFT – Duration
LFT(node) = min{LST(successors)}
In our example, D is terminal with EFT=10, so LFT=10. Then LST of D = 10 – 2 = 8. For C, its only successor is D, so LFT of C = LST of D = 8; LST of C = 8 – 4 = 4. For B, LFT = 8, LST = 8 – 3. For A, successors B and C have LSTs 3 and 4; the minimum is 3, so LFT of A = 3; LST = 3 – 3 = 0.
在我们的例子中，D 是终点且 EFT=10，所以 LFT=10。于是 D 的 LST = 10 – 2 = 8。C 的唯一后继是 D，因此 C 的 LFT = D 的 LST = 8；C 的 LST = 8 – 4 = 4。B 的 LFT=8，LST=8 – 5 = 3。A 的后继 B 和 C 的 LST 分别为 3 和 4，最小值为 3，因此 A 的 LFT=3，LST=3 – 3 = 0。
Now each node has all four numbers. The completed network allows us to identify critical activities and float times. Be meticulous with the subtraction and minima; one error can cascade through the whole backward pass.
现在每个节点都有了完整的四个数字。完成的网络图使我们能够识别关键活动和浮动时间。减法与最小值计算务必仔细；一个错误可能导致整个后向扫描连锁出错。
6. Total Float and Critical Path | 总浮动时间与关键路径
Total float is the amount of time by which an activity can be delayed without affecting the overall project completion date. It is computed as:
Total Float = LFT – EST – Duration
Equivalently, Total Float = LST – ce of all critical activities from the start node to the end node forms the critical path.
总浮动时间是指一项活动可以延迟、而不影响整个项目完成日期的最大时间量。其计算公式为：
总浮动时间 = LFT – EST – 持续时间
等价地，总浮动时间 = LST – EST。如果一项活动的总浮动时间为零，那么它就是关键活动；它的任何延误都会直接拖延整个项目。从起始节点到终止节点的所有关键活动构成的序列即为关键路径。
From our calculations: for A, Total Float = 3 – 0 – 3 = 0 (critical). B: 8 – 3 – 5 = 0 (critical). C: 8 – 3 – 4 = 1 (non-critical, can float by 1 day). D: 10 – 8 – o highlight the critical path on an exam diagram with a double line or a different colour.
根据我们的计算：A 的总浮动时间 = 3 – 0 – 3 = 0（关键活动）；B: 8 – 3 – 5 = 0（关键活动）；C: 8 – 3 – 4 = 1（非关键活动，可浮动 1 天）；D: 10 – 8 – 2 = 0（关键活动）。因此，关键路径为 A → B → D。在考试图表中，通常会用双线或不同颜色高亮标出关键路径。
Knowing the critical path helps project managers focus on risks and resource allocation. If any critical activity is threatened, contingency plans can be activated. Non-critical activities offer some flexibility for shifting resources.
了解关键路径有助于项目经理聚焦风险和资源分配。如果任何关键活动面临威胁，就能启动应急预案。而非关键活动则为调配资源提供了一定的灵活性。
7. Free Float and Interfering Float | 自由浮动时间与干扰浮动时间
While Edexcel primarily tests total float, the syllabus also mentions the concepts of free float and interfering float. Free float is the amount of time an activity can be delayed without affecting the early start of any of its immediate successors. It is given by:
Free Float = min{EST(successors)} – EFT
ing Float. These finer floats help understand how delays propagate through the network, but precise calculation is generally not required in the examination.
虽然Edexcel主要考查总浮动时间，但大纲也提及了自由浮动时间和干扰浮动时间的概念。自由浮动时间是指一项活动可以延迟、而不影响其任意紧后活动最早开始时间的最大时间量。其公式为：
自由浮动时间 = min{后继节点的 EST} – EFT
干扰浮动时间则是总浮动时间中不属于自由浮动时间的剩余部分，即 总浮动时间 = 自由浮动时间 + 干扰浮动时间。这些更精细的浮动概念有助于理解延迟如何在网络中传播，但考试中通常不要求精确计算它们。
In practice, free float indicates slack that can be 'consumed' entirely by that activity without affecting any other activity. Interfering float is safer to understand as shared slack that may impact later activities if used.
实际上，自由浮动时间指示了可以由该活动完全消耗、而不影响任何其他活动的松弛量。干扰浮动时间则最好理解为共享松弛，如果被使用，可能影响后续活动。
8. Cascade (Gantt) Charts | 甘特图（级联图）
Once times have been determined, a cascade chart—often called a Gantt chart—can be drawn to visualise the schedule. Activities are plotted as horizontal bars against a time axis. Each bar starts at the activity's EST and ends at its EFT. Critical activities are usually shaded solid, while non-critical activities are shown with an extension (often a dotted line or hollow box) representing the total float.
在确定各项时间之后，即可绘制级联图（通常称为甘特图）以直观展示时间安排。活动表示为沿时间轴排列的水平条状。每个条状从活动的 EST 开始，到它的 EFT 结束。关键活动通常用实心着色，而非关键活动则用一个延伸部分（通常是虚线或空心框）来表示总浮动时间。
In an Edexcel exam question, you may be asked to draw a cascade chart displaying each activity, its duration, and its total float. The chart provides a clear picture of when resources are needed and where slack exists. Consistent scaling and labelling are essential, as marks are typically awarded for accuracy of times and clarity of presentation.
在Edexcel考试中，你可能需要绘制展示每项活动、其持续时间及总浮动时间的级联图。这种图表能够清晰地呈现何时需要资源以及何处存在松弛。一致的比例和标注至关重要，因为得分通常依据时间的准确性和展示的清晰度而定。
9. Resource Histograms and Levelling | 资源直方图与资源平衡
From the cascade chart, we can construct a resource histogram. This shows the number of workers or amount of a resource required on each day, assuming activities start at their earliest times. Each active bar contributes its resource requirement per time unit, and these are stacked or summated. The resulting histogram often shows peaks and troughs in resource demand.
从级联图出发，我们可以构建资源直方图。它显示了假定活动按其最早时间开始、每天所需的工人数量或资源量。每个活跃的活动条将其单位时间资源需求叠加求和。所得直方图通常会显示出资源需求的高峰和低谷。
Resource levelling is the process of smoothing these peaks without extending the project. Activities with total float can be moved later in time (up to their LST) to spread out demand. The goal is to minimise the maximum resource required or to reduce fluctuations. A typical exam question asks you to suggest a schedule that evens out the workforce, stating which activities are shifted and by how many days.
资源平衡是在不延长项目工期的前提下平滑这些高峰的过程。可以利用活动的总浮动时间，将活动往后移动（最多到其 LST）以分散需求。其目标是最小化最大资源需求或减少波动。一个典型的考题会要求你提出一个能平衡劳动力的日程安排，并指出哪些活动被移动以及移动了多少天。
10. Criticisms and Limitations | 批评与局限性
Despite its usefulness, CPA relies on several simplifying assumptions. Activity durations are assumed to be deterministic (known with certainty), which is rarely the case in real projects where uncertainty abounds. The technique also assumes unlimited resources, whereas in reality staffing and equipment constraints may mean that some activities cannot run concurrently. In addition, large projects produce extremely complex networks that are hard to maintain manually; small errors in logic can invalidate the analysis.
尽管CPA用处很大，但它依赖于若干简化假设。活动持续时间被假定为确定的（确切已知），而现实中项目充满不确定性，这种情况很少出现。该技术还假设资源无限，但在实际工作中，人员和设备约束可能意味着某些活动无法同时进行。此外，大型项目会产生极为复杂的网络图，手工会难以维护；微小的逻辑错误就可能导致分析无效。
CPA does not inherently account for cost or risk trade-offs. Techniques like PERT (Program Evaluation and Review Technique) and resource-constrained scheduling have been developed to address these issues. Nevertheless, for many A‑Level and real-world scenarios
Published by TutorHao | A-Level Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图