This is the file of Construction management.

1. Planning and Project Network Techniques
Asst. Prof. Dr. Şevket C. BOSTANCI
1

2. Responsible person: The Project Manager
Objectives:
• forecasting the resource requirements of people, material and equipment
• forecasting the financial requirements
• providing a suitable control tool against which progress can be measured
• minimizing the unproductive time of both men and machine
• Finding the time required to complete the project (Total Project Time)
• Establishing the time for delivering materials
2

3. Planning Techniques
Most common and widely used techniques are:
1. Bar charts and Linked Bar Charts
2. Network Analysis (Arrow Diagram and Precedence
Diagram)
3. Line of Balance (for repetitive construction work)
3

4. • The most widely used and easiest to
understand planning tools are:
• “Bar Charts”
• typical bar chart example is shown in
Figure (see next slides).
4

5. Barchart or Gantt Chart
5

6. Resource Crosstab & Histogram
6

7. Cumulative Line Graph (‘S’ curve)
7

8. Bar Charts and
Linked Bar Charts
Fig. 5.1 – Typical bar chart
8

9. Bar Charts and
Linked Bar Charts
The effect of this increase on the other
activities can be more easily studied by
using:
“Linked Bar Charts”.
Example of a linked bar chart is shown in
Fig. 5.2.
9

10. Bar Charts and
Linked Bar Charts
• Fig. 5.2 – Typical Linked Bar Chart
10

11. Resource Crosstab & Histogram
11

12. Cumulative Line Graph (‘S’ curve)
12

13. Planning
• Logic
• Time
• Resources
13

14. Planning System
Planning techniques based on certain principles:
1. The plan should provide information in readily understood
form
2. The plan should be realistic
3. The plan should be flexible
4. The plan should serve as a basis for progress monitoring
and control
5. The program should be comprehensive
14

15. Planning System
• Explicit
• Intelligible
• Respond to change
• Capable of monitoring
• Management of resources
• Use for forecast
15

16. Pre-Planning
• The objective
• The activities to be
undertaken
• Labour availability
• Material availability
• Staff availability
• Plant availability
• Subcontracted activities
• Cost constraints
• Methods to be
employed
• Any risk considerations
16

17. Project Network Techniques
• Network Analysis
• Critical Path Analysis(Method) (CPA or CPM)
• Project Evaluation Review Technique (PERT)
17

18. Two Types of Project Network
Techniques
• Activity on Arrow; Arrow Diagrams; i-j
Diagrams
• Activity on Node; Precedence Diagrams; PERT
Diagrams
18

19. Project
• An Enterprise (activity or set of inter-related
activities) that has a definable start and a
definable end.
19

20. Activity
• An operation or process consuming time and
possibly other resources
20

21. Work Breakdown Structure
• How many activities shall we use?
• Is the job to be carried out in sections?
• Shall we split activities floor by floor?
• Shall we include fabrication of elements?
• Shall we separate finishing trades?
21

22. Activities
• Get dressed
• Fill kettle
• Boil water
• Make tea
• Pour tea
• Get milk from fridge
• Pour milk
• Cook toast
• Butter toast
• Eat breakfast
22

23. Precedence Networks
1.
Get
Dressed
Activity
7.
Cook
Toast
2.
Fill
Kettle
Dependency
line
Time and logic
passes left
to right
Numbers are
allocated to activities
for identification,
often randomly
Preceding
Succeeding
23

24. 1. Get
Dressed
2. Fill
Kettle
3. Boil
Water
4. Make
Tea
5. Get
Milk
6. Pour
Milk
7. Cook
Toast
8. Butter
Toast
9. Pour
Tea
10. Eat
Breakfast
Precedence Network
Activity
Dependency
24

25. Precedence Network - Multiple Start & Finish
Start
Finish
25

26. Duration Calculation
• Quantity Q can obtained from the Bill of Quantities or
from drawings.
• The number of resources R (no. of workers, no. of
machines etc.) ascertained from availability or
conditions.
• The output O is the difficult parameter to determine.
Best obtained from records, publications or
experience.
26

27. Duration
Quantity of work
Number of resources
Output - work per resource per time unit
Duration =
N x O
Q
Example:- 6000m3 of excavation to be carried out
by 2 machines each capable of 250m3 per day
D =
2 x 250
6000 = 12 days
27

