MIT OpenCourseWare

[Link]

1.133 [Link]. Concepts of Engineering Practice

Fall 2007

For information about citing these materials or our Terms of Use, visit: [Link]
PROJECT MANAGEMENT 1

Dr. Chu E. Ho
ARUP

October 1 2007
 Some Observations from
Chase an Engineer Reports
What a Project Manager is most concerned with:-

Financial Issues
a. Engineering Design
b. Construction Scheduling
c. Control of Revenue Flow

“Engineers don’t make good financial

decisions”
“Scheduling is very important”
“The faster you finish, the more you save on fixed
costs and interests”

Fixed Costs
- Salary
- Overheads : Property
Office Rental
Equipment
Utilities
Variable Costs
- Bank Loans
- Professional Liability Insurance
- Performance Bond
- Payment Bond
 Activities – Logical Sequence
1. Instrumentation
2. Slurry wall installation
3. Jet grouting
4. Foundation installation
5. King posts and decking erection
6a. Excavation
6b. Strut installation + preloading
6a. Excavation
6b. Strut installation + preloading
7a. Cutting off pileheads
7b. Casting Pilecaps
7c. Casting base slab
8. Casting columns + intermediate floor slabs
8. Casting columns + intermediate floor slabs
9. Casting ground floor slab
 NETWORK SCHEDULING
Activity Network
A graphical representation describing connections between all
activities in a project

Activity Path
A continuous string of activities within the network from
beginning to end

Critical Path
The activity path with the longest duration, in which any delay
of one activity causes a similar delay to the entire project
completion
 ACTIVITY RELATIONSHIPS

Finish-Start FS = Δ Activity j may start Δ units of

time after finishing activity i

Normal FS = 0 Activity j may start immediately

after finishing activity i

Start-Start SS = Δ Activity j may start Δ units of

time after starting activity i

Finish-Finish FF = Δ Activity j may finish Δ units of

time after finishing activity i
 TIME TO START/FINISH

Activity Duration di The estimated duration

estimated duration of each activity

Earliest Start ESi The earliest time that activity i may start

Earliest Finish EFi The earliest time that activity i may finish

EFi = ESi + di

Latest Start LSi The latest time that activity i may start

Latest Finish LFi The latest time that activity i may finish

LSi = LFi - di
FLOAT TIME
Total Float tfi The total time that activity i may be
postponed without delaying project
completion

tfi = LSi - ESi or LFi - EFi

Free Float ffi The maximum time that activity i may

be postponed without delaying the
earliest start (ESj) or earliest finish (EFj)
of any following activity j
 ACTIVITY SYMBOLS

Activity i Activity j

ESi EFi ESj EFj

di dj
Δ
LSi LFi LSj LFj

tf i CODEi ff i tf j CODEj ff j

Type of Relationship
( FS, SS or FF)
8 STEPS FOR NETWORK
ANALYSIS
1. List all the activities
2. Assign duration for each activity
3. Set up Network Diagram
4. Carry out Forward Calculations for ES
and EF
5. Determine Project Completion Time
6. Carry out Backward Calculations for LS
and LF
7. Determine Float available tf and ff
8. Identify Critical Path(s)
 Schedule computation
Earliest Start (ESj) and Earliest Finish (EFj)
of the subsequent activity j

1. Calculate all possible ES times for activity j:

FS relationship, ESj = EFi + Δ

SS relationship, ESj = ESi + Δ
FF relationship, ESj = {EFi + Δ} - dj

2. Select the latest time for ESj

3. Calculate EFj = ESj + dj

Latest Start (LSi) and Latest Finish (LFi)
of the previous activity i

1. Calculate all possible LF times for activity i:

FS relationship, LFi = LSj - Δ
SS relationship, LFi = {LSj - Δ} + di
FF relationship, LFi = LFj - Δ

2. Select the earliest time for LFi

3. Calculate LSi = LFi - di
CALCULATIONS FOR
FLOAT

TOTAL FLOAT
1. Need to know ES, EF, LS and LF for
activity i
2. Calculate tf for activity i

tfi = {LSi– ESi } or {LFi - EFi}

FREE FLOAT

1. Calculate all possible ff between

