📚 Critical Path Analysis for GCSE CCEA Maths | GCSE CCEA 数学:关键路径分析 考点精讲
Critical Path Analysis (CPA) is a powerful project management tool used to plan and schedule complex tasks. It helps you identify the minimum time needed to complete a project and highlights which activities cannot be delayed without affecting the overall deadline. For CCEA GCSE Maths, you need to be able to construct precedence tables, draw activity networks, carry out forward and backward passes, calculate floats and determine the critical path.
关键路径分析(CPA)是一种强大的项目管理工具,用于规划和安排复杂的任务。它可以帮助你确定完成项目所需的最短时间,并突出哪些活动不能延迟,否则会影响整个项目的截止日期。对于 CCEA GCSE 数学,你需要能够构建前导表、绘制活动网络、进行正推和逆推计算、计算浮动时间并确定关键路径。
1. Understanding Projects and Activities | 理解项目与活动
A project is broken down into individual tasks called activities. Each activity has a duration (the time it takes to complete) and dependencies (other activities that must be finished before it can start). In CPA, we treat the project as a network of activities, allowing us to analyse timing and scheduling systematically.
一个项目被分解成被称为“活动”的单独任务。每个活动都有一个持续时间(完成所需的时间)和依赖关系(必须在它开始之前完成的其他活动)。在关键路径分析中,我们将项目视为一个活动网络,从而能够系统地分析时间安排和调度。
You will often be given a list of activities with their durations and immediate predecessors. Your first job is to represent this information in a clear, structured format.
题目通常会给出一个活动列表,包含每个活动的持续时间和紧前活动。你的首要任务是以清晰、结构化的形式呈现这些信息。
- Activity: a task with a start and finish.
- 活动:一个有开始和结束的任务。
- Duration: the time an activity takes, usually in days or hours.
- 持续时间:一项活动所占用的时间,通常以天或小时为单位。
- Predecessor: an activity that must be completed before another can begin.
- 紧前活动:必须在另一项活动开始之前完成的活动。
2. Precedence Tables: Dependencies in a Nutshell | 前导表:一目了然的依赖关系
A precedence table lists each activity, its duration, and its immediate predecessors. This table is the foundation for drawing the network diagram. It is essential to read the table carefully to avoid missing any dependency.
前导表列出了每项活动、其持续时间以及紧前活动。这个表格是绘制网络图的基础。仔细阅读表格至关重要,以免遗漏任何依赖关系。
Here is an example of a simple precedence table:
以下是一个简单前导表的示例:
| Activity | Duration (days) | Predecessors |
|---|---|---|
| A | 5 | – |
| B | 4 | – |
| C | 7 | A |
| D | 3 | A |
| E | 6 | B, C |
From this, you can see that activities A and B have no predecessors and can start immediately. Activity C depends on A, and activity E depends on both B and C.
从中你可以看出,活动 A 和 B 没有紧前活动,可以立即开始。活动 C 依赖于 A,而活动 E 依赖于 B 和 C 两者。
3. Activity-on-Arc (AOA) Networks | 弧表示活动网络(AOA)
CCEA typically uses the Activity-on-Arc method for network diagrams. In this representation, activities are shown as directed arcs (arrows), and nodes (circles) represent events — the start or finish of activities. The length of an arc in the drawing is not related to its duration; the duration is written on or near the arc.
CCEA 通常使用弧表示活动(AOA)的方法来绘制网络图。在这种表示法中,活动用有向弧(箭头)表示,节点(圆圈)代表事件——活动的开始或结束。图中弧的长度与其持续时间无关;持续时间写在弧上或其附近。
An event node is a point in time when certain activities have been completed and others can begin. The network must always have a unique start node and a unique finish node.
事件节点是一个时间点,表示某些活动已经完成而其他活动可以开始。网络必须始终具有唯一的起始节点和唯一的结束节点。
Every arc has a direction, and you cannot cycle back. This is a directed acyclic graph, meaning the project moves forward in time.
每条弧都有一个方向,并且不能形成环路。这是一个有向无环图,意味着项目在时间上向前推进。
4. Drawing Conventions: Nodes, Arcs and Dummy Activities | 绘制规范:节点、弧和虚活动
When dependencies cannot be shown using only real activities, you must introduce a dummy activity. A dummy activity has zero duration and is drawn as a dashed arrow. It does not consume time or resources; its only purpose is to show a logical dependency between events.
当仅用真实活动无法表示依赖关系时,你必须引入虚活动。虚活动持续时间为零,用虚线箭头表示。它不消耗时间或资源;其唯一目的是显示事件之间的逻辑依赖关系。
For example, if activity C depends on A, and D depends on A and B, but B and C are independent, you may need a dummy to correctly represent that D requires both A and B.
例如,如果活动 C 依赖于 A,活动 D 依赖于 A 和 B,但 B 和 C 是独立的,你可能需要一条虚活动来表示 D 同时需要 A 和 B。
Nodes are numbered so that each arc goes from a lower-numbered node to a higher-numbered node. The start node is often numbered 1, and nodes are numbered as you proceed through the network.
节点编号的规则是每条弧都要从编号较小的节点指向编号较大的节点。起始节点通常编号为 1,随着网络的推进依次对节点进行编号。
When drawing the network, always use a ruler, label activities clearly, and place durations on the arcs. Mark dummy activities with a dashed line and a zero duration.
绘制网络时,务必使用直尺,清楚地标记活动,并将持续时间写在弧上。用虚线和零持续时间来标记虚活动。
5. Forward Pass: Earliest Start and Finish Times | 正推计算:最早开始时间和最早完成时间
The forward pass calculates the earliest possible time each event can occur and each activity can start and finish. You work from the start node to the finish node.
正推计算用于确定每个事件可能发生的最早时间以及每个活动可以开始和完成的最早时间。你需要从起始节点计算到结束节点。
For each activity, record its Earliest Start Time (EST) and Earliest Finish Time (EFT). At the start node, EST = 0 for all activities leaving that node. The EFT is found using:
对于每个活动,记录其最早开始时间(EST)和最早完成时间(EFT)。在起始节点,所有从该节点出发的活动的 EST = 0。EFT 通过以下公式得出:
EFT = EST + Duration
When an activity depends on more than one predecessor, its EST is the maximum EFT of all incoming activities. This ensures all prerequisite activities are finished.
当一项活动依赖于多个紧前活动时,其 EST 是所有进入该活动的活动的 EFT 中的最大值。这确保了所有前提活动都已完成。
Continue this process until you reach the finish node. The overall project duration is the EFT of the final activity or the latest EFT at the finish node.
持续这一过程直到到达结束节点。整个项目的持续时间是最终活动的 EFT 或结束节点处最大的 EFT。
6. Backward Pass: Latest Start and Finish Times | 逆推计算:最晚开始时间和最晚完成时间
The backward pass calculates the latest time each activity can start and finish without delaying the project. Start from the finish node and work backwards to the start node.
逆推计算用于确定在不延迟整个项目的前提下,每个活动可以开始和完成的最晚时间。从结束节点开始,逆向计算到起始节点。
At the finish node, the Latest Finish Time (LFT) for all ending activities is set equal to the project duration (found from the forward pass). Then use:
在结束节点,所有结束活动的最晚完成时间(LFT)设定为项目持续时间(由正推计算得出)。然后使用公式:
LST = LFT – Duration
To find the LFT of an activity that is followed by several others, take the minimum LST of those successor activities. The backward pass ensures no successor is delayed.
要确定一个后面跟着多个活动的活动的 LFT,需取那些后续活动的 LST 的最小值。逆推计算确保不会延误任何后续活动。
Carefully record both LST and LFT for each activity. These values are essential for float calculations and critical path identification.
仔细记录每个活动的 LST 和 LFT。这些数值对于浮动时间计算和关键路径识别至关重要。
7. Total Float: The Spare Time | 总浮动时间:可机动时间
Total float (or simply float) is the amount of time an activity can be delayed without affecting the overall project completion date. It is calculated as:
总浮动时间(简称浮动时间)是指在不影响整个项目完成日期的前提下,一项活动可以延迟的时间量。其计算公式为:
Total Float = LST – EST
Total Float = LFT – EFT
Both formulas give the same result. If an activity has zero float, it means any delay will directly push back the project finish date.
这两个公式的结果相同。如果某一活动的浮动时间为零,意味着任何延迟都会直接推迟项目的完成日期。
Activities with positive float have some scheduling flexibility. However, using up float on one activity may affect the float of others sharing the same resource or path.
具有正浮动时间的活动有一定的调度灵活性。但用完一项活动的浮动时间,可能会影响共享同一资源或路径的其他活动的浮动时间。
8. Identifying the Critical Path | 识别关键路径
The critical path is the sequence of activities that have zero total float. It forms the longest path through the network in terms of duration and determines the minimum project completion time.
关键路径是由总浮动时间为零的活动所组成的序列。从持续时间来看,它构成了网络中最长的路径,并决定了项目的最短完成时间。
To find the critical path, trace a route from the start node to the finish node where every activity has float = 0. There may be more than one critical path; if so, all such paths have the same total duration.
要找到关键路径,需要从起始节点到结束节点追踪一条路线,路径上每个活动的浮动时间都为零。可能存在多条关键路径;如果有的话,所有关键路径的总持续时间都相同。
On an exam diagram, you should highlight the critical path clearly, often with a double line or a different colour. Show all calculations neatly as marks are awarded for method.
在考试绘制的图表中,你应该清晰地突出显示关键路径,通常使用双线或不同的颜色。整洁地展示所有计算过程,因为解题方法也有分值。
9. Interpreting Gantt Charts (CCEA Context) | 解读甘特图(CCEA 考试背景)
CCEA may ask you to produce or analyse a Gantt (cascade) chart based on the results of your critical path analysis. A Gantt chart is a horizontal bar chart showing each activity’s start and finish times, often with float represented as a shaded or outlined extension.
CCEA 可能会要求你根据关键路径分析的结果绘制或分析甘特图(级联图)。甘特图是一种水平条形图,显示每项活动的开始和结束时间,通常以阴影或虚线外框来表示浮动时间。
Each activity is drawn as a solid bar indicating its earliest start to earliest finish. The float, if any, is shown as a dotted line or lighter bar extending to the latest finish. Critical activities have no dotted extension.
每个活动都绘制成一个实心条,表示从最早开始到最早完成。如果有浮动时间,则用虚线或较浅的条形延伸至最晚完成时间来表示。关键活动没有虚线延伸部分。
When constructing a Gantt chart, you must use a suitable time scale and label each bar. The chart helps visualise the schedule and identify periods where resources might be over-allocated.
构建甘特图时,你必须使用合适的时间刻度,并为每个条形添加标签。该图表有助于直观地展示进度安排,并识别资源可能过度分配的时段。
10. Resource Levelling and Smoothing (Optional Insight) | 资源均衡与平滑(可选深入内容)
While not always tested in detail, resource levelling and smoothing are logical extensions of float analysis. Resource levelling aims to minimise peaks and troughs in resource usage, possibly extending the project duration but keeping it within acceptable limits.
虽然这些内容在考试中不总是详细考查,但资源均衡和平滑是浮动时间分析的合理延伸。资源均衡旨在最小化资源使用的波峰和波谷,这可能会延长项目工期,但使其保持在可接受的范围内。
Resource smoothing, on the other hand, uses available float to shift activities so that resource demand becomes more even, without changing the overall project duration. Both rely on the float information derived from the network.
另一方面,资源平滑利用可用的浮动时间来调整活动的安排,使得资源需求更加平稳,同时不改变整个项目的工期。两者都依赖于从网络中得出的浮动时间信息。
In a CCEA question, you might be asked to rearrange a Gantt chart to avoid resource clashes, using float. Always ensure that the critical path is not altered unless the question permits a deadline extension.
在 CCEA 的考题中,你可能会被要求利用浮动时间重新安排甘特图以避免资源冲突。除非题目允许延长截止日期,否则务必确保关键路径不被改变。
11. Common Pitfalls and Exam Tips | 常见陷阱与考试技巧
Many students lose marks by misreading the precedence table or forgetting that a dummy activity may be needed to preserve logic. Always double-check predecessors before drawing arcs.
许多学生因为误读前导表或忘记可能需要用虚活动来维持逻辑而丢分。在绘制弧之前,一定要仔细检查紧前活动。
When carrying out pass calculations, work systematically node by node. Write EST and LFT values clearly inside or beside the nodes. Mixing up forward and backward pass rules is a common error — recall that forward pass takes the maximum, backward pass takes the minimum.
在进行正推和逆推计算时,要从一个节点到另一个节点系统地计算。将 EST 和 LFT 值清晰地写在节点内部或旁边。混淆正推与逆推规则是一个常见错误——记住,正推取最大值,逆推取最小值。
Do not confuse total float with free float (which CCEA may not require). Total float is the key to finding the critical path. Always show your subtraction steps: LST – EST = Float.
不要混淆总浮动时间与自由浮动时间(CCEA 可能不作要求)。总浮动时间是找到关键路径的关键。务必展示减法步骤:LST – EST = 浮动时间。
Finally, check that your network has no dangling activities and that the finish node is reachable. Practise past paper questions under timed conditions to build speed and accuracy.
最后,检查你的网络没有悬挂的活动,并且可以到达结束节点。在限时条件下练习历年真题,以提高速度和准确性。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022(同微信)