Problem:
Refer to the information provided by the following table. Draw the network, compute slacks, determine the critical path(s) and the duration of the project.
|
Activity
|
Time (day)
|
|
Start Node
|
End Node
|
|
1
|
2
|
3
|
|
1
|
3
|
6
|
|
1
|
4
|
2
|
|
2
|
5
|
7
|
|
2
|
6
|
0
|
|
3
|
6
|
2
|
|
4
|
6
|
4
|
|
5
|
6
|
9
|
|
5
|
8
|
4
|
|
6
|
7
|
8
|
|
7
|
9
|
3
|
|
8
|
10
|
1
|
|
9
|
10
|
5
|
Equation: Slack = LF (latest finish) – EF (earliest finish)