Scheduling

CONSTRUCTION PLANNING AND MANAGEMENT

UNIT 2- SCHEDULING
• Scheduling Job layout and line of balance
• Project Management through Networking PERT, CPM

Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

NETWORK

• A network is a logical and chronological graphic

representation of the activities (and events)
composing a project.

• Network diagrams are the preferred technique for

showing activity sequencing.

• The main formats are the arrow and precedence

diagramming methods for activity oriented systems
and PERT for event oriented systems.

2
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

NETWORK ANALYSIS TECHNIQUES

PERT –
Project
Evaluation
and Review
Technique

Calculation produces an "Expected time" Te,

where Te = (To+4Tm+Tp)/6, that is to say,
the mean value of the three estimates

Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
Definitions
Activity, or task: A basic unit of work as part of the total project that is easily
measured and controlled. It is time- and resource consuming.

Event: A point in time marking a start or an end of an activity. In contrast to an

activity, an event does not consume time or resources.

Critical path: The longest path in a network, from start to finish, including lags and
constraints.

Critical activity: An activity on the critical path. Any delay in the start or finish of a
critical activity will result in a delay in the entire project.

4
 Early dates: The early start date and early finish date of an activity.

Early finish (EF): The earliest date on which an activity can finish within project constraints.

Early start (ES): The earliest date on which an activity can start within project constraints.

Forward pass: The process of navigating through a network from start to end and calculating
the completion date for the project and the early dates for each activity.

Backward pass: The process of navigating through a network from end to start and
calculating the late dates for each activity. The late dates (along with the early dates)
determine the critical activities, the critical path, and the amount of float each activity has.

Late dates: The late start date and late finish date of an activity.

Late finish (LF): The latest date on which an activity can finish without extending the project
duration.

Late start (LS): The latest date on which an activity can start without extending the project
duration.
5
 Scheduling

CPM PERT
1. CPM is activity oriented 1. PERT is event oriented.

2. Single time estimates are used for the 2. The time estimates for activities are
various activities i.e. the time estimates are probabilistic. Three time estimates are
deterministic. used.

3. CPM is used for repetitive types of 3. PERT is used for pioneering type of
projects where the time estimates for projects: projects which are the first of
various activities are either known or can their kind where prior data about activity
be determined fairly accurately. times is not available.

4. CPM places emphasis on optimizing 4. PERT lays emphasis on reducing project

allocation of resources and minimizing completion time without cost completion.
overall project cost.

Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling
PROGRAM EVALUATION AND REVIEW
TECHNIQUE (PERT)
• PERT is used for research and development projects which are
non-repetitive in nature.

• Such projects are characterized by an extreme amount of

uncertainty both in development and time duration.

• Three time estimates used to determine the expected or

average time of each activity:

Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

• Optimistic Time estimate (to)

It is the shortest possible time for completing an activity
if everything proceeds as planned without any problem-
i.e. activity is completed under ideal conditions

• Most likely time estimate (tm)

It is the time for completing an activity under normal
conditions. In this case, conditions are not ideal and minor
mishaps may occur.

• Pessimistic time estimate (tp)

It is the maximum time required to complete an activity under
abnormal or extremely adverse conditions when everything
goes wrong.

Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

The expected time for each activity is computed as:

The variances on activities is computed by:

Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

CRITICAL PATH METHOD (CPM)

• CPM extensively used in construction industry due to
the repetitive nature of construction works.

• Single time estimates are used for various activities.

• CPM analysis tools allow a user to select a logical end

point in a project and quickly identify its longest
series of dependent activities (its longest path).

Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Network Representation
Two classic formats
AOA: Activity on Arrow
AON: Activity on Node

Each task labeled with

Identifier (usually a letter/code)
Duration (in std. unit like days)

There is 1 start & 1 end event

12
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

ACTIVITY-ON-ARROW (AOA) NETWORK

1. Also called activity-on-arrow (AOA) network diagram or (I-J)
method (because activities are defined by the form node, I,
and the to node, J)
2. Activities are represented by arrows drawn from left to right.
3. Nodes or circles are the starting and ending points of
activities.
4. Can only show finish-to-start dependencies.

13
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

The Four Types Relationships

Activities represented by nodes and links that

allow the use of four relationships:

1) Finish to Start – FS

2) Start to Finish – SF

3) Finish to Finish – FF

4) Start to Start – SS

14
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Finish to Start (FS) Relationship

. The traditional relationship between activities.

. Implies that the preceding activity must finish

before the succeeding activities can start.

. Example: the plaster must be finished before the tile can

start.

Plaster Tile

15
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Star to Finish (SF) Relationship

. Appear illogical or irrational.

. Typically used with delay time OR LAG.

. The following examples proofs that its logical.

Erect steel Pour

reinforcement
formwork concrete

5 SF

Order
concrete
16
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Finish to Finish (FF) Relationship

• Both activities must finish at the same time.

• Can be used where activities can overlap to a certain

limit.
Erect Remove
scaffolding Old paint

FF/1

sanding

FF/2

Dismantle
painting inspect scaffolding
17
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
Start to Start (SS) Relationship
• This method is uncommon and non exists in
project construction .

Clean surface Spread grout

SS

Set tile Clean floor area

18
 Scheduling

Basic Logic Patterns for Arrow Diagrams

Node (Event) i Node (Event) j

Activity Name
i j
j>i
Each activity should have a unique i – j value

(a) Basic Activity

19
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling 20

A B
2 4 10 12

(b) Independent Activities

A B
3 6 9

