📚 Critical Path Analysis for CIE GCSE Maths | CIE GCSE 数学关键路径分析考点精讲
Critical Path Analysis (CPA) is a decision mathematics technique used to plan, schedule, and manage complex projects. It helps you find the minimum time needed to complete a project and identify the tasks that cannot be delayed without extending the overall project duration. In CIE GCSE Maths, you will be expected to draw an activity network, perform forward and backward passes, calculate total float, and determine the critical path from a precedence table.
关键路径分析（CPA）是一种用于规划、调度和管理复杂项目的决策数学技术。它能帮你找出完成项目所需的最短时间，并确定哪些任务一旦延迟就会导致整个项目延期。在 CIE GCSE 数学考试中，你需要根据前驱关系表画出活动网络图，进行正向传递和反向传递，计算总浮动时间，并确定关键路径。
1. Introduction to Critical Path Analysis | 关键路径分析简介
CPA models a project as a collection of activities linked by precedence constraints. Each activity has a duration, and some activities must be finished before others can start. The analysis yields a project duration, highlights critical activities, and shows how much slack (float) exists on non‑critical tasks. This is vital for resource allocation and risk management.
CPA 将项目建模为一组由前后依赖关系连接起来的活动。每个活动都有一个持续时间，且某些活动必须在其他活动开始前完成。通过分析可以得到项目总工期、找出关键活动，并显示非关键任务有多少松弛时间（浮动时间）。这对资源分配和风险管理至关重要。
2. Activities, Durations and Precedences | 活动、持续时间与前驱关系
A project is usually described by a precedence table listing each activity, its duration, and its immediate predecessors. For example, activity A might take 3 days and have no predecessors, while activity B takes 5 days and depends on A. Understanding this table is the first step; you must translate text-based dependencies into a network correctly.
项目通常通过一个前驱表描述，表中列出每个活动、它的持续时间以及它的紧前活动。例如，活动 A 可能耗时 3 天且无前驱，而活动 B 耗时 5 天且依赖 A。理解这张表是第一步；你必须正确地将文字描述的依赖关系转换成网络图。
3. Drawing the Activity Network | 绘制活动网络图
In CIE GCSE, activities are usually represented on nodes (Activity‑On‑Node network). Each node stands for an activity and contains spaces for its earliest start time (EST) and latest start time (LST). Arcs (arrows) show dependency: an arc from X to Y means X must finish before Y can start. The network must have one start node and one end node; you may need to introduce dummy activities with zero duration to preserve logic when two activities share the same predecessors or successors but are not dependent on each other.
在 CIE GCSE 中，活动通常用节点表示（活动节点网络）。每个节点代表一个活动，并留有填写最早开始时间（EST）和最晚开始时间（LST）的位置。弧（箭头）表示依赖关系：从 X 指向 Y 的弧意味着 X 必须在 Y 开始前完成。网络图必须有一个起点和一个终点；当两个活动拥有相同的前驱或后继但彼此无依赖时，可能需要引入持续时间为零的虚拟活动来保持逻辑正确。
4. Node Numbering and Dummy Activities | 节点编号与虚拟活动
Nodes are often numbered after the network is drawn, typically reflecting the sequence of EST. Dummy activities, drawn as dashed arrows and taking zero time, serve to clarify dependencies. For instance, if activity C depends on A, and D depends on A and B, but C does not depend on B, a dummy from B to C may be needed. Avoid unnecessary dummies; only use them when the precedence logic demands it.
节点通常在网络图绘制后进行编号，编号一般反映最早开始时间的顺序。虚拟活动用虚线箭头表示，耗时为零，作用在于理清依赖关系。例如，若活动 C 依赖 A，D 同时依赖 A 和 B，而 C 并不依赖 B，你可能需要从 B 指向 C 的虚拟活动。避免不必要的虚拟活动；仅在依赖逻辑确实必需时才使用它们。
5. Earliest Start Times – Forward Pass | 最早开始时间 – 正向传递
The forward pass calculates the EST for each activity. Set the EST of the start node to 0. For any other node, EST = maximum of (EST of each predecessor + its duration). Work from left to right across the network. If a node has multiple incoming arcs, take the largest value, because all predecessors must be completed. The EST of the end node gives the minimum total project completion time.
正向传递计算每个活动的最早开始时间。将起点节点的 EST 设为 0。对于任何其他节点，EST = max（每个前驱节点的 EST + 该前驱的持续时间）。从左向右遍历网络。若一个节点有多条入弧，取最大值，因为所有前驱都必须完成。终点节点的 EST 即为项目的最短总工期。
6. Latest Start Times – Backward Pass | 最晚开始时间 – 反向传递
The backward pass determines the LST without delaying the project. Start at the end node: its LST equals its EST (the project duration). Moving right to left, for each node, LST = minimum of (LST of each successor – duration of the current activity). If a node has several outgoing arcs, pick the smallest value. This ensures no successor is forced to delay the project.
反向传递在不延长工期的前提下确定最晚开始时间。从终点节点开始：其 LST 等于其 EST（项目工期）。从右向左，对每个节点，LST = min（每个后继节点的 LST – 当前活动的持续时间）。若一个节点有多条出弧，取最小值。这样可以确保不会迫使任何后继活动延误整个项目。
7. Calculating Total Float | 计算总浮动时间
Total float for an activity is the amount of time it can be delayed without affecting the overall project completion. It is computed as: Total Float = LST – EST. An activity with zero float has no slack and must start exactly on time; any delay to it will delay the entire project. Float can be positive, representing spare time that can be used for resource levelling.
一个活动的总浮动时间是指它可以被延误而不影响整个项目完工的时间量。计算方法为：总浮动时间 = LST – EST。浮动时间为零的活动没有松弛，必须严格按照计划开始；任何延误都会导致项目整体延期。浮动时间可以为正，代表多余时间可用来进行资源调配。
8. Identifying the Critical Path | 确定关键路径
The critical path is the continuous chain of activities from start to end where every activity has total float equal to zero. It is the longest path through the network in terms of duration. There may be more than one critical path. You can trace it by following nodes where EST = LST. Highlighting this path on the network diagram shows which activities demand the closest monitoring.
关键路径是从起点到终点的一条连续活动链，链上每个活动的总浮动时间都为零。从持续时间看，它也是网络中最长的路径。可能存在多条关键路径。你可以通过追踪 EST = LST 的节点来找到它。在网络图中标出这条路径，可以显示哪些活动需要密切监控。
9. Interpreting Critical Path and Float | 解读关键路径与浮动时间
Critical activities have no flexibility—any delay directly pushes the project finish date. Non‑critical activities possess float, meaning the project manager can delay them or extend their duration up to the float amount without affecting the end deadline. Understanding float helps in smoothing resources and handling unexpected disruptions. For a given activity, free float can also be calculated, but GCSE CIE mainly focuses on total float.
关键活动毫无弹性——任何延迟都会直接推迟项目完成日期。非关键活动则拥有浮动时间，意味着项目经理可以将其延后或延长其持续时间，只要不超过浮动时间就不会影响最终截止日期。理解浮动有助于平滑资源使用和处理意外中断。对于某个活动还可计算自由浮动时间，但 CIE GCSE 主要关注总浮动时间。
10. Common Mistakes in CPA | 关键路径分析常见错误
Students often misread precedence tables, leading to missing arcs or adding unnecessary dummies. Some forget that EST always takes the maximum, while LST takes the minimum. Another error is calculating float as EST – LST instead of LST – EST, or labelling nodes incorrectly. Double‑check that every activity, except start and end, has at least one predecessor and one successor in the network.
学生常误读前驱表，导致遗漏弧线或添加了不必要的虚拟活动。有些人忘记了EST 总是取最大值，而 LST 取最小值。另一个错误是把浮动时间算成了 EST – LST 而不是 LST – EST，或者节点编号出错。务必检查每个活动（除起点和终点外）在网络中都有至少一个前驱和一个后继。
11. Worked Example | 例题演练
A project has activities A (3 days, no predecessor), B (4 days, after A), C (2 days, after A), D (5 days, after B and C). Draw the network, perform forward and backward passes, and find the critical path. EST: A=0, B=3, C=3, D=max(3+4,3+2)=7. Project duration = 7+5=12 days. LST: D=7, B=7−5=2? Wait, recalc: D’s LST = project duration (12) minus D’s duration (5) = 7. Then C’s LST = D’s LST (7) − C’s duration (2) = 5. B’s LST = 7 − 4 = 3. A’s LST = min(3−3=0, 5−3=2) = 0. Float: A:0, B:3-3=0, C:5-3=2, D:7-7=0. Critical path: A → B → D or A → C → D? Only A‑B‑D has all zero floats; C has 2 days float, so critical path is A‑B‑D, duration 12 days.
某项目包含活动：A（3天，无前驱），B（4天，在A之后），C（2天，在A之后），D（5天，在B和C之后）。画出网络图，进行正反向传递，并找出关键路径。EST：A=0，B=3，C=3，D=max(3+4, 3+2)=7。项目工期 = 7+5=12天。LST：D=7，C=7-2=5，B=7-4=3，A的LST=min(3-3=0, 5-3=2)=0。浮动时间：A:0，B:3-3=0，C:5-3=2，D:7-7=0。关键路径：A→B→D（C有2天浮动），关键活动为A、B、D，总工期12天。
12. Summary and Exam Tips | 总结与应试技巧
Always start by listing all activities with their durations and immediate predecessors. Sketch the network neatly using pencil, leaving space for EST and LST. Use forward pass to fill ESTs, then backward pass for LSTs. Compute float = LST − EST; mark critical path where float is zero. In exam questions, show all working clearly—marks are awarded for correct EST/LST values and identifying the critical path, not just the final answer. Practice with past papers to become fluent in reading precedence tables and handling dummy activities.
始终先列出所有活动及其持续时间和紧前活动。使用铅笔清晰地画出网络草图，留出填写EST和LST 的位置。用正向传递填写EST，再用反向传递填写LST。计算浮动时间 = LST − EST；标记浮动为零的关键路径。在考试中，要清晰展示所有计算过程——得分点不仅在于最终答案，还在于正确的EST/LST值和关键路径的识别。多练习历年真题，以熟练阅读前驱表和处理虚拟活动。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导