题目
Problem
| Activity | Immediately preceding activities |
|---|---|
| A | – |
| B | – |
| C | A, B |
| D | A, B |
| E | B |
| F | C, D, E |
| G | F |
| H | B |
| I | F |
| J | F |
| K | G |
| L | G, H, I, J |
| M | G, I |
(a) Draw the activity network described in the precedence table, using activity on arc and the minimum number of dummies.
(5)
(b) Given that
- the activity network contains only one critical path
- activity E is on this critical path
state
(i) which activities could never be critical,
(ii) which activities must be critical.
(2)
题目中文翻译
| 活动 | 紧前活动 |
|---|---|
| A | – |
| B | – |
| C | A, B |
| D | A, B |
| E | B |
| F | C, D, E |
| G | F |
| H | B |
| I | F |
| J | F |
| K | G |
| L | G, H, I, J |
| M | G, I |
(a) 使用弧表示活动和最少数量的虚活动，画出优先级表中描述的活动网络。
(b) 已知
- 活动网络只有一条关键路径
- 活动 E 在此关键路径上
说明
(i) 哪些活动永远不可能是关键活动，
(ii) 哪些活动必须是关键活动。