activity i and j:
FS relationship, ffi = {ESj - EFi} - Δ
SS relationship, ffi = {ESj - ESi} - Δ
FF relationship, ffi = {EFj - EFi} - Δ

2. Select the smallest time gap for ffi

Network
Scheduling

Example Analysis
Set up Network Diagram

FS = 2
FS = 0 5 1
FS = 0
3 8 H K
FS = 0 FS = 0
B D FS = 0
0 2 4 FS = 0
0 FF = 3 FF = 4 FS = 0
0 A FS = (-2) G OPEN
FS = 0 5 FS = 0 8
FS = (-3) FS = 0
C E 12
FF = 2
SS = 2 J
5
FS = 0
F
FF = 1

P1
Carry out Forward Computation for Earliest Start and Earliest Finish

FS = 2
FS = 0 5 1
FS = 0
2 3 5 5 8 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 4 FS = 0
0 FF = 3 FF = 4 FS = 0
0 A FS = (-2) G OPEN
FS = 0 5 FS = 0 8
FS = (-3) FS = 0
C E 12
FF = 2
SS = 2 J
5
FS = 0
F
FF = 1

P2
Carry out Forward Computation for Earliest Start and Earliest Finish

FS = 2
FS = 0 5 1
FS = 0
2 3 5 5 8 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 4 FS = 0
0 FF = 3 FF = 4 FS = 0
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8
FS = (-3) FS = 0
C E 12
FF = 2
SS = 2 J
5
FS = 0
F
FF = 1

P3
Carry out Forward Computation for Earliest Start and Earliest Finish

FS = 2
FS = 0 5 1
FS = 0
2 3 5 5 8 13 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 4 FS = 0
0 FF = 3 FF = 4 FS = 0
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
FS = (-3) FS = 0
C E 12
FF = 2
SS = 2 J
5
FS = 0
F
FF = 1

P4
Carry out Forward Computation for Earliest Start and Earliest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0
2 3 5 5 8 13 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 4 FS = 0
0 FF = 3 FF = 4 FS = 0
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
FS = (-3) FS = 0
C E 12
FF = 2
SS = 2 J
5
FS = 0
F
FF = 1

P5
Carry out Forward Computation for Earliest Start and Earliest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0
2 3 5 5 8 13 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0
0 FF = 3 FF = 4 FS = 0
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
FS = (-3) FS = 0
C E 13 12 25
FF = 2
SS = 2 J
5
FS = 0
F
FF = 1

P6
Carry out Forward Computation for Earliest Start and Earliest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0
2 3 5 5 8 13 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0
0 FF = 3 FF = 4 FS = 0
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
FS = (-3) FS = 0
C E 13 12 25
FF = 2
SS = 2 J
13 5 18
FS = 0
F
FF = 1

P7
Carry out Forward Computation for Earliest Start and Earliest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0
2 3 5 5 8 13 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0
0 FF = 3 FF = 4 FS = 0
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
FS = (-3) FS = 0
C E 13 12 25
FF = 2
SS = 2 J
13 5 18
FS = 0
F
FF = 1

17 2 19

P8
Carry out Forward Computation for Earliest Start and Earliest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0
2 3 5 5 8 13 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 FF = 3 FF = 4 FS = 0
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
FS = (-3) FS = 0
C E 13 12 25
FF = 2
SS = 2 J
13 5 18
FS = 0
F
FF = 1

17 2 19

P9
Carry out Backward Computation for Latest Start and Latest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 25
2 3 5 5 8 13 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 FF = 3 FF = 4 FS = 0 25 25 25
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
FS = (-3) FS = 0
C E 13 12 25
FF = 2 25
SS = 2 J
13 5 18
FS = 0
F
FF = 1

17 2 19
25
I

P10
Carry out Backward Computation for Latest Start and Latest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 24 25
2 3 5 5 8 13 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 FF = 3 FF = 4 FS = 0 21 25 25 25
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
FS = (-3) FS = 0
C E 13 12 25
FF = 2 13 25
SS = 2 J
13 5 18
FS = 0
F
FF = 1

17 2 19
23 25
I

P11
Carry out Backward Computation for Latest Start and Latest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 17 22 24 25
2 3 5 5 8 13 H K
FS = 0 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 FF = 3 FF = 4 FS = 0 21 25 25 25
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
FS = (-3) FS = 0
C E 13 12 25
FF = 2 13 25
SS = 2 J
13 5 18
19 24 FS = 0
F
FF = 1

