Tutorial Presentation-Networks-crashing
Tutorial Presentation-Networks-crashing
Question 1
Activity code Description Predecessor Duration
A Excavate stage 1 ‐ 4
B Order and deliver steelwork ‐ 7
C Formwork stage 1 A 4
D Excavate stage 2 A 5
E Concrete stage 1 C 8
F Formwork stage 2 C,D 2
G Backfill stage 1 E 3
H Concrete stage 2 E,F 8
I Erect steelwork B,H 10
J Backfill stage 2 G,H 5
From the above shown network data:
•Draw a precedence network diagram;
•Calculate the starting and finishing times for each activity;
•Calculate total float for each activity;
•Identify the critical path.
•What will happen to the project if the duration of activity g extends 5 days?
•Draw a gantt chart based on early‐start schedule.
Maged El‐Hawary
ES EF 4 8 8 16 16 19 24 29
Start (D) C (4) E (8) G (3) J (5)
LS LF 4 8 8 16 26 29 29 34
0 4 14 8 16 26
D : Activity Duration A (4)
34 34
ES: Early Start 0 4 Finish
EF: Early Finish 9 4 4 9 9 11 16 24 34 34
LS: Late Start D (5) F (2) H (8)
0 0 9 14 14 16 16 24 24 34
LF: Late Finish
Start 29 24 I (10)
0 0 24 34
0 7
B (7)
17 24
Activity code Description Predecessor Duration
A Excavate stage 1 ‐ 4
B Order and deliver steelwork ‐ 7
C Formwork stage 1 A 4
D Excavate stage 2 A 5
E Concrete stage 1 C 8
F Formwork stage 2 C,D 2
G Backfill stage 1 E 3
H Concrete stage 2 E,F 8
1
12/11/2017
Calculate total float for each activity ES EF
Start (D)
4 8 24 29 LS LF
8 16 16 19
C (4) E (8) G (3) J (5)
4 8 8 16 26 29 29 34
0 4 0 0 10 5
A (4) 34 34
0 4 Finish
0 4 9 9 11 16 24 34 34
D (5) F (2) H (8)
0 0 9 14 14 16 16 24 24 34
Start 5 5 0 I (10)
0 0 24 34
0
0 7
B (7)
17 24
17
Identify the critical path 4 8 8 16
C (4) E (8)
4 8 8 16
0 4 0 0
A (4) 34 34
0 4 Finish
0 16 24 34 34
H (8)
0 0 16 24 24 34
Start 0 I (10)
0 0 Maged El‐Hawary
24 34
0
ES EF
What will happen to the project if the duration of activity “G” extends by 5 days?
Start (D)
4 8 8 16 16 19 24 29 LS LF
C (4) E (8) G (3) J (5)
4 8 8 16 26 29 29 34
0 4 0 0 10 5
A (4) 34 34
0 4 Finish
0 4 9 9 11 16 24 34 34
D (5) F (2) H (8)
0 0 9 14 14 16 16 24 24 34
Start 5 5 0 I (10)
0 0 24 34
0
0 7
B (7)
17 24 0 0 5 5
17 4 8 8 16 16 24 24 29
C (4) E (8) G (8) J (5)
0 4 8 8 16 21 29 29 34
0 4
A (4) 34 34
0 4 5 5 0
4 9 9 11
Finish
16 24 34 34
D (5) F (2) H (8) 0
0 0 9 14 14 16 16 24 24 34
Start I (10)
0 0 24 34
17
0 7
B (7) Maged El‐Hawary Critical Path will not change
17 24
2
12/11/2017
Gantt Chart
Maged El‐Hawary
Question 2
Task Identifier Description Predecessor Duration
A Task 1 ‐ 5
B Task 2 ‐ 6
C Task 3 A 2
D Task 4 A, B 5
E Task 5 B 4
F Task 6 C, D, E 4
Using the information from the precedence table, construct a network diagram and answer the following
questions:
a) What is the project duration
b) What is the critical path?
c) How much float is in Task b? d? e?
Maged El‐Hawary
3
12/11/2017
What is the project Duration? ES EF
Start (D)
LS LF
D : Activity Duration
5 7
C (2) ES: Early Start
EF: Early Finish
0 5 LS: Late Start
A (5) LF: Late Finish
6 11 11 15
D (5) F (4)
0 0 15 15
Start Finish
0 6 6 10
B (6) E (4)
Activity code Description Predecessor Duration
A Excavate stage 1 ‐ 5
B Order and deliver steelwork ‐ 6
C Formwork stage 1 A 2
D Excavate stage 2 A, B 5
E Concrete stage 1 B 4
F Formwork stage 2 C,D,E 4
Maged El‐Hawary
What is the Critical Path? ES EF
5 7 Start (D)
C (2) LS LF
9 11
0 5 4
A (5)
0 6
1 9 6 6 11 11 15
D (5) F (4)
0 0 6 11 11 15 15 15
Start 0 0 Finish
0 0 15 15
0 6 6 10
B (6) E (4)
0 6 7 11
06 7 1
Critical path
6 11 11 15
D (5) F (4)
0 0 6 11 11 15 15 15
Start 0 0 Finish
0 0 15 15
0 6
B (6)
0 6
0 Maged El‐Hawary
4
12/11/2017
Example:
D (4)
0
W “Waiting for
A (3) B (5) E (3) Hardening of I (2)
conc” (7)
0 0 5
C (1) F (5)
9 5
Finish Date
0 3 3 8 8 11 11 18 18 20
A (3) B (5) E (3) W (7) I (2)
0 3 3 8 8 11 11 18 18 20
0 0 0 0
ES EF
3 4 8 13 Start (D)
C (1) F (5) LS LF
7 8 13 18
D : Activity Duration
4 5
ES: Early Start
EF: Early Finish
Critical path
LS: Late Start
LF: Late Finish
0 3 3 8 8 11 11 18 18 20
A (3) B (5) E (3) W (7) I (2)
0 3 3 8 8 11 11 18 18 20
0 0 0 0
Maged El‐Hawary
5
12/11/2017
Finish Date
ES EF
All days are working days except Fridays.
Start (D)
3 8
LS LF
D (4) All durations are “working-days” except “waiting for hardening of concrete”.
4 9 Waiting for Hardening of conc.
0 3 3 9 9 12 12 21 21 23
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 12 21 21 23
0 0 0 0
3 4 9 15
C (1) F (5)
8 9 15 21
5 6
Critical path
0 3 3 9 9 12 12 21 21 23
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 12 21 21 23
0 0 0 0
Maged El‐Hawary
Finish Date
1
19 20
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 12 13 1 0
3 4 9 15
C (1) F (5)
8 9 15 19
4 4
Maged El‐Hawary
6
12/11/2017
Finish Date
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 1 0
3 4 9 15
C (1) F (5)
8 9 15 19
4 4
Critical path
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 1 0
Maged El‐Hawary
Critical path
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 1 0
• Is “W” on the critical path?
• Can the Critical path be disconnected or has to be continuous?
• “Critical Path” & “Total Float”
• “Critical Path” Vs “Longest Path”
Maged El‐Hawary
7
12/11/2017
From Primavera
Maged El‐Hawary
From Primavera
Maged El‐Hawary
8
12/11/2017
From Primavera
Schedule Log File
Maged El‐Hawary
From Primavera
Schedule Log File
Maged El‐Hawary
9
12/11/2017
From Primavera
Schedule Log File
Maged El‐Hawary
From Primavera
Schedule Log File
Maged El‐Hawary
10
12/11/2017
ES EF
All durations are “working-days” except “waiting for hardening of concrete”.
Start (D) 04‐Nov 08‐Nov
LS LF D (4)
05‐Nov 09‐Nov Waiting for Hardening of conc.
01‐Nov 03‐Nov 04‐Nov 09‐Nov 10‐Nov 12‐Nov 13‐Nov 19‐Nov 21‐Nov 22‐Nov
A (3) B (5) E (3) W (7) I (2)
01‐Nov 03‐Nov 04‐Nov 09‐Nov 10‐Nov 12‐Nov 14‐Nov 20‐Nov 21‐Nov 22‐Nov
0 0 1 0
Maged El‐Hawary
Scenario 1: C is delayed by 1 day, I is delayed by 1 day ES EF
Start (D)
LS LF
3 8
D (4)
4 9 Waiting for Hardening of conc.
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 1 0
3 4 9 15
C (1) F (5)
8 9 15 19
4 4
Critical path
0 3 3 9 9 12 20 22
A (3) B (5) E (3) I (2)
0 3 3 9 9 12 20 22
0 0 0
Maged El‐Hawary
11
12/11/2017
Scenario 1: C is delayed by 1 day, I is delayed by 1 day ES EF
Start (D)
LS LF
3 8
D (4)
4 9 Waiting for Hardening of conc.
0 3 3 9 9 12 12 19 20 23
A (3) B (5) E (3) W (7) I (23)
0 3 3 9 9 12 13 20 20 23
0 0 1 0
3 5 9 15
C (12) F (5)
7 9 14 19
4 4
Critical path
0 3 3 9 9 12 20 23
A (3) B (5) E (3) I (23)
0 3 3 9 9 12 20 23
0 0 0
Maged El‐Hawary
Scenario 3: F is delayed by 3 days ES EF
Start (D)
LS LF
3 8
D (4)
4 9 Waiting for Hardening of conc.
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 1 0
3 4 9 15
C (1) F (5)
8 9 15 19
4 4
Critical path
0 3 3 9 9 12 20 22
A (3) B (5) E (3) I (2)
0 3 3 9 9 12 20 22
0 0 0
Maged El‐Hawary
12
12/11/2017
Scenario 3: F is delayed by 3 days ES EF
Start (D)
LS LF
3 8
D (4)
4 9 Waiting for Hardening of conc.
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 1 0
3 4 9 18
C (1) F (58)
8 9 15 19
4 1
Critical path
0 3 3 9 9 12 20 22
A (3) B (5) E (3) I (2)
0 3 3 9 9 12 20 22
0 0 0
Maged El‐Hawary
Finish Date
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 1 0
3 4 9 15
C (1) F (5)
8 9 15 19
4 4
Critical path
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 1 0
Maged El‐Hawary
13
12/11/2017
Scenario 3: F is delayed by 7 days ES EF
Start (D)
LS LF
3 8
D (4)
4 9 Waiting for Hardening of conc.
0 3 3 9 9 12 12 19 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 13 20 20 22
0 0 1 0
3 4 9 15
C (1) F (5)
8 9 15 19
4 4
Critical path
0 3 3 9 9 12 12 20 20 22
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 9 12 12 20 20 22
0 0 0 0
Maged El‐Hawary
Scenario 3: F is delayed by 7 days ES EF
Start (D)
LS LF
3 8
D (4)
7 11 Waiting for Hardening of conc.
0 3 3 9 9 12 12 19 23 25
A (3) B (5) E (3) W (7) I (2)
0 3 3 9 11 15 15 23 23 25
0 0 2 4 0
3 4 9 23
C (1) F (512)
8 9 9 23
4 0
Critical path
0 3 3 9 23 25
A (3) B (5) I (2)
0 3 3 9 23 25
0 0 0
9 23
F (512)
9 12
9 23 Maged El‐Hawary
0
14
12/11/2017
Crashing Example:
The network and durations given below shows the normal schedule for a project. You can decrease (crash) the durations at an
additional expense. The Table given below summarizes the time-cost information for the activities. The owner wants you to
you to finish the project in 110 days. Find the minimum possible cost for the project if you want to finish it on 110 days.
(Assume that for each activity there is a single linear, continuous function between the crash duration and normal duration
points).
Solution:
Path 1
Path 2
Path 3
Maged El‐Hawary
15
12/11/2017
Solution:
STEP1:
Calculate Crash Cost Slope for each activity: Normal duration / Crash Duration / Normal
SA days days Cost Crash Cost
Activity (ND) (CD) (NC) (CC)
A 120 100 12000 14000
SA
= $100 / day B 20 15 1800 2800
SB = $200 / day C 40 30 16000 22000
D 30 20 1400 2000
SC = $600 / day
E 50 40 3600 4800
SD = $60 / day F 60 45 13500 18000
SE = $120 / day
SF = $300 / day
Maged El‐Hawary
Cost Vs. Duration
• Dur.= 120
A • Cost=
• Dur.= 130
B‐F‐E • Cost=
• Dur.= 140
B‐C‐D‐E • Cost=
Maged El‐Hawary
16
12/11/2017
Solution:
STEP 2:
Choose an activity on the critical path and has the least cost-slope SD ($60 / Day)
A maximum of 10 days can be reduced if we reduce “D” from 30 days to 20 days
Overall duration became 130 days
Multiple critical paths (B‐F‐E and B‐C‐D‐E) generated.
Total project cost at this duration is the “normal cost” plus the cost of crashing the activity D by 10 days
Total project cost = 48300 + (60 * 10) = $48900.
Maged El‐Hawary
Solution:
STEP 3:
Choose next activity to be crashed from the critical path SE (Least cost-slope per day $120 /day)
A maximum of 10 days can be reduced if we reduce “E” from 50 days to 40 days
Maged El‐Hawary
17
12/11/2017
Solution:
STEP 4:
To crash the overall project duration, reducing durations of multiple activities in the different critical paths has to take place.
Activity A + Activity B = $ 300 /day
Activity A + Activity C + Activity F = $1000 / day
Activity A + Activity B shall have the least combined cost-slope
A maximum of 5 days can be reduced if we reduce “B” from 20 days to 15 days
Accordingly, 5 days can be reduced from “A” to go from 120 to 115 days.
Solution:
FINAL STEP :
To crash the overall project duration, reducing durations of “A”, “C” & “F” simultaneously has to take place.
Accordingly, 5 days can be reduced from “A”, “C” & “F” to go from 115 to 110 days.
Activity A + Activity C + Activity F = $1000 / day
Maged El‐Hawary
18
12/11/2017
Schedule Crashing
• How to chose crashing path
• Lowest cost
• Critical
• Common bet. 2 paths
• Is there a limitation of crashing? Why?
Maged El‐Hawary
Crashing Curve
58000
57000
56000
55000
54000
53000
Cost
52000
51000
50000
49000
48000
47000
100 105 110 115 120 125 130 135 140 145
Duration
Maged El‐Hawary
19
12/11/2017
Schedule Relaxation
• Solve the same example but Backward Path
Maged El‐Hawary
Schedule relaxation
• How to chose relaxation path
• How to relax/Why
• Resource leveling
Maged El‐Hawary
20