📚 Critical Path Analysis in IGCSE AQA Mathematics | IGCSE AQA 数学：关键路径分析考点精讲
Critical Path Analysis (CPA) is a powerful decision‑making tool used to plan, schedule, and manage complex projects. In the IGCSE AQA Mathematics syllabus, CPA appears within the topic of networks and decision mathematics. Understanding how to construct activity‑on‑node diagrams, perform forward and backward passes, and identify the critical path is essential for answering exam questions efficiently and accurately.
关键路径分析（Critical Path Analysis，简称CPA）是一种强大的决策工具，用于规划、调度和管理复杂项目。在IGCSE AQA 数学课程大纲中，CPA 属于网络与决策数学专题。掌握如何构建节点表示法网络图、进行顺推与逆推计算、确定关键路径，是高效准确解答考试题目的关键。
1. Activity Networks and Precedence Tables | 活动网络与前导表
Every project in CPA begins with a list of activities and their dependencies, often given in a precedence table. An activity is a task that takes time, while a dependency shows which activities must be completed before another can start. In IGCSE AQA exams, you will either be given a precedence table and asked to draw the activity network, or be given a network and asked to complete the table.
CPA 中的每一个项目都从一份活动及其依赖关系的清单开始，通常以“前导表”形式给出。活动是需要花费时间的任务，依赖关系表示某些活动必须在另一活动开始之前完成。在 IGCSE AQA 考试中，你可能会拿到一张前导表并被要求画出活动网络，或者得到网络图并被要求补全前导表。
2. Activity‑on‑Node Representation | 节点表示法
IGCSE AQA uses the activity‑on‑node (AON) method exclusively. Each activity is represented by a node (a box), and arrows show the dependencies. The nodes are typically divided into sections to record: activity name or letter, duration, earliest start time (EST), earliest finish time (EFT), latest start time (LST), latest finish time (LFT), and total float.
IGCSE AQA 专门使用节点表示法（AON）。每项活动用一个节点（方框）表示，箭头表示依赖关系。节点通常被划分为若干区域，用来记录：活动名称或字母、持续时间、最早开始时间（EST）、最早完成时间（EFT）、最晚开始时间（LST）、最晚完成时间（LFT）以及总浮动时间。
3. Drawing the Network from a Precedence Table | 根据前导表绘制网络图
Start by identifying activities with no predecessors — these can begin immediately. Draw a start node if multiple activities begin together. Then place each subsequent activity, drawing arrows from its immediate predecessors. Avoid crossing arrows and ensure the layout flows from left to right. Always double‑check that every dependency is satisfied.
首先找出没有前导活动的活动——这些活动可以立即开始。如果多个活动同时开始，可以绘制一个起始节点。然后依次放置后续活动，从它的直接前导活动引出箭头。避免箭头交叉，确保整体布局从左到右排列。最后一定要检查每一条依赖关系是否都已满足。
4. Dummy Activities and Logical Dependencies | 虚活动与逻辑依赖
In some cases, two activities share some but not all of the same predecessors. A dummy activity (a dashed arrow) is used to show a dependency without representing a real task. Dummies have zero duration and are only used to maintain correct logic when activities have partial overlaps in dependencies.
在某些情况下，两项活动共享部分但并非全部相同的前导活动。此时会使用虚活动（虚线箭头）来表示依赖关系，而不代表真实任务。虚活动的持续时间为零，仅用于在依赖关系存在部分重叠时保持正确的逻辑结构。
5. Forward Pass: Earliest Start and Earliest Finish Times | 顺推：最早开始时间与最早完成时间
The forward pass calculates the earliest times. Begin at the start node with EST = 0. For each activity, EFT = EST + duration. When an activity has multiple predecessors, its EST equals the maximum EFT of all its predecessors. Continue this process until the end of the network; the maximum EFT in the final node is the overall project duration.
顺推用于计算最早时间。从起始节点开始，EST = 0。对于每项活动，EFT = EST + 持续时间。当某项活动有多个前导活动时，它的 EST 等于所有前导活动中最大的 EFT。继续此过程直到网络末端；最终节点中的最大 EFT 即为整个项目的工期。
6. Backward Pass: Latest Start and Latest Finish Times | 逆推：最晚开始时间与最晚完成时间
Begin the backward pass at the final node. Set the LFT of the last activity equal to the project duration (the maximum EFT). Then for each activity, LST = LFT − duration. When moving backwards, if an activity is a predecessor to several later activities, its LFT equals the minimum LST of those successors. Complete the backward pass for every node.
逆推从最终节点开始。将最后一项活动的 LFT 设为项目工期（即最大 EFT）。然后对每项活动，LST = LFT − 持续时间。向后推算时，如果某项活动是多个后继活动的前导，那么它的 LFT 等于这些后继活动中最小的 LST。为所有节点完成逆推计算。
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 = LST – EST = LFT – EFT
A critical activity is any activity with zero total float. These activities have no flexibility; if any critical activity is delayed, the entire project will be delayed by the same amount.
总浮动时间是指一项活动可以延迟而不影响整个项目工期的时长。其计算公式为：
总浮动时间 = LST – EST = LFT – EFT
关键活动是指总浮动时间为零的活动。这些活动没有任何弹性；若任何一项关键活动延误，整个项目就会延误相同的时间。
8. Identifying the Critical Path | 确定关键路径
The critical path is the continuous chain of critical activities from the start to the end of the network. There may be more than one critical path. In IGCSE AQA exams, you are usually required to state the critical path (e.g. A–C–F–H) and its length, which equals the minimum project completion time.
关键路径是从网络开始到结束的连续关键活动链。可能不止一条关键路径。在 IGCSE AQA 考试中，通常要求写出关键路径（例如 A–C–F–H）及其长度，长度等于最短项目完成时间。
9. Interpreting the Cascade (Gantt) Chart | 解读阶梯图（甘特图）
Sometimes an exam question will ask you to draw a cascade chart (a type of Gantt chart) from the activity network. Each activity is drawn as a horizontal bar starting at its EST whenever possible. Critical activities are drawn first in a solid block, while non‑critical activities are shown with a bar representing their duration and a dotted extension equal to their total float.
有时考试题目会要求你根据活动网络绘制阶梯图（一种甘特图）。每项活动都用一条水平条表示，尽可能从它的 EST 开始绘制。关键活动先用实心色块绘制，而非关键活动则用表示持续时间的横条加上等于其总浮动时间的虚线延伸来表示。
10. Resource Levelling and Scheduling Considerations | 资源均衡与调度考量
Exam questions may ask for a basic resource histogram or ask you to adjust the start times of non‑critical activities to smooth resource usage. The goal is to minimise peaks in labour or machinery while respecting the project deadline. Float allows activities to be shifted within their available window.
考题可能会要求绘制基本的资源直方图，或要求调整非关键活动的开始时间，使资源使用趋于均衡。目标是在遵守项目截止日期的前提下，尽可能减少人力或机械的需求高峰。浮动时间使活动可以在其允许的时间窗口内移动。
11. Common Pitfalls in IGCSE CPA Questions | IGCSE CPA 题目的常见陷阱
Students often misread the precedence table, missing activities that have more than one immediate predecessor. Others incorrectly calculate EST by taking the minimum instead of the maximum of predecessor EFTs. Careless arithmetic in the forward or backward pass can cascade into errors in float, critical path, and finishing time. Always work systematically and double‑check each calculation.
学生常会误读前导表，遗漏那些有多个直接前导的活动。另一些则在计算 EST 时，错误地取前导活动 EFT 的最小值而非最大值。顺推或逆推中的算术疏忽会连锁导致浮动时间、关键路径和完成时间的错误。始终系统性地进行运算，并反复检查每一步计算。
12. Exam Strategy and Worked Example Outline | 考试策略与例题框架
Typical IGCSE AQA questions are worth 6–10 marks. Allocate time to: (1) construct/complete the network, (2) perform forward and backward passes, (3) write the critical path and project duration, (4) answer a further interpretation or scheduling question. Show all working clearly in the nodes. Even if you make a mistake early, you can still gain method marks if your passes are consistent.
典型的 IGCSE AQA 题目分值为 6–10 分。时间分配建议： (1) 构建/补全网络图，(2) 执行顺推和逆推计算，(3) 写出关键路径与项目工期，(4) 回答进一步的解读或调度问题。在节点中清晰展示所有演算过程。即使早期出现错误，只要顺推逆推步骤正确且前后一致，仍可获得方法分。
Published by TutorHao | Decision Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导