Question 1

Given the information:

Activity
A
B
C
D
E
F
Immediate Predecessors A
A
B
D
Optimistic Time
4
2
5
1
1
2
Most likely Time
5
4
5
2
2
4
Pesimistic time
6
6
5
9
3
18
construct network based on AOA and compute project completion time

G
D,E
7
9
11

H
C,F,G
2
3
4

Question 2
Given the network
C(8)
A(5)

I(7)
D(5)

B(6)

G(2)

E(4)

H(3)

J(4)

F(3)
a. compute the project completion time dan determine the critical path
b. what will happen if B cannot be finished in day 6 but it can be finished day 9
c. how long delay can be done for F so that project completion time will not change

Question 3
Given the activities and their relation :
Activity No.
Activity
1
A
2
B
3
C
4
D

Duration
3
6
5
5

Constrain
FF(1-2)=7
FS(2-3)=4
SF(2-4)=12
FS(3-4)=2
FS(2-5)=2
SS(4-5)=4
SF(3-6)=13
FS(5-6)=2

By Precedence Diagram Method, determine critical part and the completion time

I
F,G
3
4
11