28. Activities
• Get dressed 5 mins
• Fill kettle 1 min
• Boil water 6 mins
• Make tea 2 min
• Pour tea 1 min
• Get milk from fridge 1 min
• Pour milk 1 min
• Cook toast 3 mins
• Butter toast 1 min
• Eat breakfast 5 mins
28

29. Precedence Diagrams - Conventions
Duration
Activity Number
Activity Description
Resources
29

30. 1. Get
Dressed
2. Fill
Kettle
3. Boil
Water
4. Make
Tea
5. Get
Milk
6. Pour
Milk
7. Cook
Toast
8. Butter
Toast
9. Pour
Tea
10. Eat
Breakfast
Precedence Network
Activity
Dependency
5 1 6 2 1 5
3 1
1 1
Duration
30

31. 1 2 3 4 5 6 7 8 9 10
0
GET DRESSED
EST EFT
COOK
TOAST
EST EFT
TIMELINE

31

32. Earliest Start and Finish times
• Earliest start time of an activity (EST) = The
earliest time by which an activity can start
within the logical restraints of the network =
Zero for all start activities, then from EFT of
preceding activities
• Earliest finish time of an activity (EFT) = The
earliest time by which an activity can finish
within the logical restraints of the network =
EST + D
32

33. Precedence Diagrams - Conventions
Earliest Start Time Earliest Finish Time
Duration
Activity Number
Activity Description
Resources
33

34. 1. Get
Dressed
2. Fill
Kettle
3. Boil
Water
4. Make
Tea
5. Get
Milk
6. Pour
Milk
7. Cook
Toast
8. Butter
Toast
9. Pour
Tea
10. Eat
Breakfast
Precedence Network
Activity
Dependency
5 1 6 2 1 5
3 1
1 1
Duration
0 5
5 8 8 9
5 6 6 7
5 6 6 12 12 14 14
Forward Pass
34

35. Forward Pass
• On a Forward Pass, where there is a choice of EFT’s (two or
more dependencies converge at the start of a succeeding
activity) you choose the HIGHEST EFT to be the EST of the
succeeding activity.
• The succeeding activity can only start when ALL preceding
activities have finished (governed by the LATEST).
35

36. 1. Get
Dressed
2. Fill
Kettle
3. Boil
Water
4. Make
Tea
5. Get
Milk
6. Pour
Milk
7. Cook
Toast
8. Butter
Toast
9. Pour
Tea
10. Eat
Breakfast
Precedence Network
Activity
Dependency
5 1 6 2 1 5
3 1
1 1
Duration
0 5
5 8 8 9
5 6 6 7
5 6 6 12 12 14 14 15 15 20
Forward Pass
Earliest finish time
Earliest start time Total project
time TPT
36

37. 0
GET DRESSED
EST EFT
COOK
TOAST
EST EFT
TIMELINE
11 12 13 14 15 16 17 18 19 20
EAT
BREAKFAST
EST EFT
LST LFT
LFT
LST
1 2 3 4 5 6 7 8 9 10
TOTAL
PROJECT
TIME
BUTTER
TOAST
37

38. Latest Start and Finish times
• Latest start time of an activity (LST) = The latest time
by which an activity can start within the logical
restraints of the network = LFT – D
• Latest finish time of an activity (LFT) = The latest
time by which an activity can finish within the logical
restraints of the network = TPT for ALL end
activities, then from LST of succeeding activities.
38

39. Precedence Diagrams - Conventions
Earliest Start Time Earliest Finish Time
Latest Start Time Latest Finish Time
Duration
Activity Number
Activity Description
Resources
39

40. Total Project Time
Start of Backward
Pass, LFT of all
End activities
Start of backward Pass
40

41. 1. Get
Dressed
2. Fill
Kettle
3. Boil
Water
4. Make
Tea
5. Get
Milk
6. Pour
Milk
7. Cook
Toast
8. Butter
Toast
9. Pour
Tea
10. Eat
Breakfast
Precedence Network
Activity
Dependency
5 1 6 2 1 5
3 1
1 1
Duration
0 5
5 8 8 9
5 6 6 7
5 6 6 12 12 14 14 15 15 20
Forward Pass
Earliest finish time
Earliest start time
5 5 6 6 12 12 14 14 15 15 20
15
14
14
11
14
13
13
12
Backward pass
Total project
time TPT
41