(c) Dependent Activities

Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling
Activity C depends upon the completion of both Activities A & B

4 A
C
B 6 8
2 (d) A Merge
Activities B and C both depend upon the completion of Activity A

B 6
A
2 4
C
8
(e) A Burst

21
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

12 A C 18

B 16 D
14 20

Activities C and D both depend upon the completion of Activities A and B

(f) A Cross

22
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Example
Draw the arrow network for the project given next.

Activity Predecessor
A -
B A
C A
D B
E C,D

23
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Solution :

B 30 D

10 A 20 40 E 50
C

24
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

NODE NETWORKS METHOD (AON)

Activities are represented on nodes and arrows are used to show the
dependency relationships between the activity nodes.
Activity number
Link 10 20
A B
Activity name

a) Independent Activities

10 Link 20
A B B depends on A

25
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

b) Dependent Activities

10
A
30 40 C depends on A & B
C D D depends on C
20
B

c) A Merge Relationship

30
C
10 20 B depends on A
A B C depends on B
40 D depends on B
D

26
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Recommendations for Proper Node Diagram Drawing

Incorrect Correct
27
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

B A B

A
A

B
Improper proper
28
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Improper Proper
29
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Improper Proper

30
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

A A

B PS B

C C

Improper Proper
(a) Do not start a network with more than one node
31
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

A A

B B PF

C C

Improper Proper
(a) Do not end a network with more than one node
32
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling 33

Example
Draw the arrow network for the project given next.

Activity PREDECESSOR
A -
B A
C A
D B
E C,D

33
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Solution :

B D
A E

34
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling 35

Example
Draw the arrow network for the project given next.

Activity IPA
A -
B A
C A
D B
E B,C
F C

35
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Solution :

B D

A PF
E

C F

36
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Lags and Leads

In some situations, an activity cannot start until a
certain time after the end of its Predecessor.

Lag is defined as a minimum waiting period between the finish

(or start) of an activity and the start (or finish) of its successor.

Arrow networks cannot accommodate lags. The

only solution in such networks is to treat it as a real
activity with a real duration, no resources, and a $0
budget.

37
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

The term lead simply means a negative lag. It is seldom used in

construction. In simple language: A positive time gap (lag)
means ‘‘after’’ and a negative time gap (lead) means ‘‘before.’’

38
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

GUIDELINES FOR PREPARING WBS

• If the time required to complete any individual activity is less than
1/1000th part of the project, then the level of detail is too great.

• Conversely, if the time required to complete one activity is more

than 1/10th of the project, then the level of detail is too shallow.

• The division of activities should take into account the complexity of

the job.

• If the network is intended to be presented to the top levels of the

management, the details should be kept on a bare minimum.

39
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

RULES FOR PREPARING NETWORKS

RULE 1: No activity can commence until all
preceding activities have been completed:

1
concrete foundation
2 4 5

3
40
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

RULES FOR PREPARING NETWORKS

RULE 2: Dummy Activities
• Used to show dependency or to avoid duplicate numbering of
activities.
• Used to complete logic, duration of “0”
• It consumes no time or resources.

Concrete pier Erect beams

1 4 5

2
The use of dummy to avoid duplicate numbering of activities.
41
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

RULES FOR PREPARING NETWORKS

RULE 3: The logical placement of an activity in the network is
governed by the following three considerations:
• Which activity must be completed before this activity can
commence?(Precedence)
• Which activities can be carried out along with this activity?? (concurrence)
• Which activities cannot commence until this activity is completed?

excavate Fix shuttering Concrete foundation

1 3 4 5

2
42
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

RULES FOR PREPARING NETWORKS

RULE 4: No activity should lead back to a previous event:
there must be no previous looping.

1 3

43
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

RULES FOR PREPARING NETWORKS

RULE 5:There must be only one start and one finish i.e
no activity should be kept dangling.
4
CORRECT
1 2
5
4
INCORRECT
1 2
5
44
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling
FULKERSON’S RULE FOR NUMBERING
THE EVENT
• In the network, the events at the tail or head of the
activity have to be numbered for proper
identification.

• The numbering should progress from left to right

reflecting the logical sequence of activities.

• Fulkerson’s rule is a simple procedure for numbering

the events of the network.

45
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

FULKERSON’S RULE
STEP 1: In every network there is one initial event. This initial event has
arrows coming out of it and no arrows entering it. Number this event as 10

STEP 2: Neglect all arrows coming out of the initial event. This will give rise to
one or more new initial events.

STEP 3: Number the new initial events generated in step 2 as 20,30,etc.

STEP 4: Neglect all arrows coming out of the new initial events, which will give
rise to further initial events. Number them sequentially.

STEP 5: Repeat step 4 till the last event, which has no arrows coming out of
it, is numbered.

46
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

Number the events for the network shown in the figure using fulkerson’s rule :

S
Q W
P
T
L

R X
U

47
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT
 Scheduling

The following are the activities and the logic for a project.
Develop a network for the project.
Activities: A,B,E,Q,K,X,J,Z,G,F,C
Logic:
1. A and B can be carried out the same time. They represent
the beginning of the job.
2. E and Q must follow A.
3. E and Q can be executed at the same time.
4. Neither F or G can be started before B is completed, but
they can be concurrently followed.
5. C depends on the completion of F and G.
6. D depends on the completion of E and Q.
7. Z can be started only when D and C are finished.
8. Z is the last activity
48
Namesh Killemsetty ^ Construction Planning and Management ^ Scheduling ^ Sem 6 (2014), Civil @OPJIT