Critical path analysis · 关键路径分析
| English | 中文 | Pinyin · 拼音 |
|---|---|---|
| critical path analysis/ˈkrɪtɪkl pæθ əˈnæləsɪs/ | 关键路径分析 | guān jiàn lù jìng fēn xī |
| network diagram/ˈnetwɜːk ˈdaɪəɡræm/ | 网络图 | wǎng luò tú |
| activity/ækˈtɪvɪti/ | 活动 | huó dòng |
| duration/djʊəˈreɪʃn/ | 工期 | gōng qī |
| nodes/nəʊdz/ | 节点 | jié diǎn |
| critical path/ˈkrɪtɪkl pæθ/ | 关键路径 | guān jiàn lù jìng |
| float/fləʊt/ | 浮动时间 | fú dòng shí jiān |
The schedule that can't slip
- A big project — a building, a product launch — has dozens of tasks, some at once, some in sequence.
- Critical path analysis 关键路径分析 (CPA) finds the fastest way through and the tasks that must not be late.
不能滑动的时间表
- 一个大项目——一座建筑、一次产品发布——有数十个任务,有些同时,有些按顺序。
- 关键路径分析(critical path analysis,CPA)找出最快的通过方式以及那些绝不能迟到的任务。
A diagram of activities, durations and dependencies used in CPA is a ______ diagram. · CPA 中使用的一张活动、持续时间和依赖关系的图是一张______图。
The network diagram is the basis of critical path analysis. · 网络图是关键路径分析的基础。
Networks of activities
- A network diagram 网络图 shows each activity 活动, its duration 工期, and what must finish before it can start.
- Nodes 节点 mark events (start/finish points); arrows are the activities.
The critical path 关键路径 is the longest route through the network — it sets the minimum project time.
活动的网络
- 一张网络图(network diagram)显示每个活动、它的持续时间,以及在它能开始之前什么必须完成。
- 节点(nodes)标记事件(开始/结束点);箭头(arrows)是活动。
关键路径是穿过网络的最长路线——它设定最短的项目时间。
Critical path analysis · 关键路径分析
CPA finds the sequence of tasks that decides the shortest time a project can take. · CPA 找出决定一个项目能花的最短时间的任务序列。
The critical path is the: · 关键路径是:
The longest route determines the minimum completion time. · 最长路线决定最短完成时间。
Float is: · 浮动时间是:
Float is slack time on non-critical activities. · 浮动时间是非关键活动上的松弛时间。
The critical path and float 浮动时间
- The critical path is the sequence of activities with no spare time — any delay delays the whole project.
- Float is the spare time a non-critical activity has before it would hold things up.
Worked example. If path B-D-E takes 4 + 5 + 2 = 11 days and every other route is shorter, then 11 days is the minimum project time, and B, D and E are critical — no float.
A critical path network with the critical path of zero-float activities highlighted
关键路径与浮动时间
- 关键路径(critical path)是没有空余时间的活动序列——任何延误都延误整个项目。
- 浮动时间(float)是一个非关键活动在它会拖延事情之前拥有的空余时间。
例题。 如果路径 B-D-E 花 4 + 5 + 2 = 11 天且每条其他路线更短,那么 11 天是最短的项目时间,而 B、D 和 E 是关键的——没有浮动时间。
一个关键路径网络,突出显示零浮动活动的关键路径
Find the critical path · 找出关键路径
Drag the durations — the network rolls forward and back, the floats update, and the critical path jumps to whichever route is longest. · 拖动各活动的工期 — 网络先正推再倒推,浮动时间随之更新,关键路径会跳到更长的那条路线上。
A critical path runs through activities of 3, 5 and 4 days. What is the minimum project duration (days)? · 一个关键路径穿过 3、5 和 4 天的活动。最短项目持续时间(天)是多少?
3 + 5 + 4 = 12 days along the critical path. · 沿关键路径 3 + 5 + 4 = 12 天。
A delay to an activity on the critical path delays the whole project. · 关键路径上一个活动的延误延误整个项目。
Critical activities have no float to absorb a delay. · 关键活动没有浮动时间来吸收一个延误。
Why CPA helps
- It reveals the shortest possible completion time and which tasks to watch.
- It helps schedule resources and run activities in parallel to save time.
A delay on the critical path delays everything. Non-critical tasks have float to absorb slips; critical ones do not. Managers must protect the critical path above all.
为什么 CPA 有帮助
- 它揭示最短可能的完成时间以及要关注哪些任务。
- 它帮助调度资源并并行运行活动以节省时间。
关键路径上的一个延误延误一切。 非关键任务有浮动时间来吸收滑动;关键的没有。经理必须首先保护关键路径。
You've got it
- a network diagram shows activities, durations and dependencies
- the critical path is the longest route — it sets the minimum project time
- float is spare time on non-critical tasks; a delay on the critical path delays the project
你掌握了
- 一张网络图显示活动、持续时间和依赖关系
- 关键路径是最长路线——它设定最短项目时间
- 浮动时间是非关键任务上的空余时间;关键路径上的一个延误延误项目