42. Backward Pass
• On a Backward Pass, where there is a choice of LST’s (two
or more dependencies converge at the finish of a
preceding activity) you choose the LOWEST LST to be the
LFT of the preceding activity.
• The preceding activity has to finish when ALL succeeding
activities start (governed by the EARLIEST).
42

43. 1. Get
Dressed
2. Fill
Kettle
3. Boil
Water
4. Make
Tea
5. Get
Milk
6. Pour
Milk
7. Cook
Toast
8. Butter
Toast
9. Pour
Tea
10. Eat
Breakfast
Precedence Network
Activity
Dependency
5 1 6 2 1 5
3 1
1 1
Duration
0 5
5 8 8 9
5 6 6 7
5 6 6 12 12 14 14 15 15 20
Forward Pass
Earliest finish time
Earliest start time
0 5 5 6 6 12 12 14 14 15 15 20
15
14
14
11
14
13
13
12
Latest finish time
Latest start time
Backward pass
Total project
time TPT
43

44. 0
GET DRESSED
EST EFT
LST LFT
COOK
TOAST
EST EFT
TIMELINE
11 12 13 14 15 16 17 18 19 20
EAT
BREAKFAST
EST EFT
LST LFT
COOK
TOAST
LFT
LST
LFT
LST
TOTAL FLOAT
1 2 3 4 5 6 7 8 9 10
TOTAL
PROJECT
TIME
BUTTER
TOAST
EARLY
LATE
44

45. Timescale
(days, weeks)
Activity at earliest start
Activity at latest start
10 20 30 40 50 60
7 28 34 44 55
Duration Total Float
Duration
EST EFT
LST LFT
Network
Bar Chart
7 21 28
34 27 55
44
55
44
55 Activity
45

46. Float
• The time available for an activity in addition to its
duration
46

47. Total Float
• The time by which an activity can be delayed
or extended without affecting the total project
duration
• LFT - EST - D
47

48. Timescale
(days, weeks)
Activity at earliest start
Activity at latest start
Succeeding activity
(at earliest start)
10 20 30 40 50 60
7 28 34 44 55
Duration Total Float
Duration Free Float
Duration
EST EFT
LST LFT
Network
Bar Chart
7 21 28
34 27 55
44
55
44
55 Activity
48

49. Free Float
• The time by which an activity can be
delayed or extended without delaying the
start of any succeeding activity
• earliest EST of all succeeding activities -
EST of this activity- D
49

50. Precedence Diagrams - Conventions
Earliest Start Time Earliest Finish Time
Latest Start Time Latest Finish Time
Duration
Total Float
Activity Number
Activity Description
Resources
50

51. 1. Get
Dressed
2. Fill
Kettle
3. Boil
Water
4. Make
Tea
5. Get
Milk
6. Pour
Milk
7. Cook
Toast
8. Butter
Toast
9. Pour
Tea
10. Eat
Breakfast
Precedence Network
Activity
Dependency
5 1 6 2 1 5
3 1
1 1
Duration
0 5
5 8 8 9
5 6 6 7
5 6 6 12 12 14 14 15 15 20
Forward Pass
Earliest finish time
Earliest start time
0 5 5 6 6 12 12 14 14 15 15 20
15
14
14
11
14
13
13
12
Latest finish time
Latest start time
Backward pass
Float
0 0 0 0 0 0
6 6
7 7
Total float
Total project
time TPT
51

52. References
• Evans, B. (2007) Lecture notes. Circulated in the Project Management
lecture. London: Kingston University.
• Fellows, R., Langford, D., Newcombe, R. & Urry, S. (2002) Construction
Management in Practive. 2nd Ed. Oxford: Blackwell Science Ltd.
• Harris, F., McCaffer, R. & Edum-Fotwe, F. (2006) Modern Construction
Management. 6th Ed. Oxford: Blackwell Publishing.
• Lester, A. (2017) Project Management, Planning and Control. 7th Ed.
Oxford: Elsevier
• Sears, S.K., Sears,G.A., Clouch, R.H., Rounds,J.L. & Segner, R.O. (2015)
Construction Project Management. 6th Ed. New Jersey: John Wiley & Sons
52

53. End of Lecture
53