17 2 19
23 25
I

P12
Carry out Backward Computation for Latest Start and Latest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 17 22 24 25
2 3 5 5 8 13 H K
FS = 0 9 17 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 FF = 3 FF = 4 FS = 0 21 25 25 25
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
8 16 FS = (-3) FS = 0
C E 13 12 25
FF = 2 13 25
SS = 2 J
13 5 18
19 24 FS = 0
F
FF = 1

17 2 19
23 25
I

P13
Carry out Backward Computation for Latest Start and Latest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 17 22 24 25
2 3 5 5 8 13 H K
FS = 0 9 17 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 FF = 3 FF = 4 FS = 0 21 25 25 25
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
3 8 8 16 FS = (-3) FS = 0
C E 13 12 25
FF = 2 13 25
SS = 2 J
13 5 18
19 24 FS = 0
F
FF = 1

17 2 19
23 25
I

P14
Carry out Backward Computation for Latest Start and Latest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 17 22 24 25
2 3 5 5 8 13 H K
FS = 0 2 5 9 17 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 FF = 3 FF = 4 FS = 0 21 25 25 25
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
3 8 8 16 FS = (-3) FS = 0
C E 13 12 25
FF = 2 13 25
SS = 2 J
13 5 18
19 24 FS = 0
F
FF = 1

12 2 19
23 25
I

P15
Carry out Backward Computation for Latest Start and Latest Finish

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 17 22 24 25
2 3 5 5 8 13 H K
FS = 0 2 5 9 17 FS = 0
B D FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 2 FF = 3 FF = 4 FS = 0 21 25 25 25
0 A FS = (-2) G OPEN
FS = 0 3 5 8 FS = 0 8 8 16
3 8 8 16 FS = (-3) FS = 0
C E 13 12 25
FF = 2 13 25
SS = 2 J
13 5 18
19 24 FS = 0
F
FF = 1

12 2 19
23 25
I

P16
Calculating Total Float

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 17 22 24 25
2 3 5 5 8 13 1 H 1 K
FS = 0 2 5 9 17 FS = 0
0 B 4 D FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 2 FF = 3 FF = 4 FS = 0 21 25 25 25
0 A FS = (-2) 7 G 0 OPEN
FS = 0 3 5 8 FS = 0 8 8 16
3 8 8 16 FS = (-3) FS = 0
0 C 0 E 13 12 25
FF = 2 13 25
SS = 2 0 J
13 5 18
19 24 FS = 0
6 F
FF = 1

17 2 19
23 25
6 I

P17
Calculating Free Float

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 17 22 24 25
2 3 5 5 8 13 1 H 0 1 K 1
FS = 0 2 5 9 17 FS = 0
0 B 0 4 D 1 FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 2 FF = 3 FF = 4 FS = 0 21 25 25 25
0 A 0 FS = (-2) 7 G 7 0 OPEN 0
FS = 0 3 5 8 FS = 0 8 8 16
3 8 8 16 FS = (-3) FS = 0
0 C 0 0 E 0 13 12 25
FF = 2 13 25
SS = 2 0 J 0
13 5 18
19 24 FS = 0
6 F 0
FF = 1

17 2 19
23 25
6 I 6

P18
Identify Critical Path

FS = 2
FS = 0 16 5 21 23 1 24
FS = 0 17 22 24 25
2 3 5 5 8 13 1 H 0 1 K 1
FS = 0 2 5 9 17 FS = 0
0 B 0 4 D 1 FS = 0
0 2 2 14 4 18 FS = 0 25 25
0 2 FF = 3 FF = 4 FS = 0 21 25 25 25
0 A 0 FS = (-2) 7 G 7 0 OPEN 0
FS = 0 3 5 8 FS = 0 8 8 16
3 8 8 16 FS = (-3) FS = 0
0 C 0 0 E 0 13 12 25
FF = 2 13 25
SS = 2 0 J 0
13 5 18
19 24 FS = 0
6 F 0
FF = 1

17 2 19
23 25
6 I 6

P19 Critical Path A-B-C-E-J