📚 Critical Path Analysis | 关键路径分析
Critical path analysis is a powerful project management tool used to plan, schedule, and control complex projects. It helps identify the sequence of essential tasks that directly impact the overall project duration, allowing managers to allocate resources efficiently and avoid delays.
关键路径分析是一种强大的项目管理工具，用于规划、调度和控制复杂项目。它有助于识别直接影响项目总工期的关键任务序列，使管理者能够高效分配资源并避免延误。
1. Fundamentals of Activity Networks | 活动网络基础
An activity network is a graphical representation of a project, showing the activities and their dependencies. In AQA Decision Mathematics, the activity-on-node (AON) representation is used, where each node represents an activity, and the arrows show precedence relationships.
活动网络是项目的图形化表示，展示各项活动及其依赖关系。在AQA决策数学中，采用节点表示活动（AON）的表示法，其中每个节点代表一项活动，箭头表示先后次序关系。
Each node is typically divided into sections containing the activity name or letter, its duration, the earliest start time (EST), and the latest start time (LST). A small example node might look like a rectangle split into quadrants.
每个节点通常划分为几个区域，分别包含活动名称或字母、持续时间、最早开始时间（EST）和最迟开始时间（LST）。一个简单的节点示例可以是一个分成四个象限的矩形。
2. Precedence Tables and Network Construction | 依赖关系表与网络构建
A precedence table lists each activity, its duration, and its immediate predecessors. From this table, we build the activity network by drawing nodes and connecting them with directed arcs according to the dependencies.
依赖关系表列出每项活动、持续时间及其紧前活动。根据该表，我们通过绘制节点并根据依赖关系用有向弧连接它们来构建活动网络。
When an activity has no predecessors, it starts from the source node or the leftmost position. When multiple activities have the same predecessors, they can be arranged vertically. You must always ensure there is a single start and a single end node; if needed, use dashed arrows (dummies) to maintain correct logic, though in AON dummies are less common than in activity-on-arc. However, sometimes dummy activities with zero duration are introduced when logic requires extra nodes.
当一项活动没有紧前活动时，它从源节点或最左侧的位置开始。当多个活动有相同的紧前活动时，它们可以垂直排列。必须始终确保存在单一的起始节点和单一的结束节点；如果需要，可以使用虚线箭头（虚工作）来维持正确的逻辑，不过在AON中虚工作比在箭线图（AOA）中少见。然而，当逻辑需要额外的节点时，有时会引入持续时间为零的虚活动。
3. Forward Pass: Earliest Start Times (EST) | 正向传递：最早开始时间
The forward pass calculates the earliest start time for each activity, beginning from the project start (time zero). The EST of an activity is the maximum of the earliest finish times (EFT) of all its immediate predecessors.
正向传递从项目开始（时间零点）计算每项活动的最早开始时间。一项活动的EST是其所有紧前活动的最早完成时间（EFT）的最大值。
The earliest finish time of an activity is obtained by adding its duration to its EST: EFT = EST + duration. For the very first activities, EST = 0.
活动的最早完成时间由其EST加上持续时间得到：EFT = EST + 持续时间。对于最前面的活动，EST = 0。
The forward pass proceeds from left to right across the network, and the project duration is the maximum EFT among all finishing activities.
正向传递从左到右遍历整个网络，项目工期是所有结束活动中最大的EFT。
4. Backward Pass: Latest Start Times (LST) | 反向传递：最迟开始时间
The backward pass begins at the end of the project, where the latest finish time (LFT) of all terminal activities is set equal to the project duration. We then move from right to left to calculate the latest start time for each activity.
反向传递从项目结束处开始，所有终点活动的最迟完成时间（LFT）设为与项目工期相等。然后我们从右向左移动，计算每项活动的最迟开始时间。
The latest start time is given by LST = LFT – duration. The LFT of an activity is the minimum of the LSTs of all its immediate successors. This ensures that the project can still finish on time if the activity starts no later than its LST.
最迟开始时间的计算公式为LST = LFT – 持续时间。一项活动的LFT是其所有紧后活动的LST中的最小值。这确保了如果活动不晚于其LST开始，项目仍能按时完成。
5. 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 (or equivalently LFT – EFT).
总时差是一项活动可以延迟而不影响整个项目工期的时间量。计算公式为：总时差 = LST – EST（或等价的LFT – EFT）。
A critical activity is an activity with zero total float. The critical path is the continuous chain of critical activities from start to finish. Any delay on a critical activity will delay the entire project by the same amount of time.
关键活动是指总时差为零的活动。关键路径是从开始到结束的关键活动组成的连续链。关键活动上的任何延迟都会使整个项目延迟相同的时间。
There may be more than one critical path in a project network. In such cases, extra care must be taken when rescheduling, as multiple paths can be affected simultaneously.
在一个项目网络中可能存在多条关键路径。在这种情况下，重新调度时需要格外小心，因为多条路径可能同时受到影响。
6. Interpreting Float Information | 解读时差信息
Activities with large total float can be delayed significantly without impacting the project deadline. These activities offer scheduling flexibility and can be used to level resources or accommodate unforeseen delays.
总时差较大的活动可以在不影响项目截止日期的情况下显著延迟。这些活动提供了调度灵活性，可用于平衡资源或应对不可预见的延误。
It is also useful to consider free float, which is the delay possible without affecting the earliest start of any succeeding activity. Free float = min(EST of successors) – EFT of current activity. This is particularly important when activities share resources.
考虑自由时差也很有用，它是指不影响任何后续活动最早开始的延迟量。自由时差 = min（后续活动的EST） – 当前活动的EFT。当活动共享资源时，这一点尤为重要。
7. Cascade Charts (Gantt Charts) | 级联图（甘特图）
A cascade chart, or Gantt chart, is a horizontal bar chart representing activities plotted against time. Each activity is drawn as a bar starting at its EST and ending at its EFT, with the total float shown as a dotted extension to the right.
级联图（或甘特图）是一种水平条形图，用时间轴表示活动。每项活动以条形绘制，从EST开始到EFT结束，总时差以右侧的虚线延长表示。
Critical activities have no dotted extension, making the critical path easily visible. The chart provides a clear visual schedule and shows when each activity can take place and how much slack is available.
关键活动没有虚线延长，从而使得关键路径一目了然。该图表提供了清晰的可视化进度表，显示每项活动可以发生的时间以及可用的松弛量。
8. Resource Histograms and Levelling | 资源直方图与平衡
When activities require resources (e.g., workers, machines), we can create a resource histogram by summing the resource needs for all activities occurring in each time unit, assuming activities start at their EST.
当活动需要资源（例如工人、机器）时，我们可以通过假设所有活动在各自的EST开始，对每个时间单位内发生的活动的资源需求求和，来创建资源直方图。
If the resource histogram shows peaks that exceed the available supply, we can use resource levelling. This involves delaying non-critical activities within their total float to smooth out the resource demand. The critical path must remain unchanged to preserve the project duration.
如果资源直方图显示出超过可用供给的峰值，我们可以使用资源平衡。这涉及在非关键活动的总时差范围内延迟它们，以平滑资源需求。关键路径必须保持不变，以保持项目工期不变。
9. Scheduling with Constraints | 约束条件下的调度
Sometimes activities are subject to additional constraints such as fixed start dates, limited resources, or required idle time. In such cases, we may need to adjust the start times of activities, respecting dependencies and the available float, and produce an updated schedule.
有时活动会受到额外约束，例如固定的开始日期、有限的资源或所需的空闲时间。在这种情况下，我们可能需要调整活动的开始时间，在遵守依赖关系和可用时差的前提下，生成更新的进度表。
A common exam task is to draw a new Gantt chart or resource histogram after a delay or after resource levelling. The key is to ensure that the new start times do not push any activity beyond its LST unless the project duration is allowed to extend.
常见的考试任务是，在延迟或资源平衡后绘制新的甘特图或资源直方图。关键在于确保新的开始时间不会将任何活动推到其LST之后，除非允许延长项目工期。
10. Common Pitfalls and Exam Tips | 常见错误与应试技巧
Error: Forgetting to use the maximum EFT when an activity has multiple predecessors. This leads to an incorrect EST and may hide the true critical path. Always check all incoming arcs.
常见错误：当一项活动有多个紧前活动时，忘记取最大的EFT。这会导致EST错误，并可能隐藏真正的关键路径。始终检查所有传入弧线。
Error: Confusing total float with free float. In float calculations, always use the formula specific to the question. Be explicit: total float = LST – EST; free float = min EST of successors – EFT.
常见错误：混淆总时差和自由时差。在计算时差时，务必使用题目指定的公式。要明确指出：总时差 = LST – EST；自由时差 = 后继活动的EST的最小值 – EFT。
When drawing nodes, clearly label EST, LST, duration, and activity ID. Keep your network tidy; a messy diagram can cause mistakes in the forward and backward passes.
绘制节点时，清楚标注EST、LST、持续时间和活动标识。保持网络整洁；杂乱的图形可能会导致正向和反向传递中的错误。
11. Summary of Key Formulas | 核心公式总结
To consolidate your understanding, remember the following essential equations used throughout critical path analysis:
为了巩固理解，请记住以下贯穿整个关键路径分析的基本方程：
EFT = EST + Duration
LST = LFT – Duration
Total Float = LST – EST = LFT – EFT
Free Float = Min(EST of successors) – EFT
Master these relationships and practice applying them to a wide range of precedence tables and resource scenarios. With consistent practice, you will be able to handle any critical path analysis question confidently in your AQA exam.
掌握这些关系，并练习将它们应用到各种依赖关系表和资源情景中。通过持续的练习，你将能够自信地应对AQA考试中任何关键路径分析问题。
Published by TutorHao | AQA Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导