PROJECT SCHEDULING

Dr. Mudathir Sulieman Mohamed Ali

 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 dont 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
Basement Construction
Instrumentation
Slurry wall installation
Jet grouting
Foundation installation
King posts and decking erection
Excavation
Strut installation + preloading
Excavation
Strut installation + preloading
Cutting off pileheads
Casting Pilecaps
Casting base slab
Casting columns + intermediate floor slabs
Casting columns + intermediate floor slabs
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 diTheestimateddurationofeachactivity

Earliest Start ESiTheearliesttimethatactivityimaystart

Earliest Finish EFiTheearliesttimethatactivityimayfinish

EFi= ESi + di

Latest Start ESiThelatesttimethatactivityimaystart

Latest Finish EFiThelatesttimethatactivityimayfinish

LSi= LFi - di
 FLOAT TIME
Total Float TFiThe 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

TFi CODEi FFi TFj CODEj FFj

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.CalculateallpossibleEStimesforactivityj:
FS relationship, ESj=EFi+
SS relationship,ESj=ESi+
FF relationship,ESj={EFi+}-dj

2.SelectthelatesttimeforESj

3.CalculateEFj=ESj+dj
Latest Start (LSi) and Latest Finish (LFi)
of the previous activity i

1.CalculateallpossibleLFtimesforactivityi:
FS relationship,LFi=LSj-
SS relationship,LFi={LSj-}+di

FF relationship,LFi=LFj-

2.SelecttheearliesttimeforLFi

3.CalculateLSi=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