Scribd
Upload
4K views12 pages

Example 1: Activity Immediate Predecessor/s Time (Weeks) Step 1: Build The Network Diagram

The document provides information on a project including its activities, durations, costs and predecessors. It includes two examples: 1. A project with 8 activities and a critical path of B-->C-->E-->F-->H with a total duration of 45 weeks. 2. A project with 7 activities where the normal duration is 28 days but can be crashed to 20 days at a cost of $3,120 compared to the normal cost of $1,820. The document also provides information on how to develop a network diagram and calculate the expected completion time using the three-point estimation method.

Uploaded by

Kim Patrick Victoria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
4K views12 pages

Example 1: Activity Immediate Predecessor/s Time (Weeks) Step 1: Build The Network Diagram

The document provides information on a project including its activities, durations, costs and predecessors. It includes two examples: 1. A project with 8 activities and a critical path of B-->C-->E-->F-->H with a total duration of 45 weeks. 2. A project with 7 activities where the normal duration is 28 days but can be crashed to 20 days at a cost of $3,120 compared to the normal cost of $1,820. The document also provides information on how to develop a network diagram and calculate the expected completion time using the three-point estimation method.

Uploaded by

Kim Patrick Victoria
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 12

EXAMPLE 1

Activity Immediate Predecessor/s Time (weeks) Step 1: Build the Network Diagram

A - 6 6
B - 8 A
C A,B 10
D C 5 10
E C 6 Start C
F D,E 14
G E 13 8
H F,G 7 B

Q1 Draw the project netwrok & find the critical path


Q2 Determine the expected competion time

Forward Pass
Se = maximum Fe of Predecessor/s or 0 if none
Fe = Se + t

Activity Early Start, Se Early Finish, Fe

A Se = 0 Fe =
B Se = 0 Fe =
C Se = 6&8 8 Fe =
D Se = 18 18 Fe =
E Se = 18 18 Fe =
F Se = 23 & 24 24 Fe =
G Se = 24 24 Fe =
H Se = 37 & 38 38 Fe =

Backward Pass
Late Finish FL = minimum SL of successir/s or maximum Fe if none
Late Start SL = FL - t

Activity LATE FINISH, FL LATE START, SL


H FL = 45 SL =
G FL = 38 SL =
F FL = 38 SL =
E FL = 24 & 25 24 SL =
D FL = 24 SL =
C FL = 18 & 19 18 SL =
B FL = 8 SL =
A FL = 8 SL =

SLACK = LF - FE

A 8 6 2 Relax
B 8 8 0
C 18 18 0
D 24 23 1 Relax
E 24 24 0
F 38 38 0
G 38 37 1 Relax
H 45 45 0

CRITICAL PATH: B --> C --> E --> F --> H


TIME TO COMPLETE THE PROJECT = 8 + 10 + 6 + 14 + 7 = 45
Diagram

5
D

14
F

6 7
E H

13
G

Early Finish, Fe

0+6 6
0+8 8
8 + 10 18
18 + 5 23
18 +6 24
24 + 14 38
24 + 13 37
38 + 7 45

LATE START, SL
45-7 38
38-13 25
38-14 24
24-6 18
24-5 19
18-10 8
8-8 0
8-6 2
EXAMPLE 2
Immediate Normal Crash
Activity Time (Days) Crash Cost
Predecessor/s Cost Duration
A - 5 100 4 200
B - 4 120 3 150
C A 12 400 8 1000
D B 8 300 6 700
E B 10 200 8 300
F C 7 400 5 900
G D, E, f 4 300 3 400
1820
A C F

Start
D G

Q1 Construct a project network and determine the critical path


Q2 Find the cost of the normal duration
Q3 Find the shortest completion time possible and its crash cost

COST PER DAY


Days Cost diff Cost per day
A 1 100 100
C 4 600 150
F 2 500 250
G 1 100 100
8 1300
28 days --> 20 days

1820 --> 3120

Scenario 28 days --> 25 days

A 1 100
G 1 100
C 1 150
25 days 2170
A-->c-->f-->g

A 0 5 C 5 17
5 0 5 12 5 17 F 17 24
0 0 0 0 7 17 24
=5 + 12+ 7+ 4 = 28 0 0
D 4 12
8 16 24
12 12
B 0 4 G 24 28
4 10 14 4 24 28
10 10 0 0
E 4 14
10 14 24
10 10
Most Pessimisti
Optimistic
Probable c
Immediate
Activity a m b t σ^2
Predecessor/s
A - 10 15 26 16 7.11 A 0 16
B - 8 10 18 11 2.78 16 0 16
C A,B 4 5 6 5 0.11 0
D - 10 12 14 12 0.44
E D 1 2 3 2 0.11
F D 1 3 11 4 2.78 B 0 11
G C, E 1 2 3 2 0.11 11 5 16
H F, G 1 2 3 2 0.11
I F 3 4 5 4 0.11
J H, I 1 2 3 2 0.11
D 0 12
Q1 Develop a project network and determine expected project completion 12 5 17
Q2 What is the probability that project completion time will meet
the 30-week deadline?

t = (a + 4m + b) / 6
σ^2 = ((b - a) / 6)^2

σ^2 = 7.11 + 0.11 + 0.11 + 0.11 + 0.11


7.55
σ 2.75

solve for the value of z-test


z = T - E(t) / = 30 - 27 / 2.75
σ 1.09
value on table 0.3621
0.5 FIX
0.8621 86.21 %
A -> C -> G -> H ->J
=16+5+2+2+2\= 27
C 16 21
5 16 21
0 G 21 23
2 21 23
E 12 14 0
2 19 21
H 23 25
2 23 25
0
J 25 27
F 12 16 2 25 27
4 17 21 0

I 16 20
4 21 25

You might also like