Professional Documents
Culture Documents
Planning and Scheduling Group 3 Ec1
Planning and Scheduling Group 3 Ec1
PERT/CPM
Critical Path Method (CPM) offers the solution through systematic approach. The specific informations
provided by the CPM are enumerated as follows:
1. PERT/CPM pinpoints the particular work operations whose completion times are responsible for controlling
the complete date.
2. It provides means of speeding up a project without excessive costs for overtime.
3. It gives a time leeway or float available for each of the non-critical work operations.
4. It establishes time boundaries for operations with possibilities of shifting resources, equipment and
manpower to meet time requirements.
1. PLANNING
5. PERT/CPM indicates the earliest starting date for each work operations and sub-contracts for supply and
delivery of materials.
6. It shows the most advantageous scheduling for all operations.
7. It offers a means of assessing the effect on the overall project variations in one operation such as change
orders.
8. PERT/CPM offers a means of re-scheduling the operations but still to be completed at the least increase in
cost.
9. With the critical path schedule as revised to reflect the change order, any claim if any, for additional
payment will be understood both by the owner and the contractor.
10. In case of serious delay due to weather, late material or equipment delivery, the network can be revised
at that stage and new computation is made to determine the new critical operation if any and revised float times
determined for the non-critical operations.
1. PLANNING
In any project construction undertakings, planning is the most important consideration which includes:
1. Gathering of all the necessary input data to make the PERT/CPM works.
2. Planning phase is the main work of the contractor for being familiar and knowledgeable of his costing
methods of doing business.
3. The contractor can seek assistance for the accomplishment of his work particularly the gathering of data.
4.The contractor has the complete perception, experiences, resources, and interest in getting the project done
in the best possible time and cost.
5. The planning stages give the contractor a "Dry Run" on the construction of the project.
6. If the contractor wants an effective approach and use of the construction management, he must do it
himself.
7. By performing the work personally, one obtains intimate first hand knowledge of the job and gain insight
and details of anticipated problems.
2. SCHEDULING
SCHEDULING is defined as the process of translating the
arrow diagram into time table of calendar days. This is done by
the day date table converting working days into calendar days
which permits the inclusion of weekends, holidays, weather and
other time lost. It shows the relationships between the operations
and the leeway limitations. All activities should be checked with
the day-to-day table.
• Job control through the use of PERT/CPM gives the. The PERT/CPM diagram should be updated periodically to
management a reliable system identifying job problems account for:
within days in- stead of months. 1. Time discrepancies
• The diagram must show the status of the project at any 2. Deliveries
time and indicate which activities can be started and to 3. Weather
pinpoint the cause of the delay. 4. Change orders
5. Unexpected events or conditions
.
Note: Updating of the diagram is based on the number of
days the project is out of schedule
3. CONTROLING AND MONITORING
1. The contractor is supplied with time status reports showing the overall status of
the project in general and in particular.
2. The contractor is provided with revised schedules which reflect the actual work
conditions and the project status.
3. The contractor is supplied with cost status reports showing how much money is
being disbursed for what type of expenses.
4. The contractor should be supplied with those reports as frequently as desired
or required to maintain control over the project.
1 PLANNING PHASE
4 OUTPUT PHASE
The Output Phase consists of the following: 4. Revised resource analysis
1. Time status report 5. Revised cash flow predictions
2. Revised schedules 6. Cost status reports
3. Revised Bar Charts/ Arrow Diagram or Network
THREE MAJOR REASONS
FOR CONSTRUCTION
FAILURE:
1. Unbalanced organization
due to lack of planning
2. Lack of financial planning 3. Poor cost control
and scheduling.
CHAPTER 5:
An arrow in the network must satisfy two basic The length and direction of an activity arrow has no
questions: relationship with the amount of time required to
accomplish the work presented by it. Similarly, two
activities starting with the same event do not necessarily
1 What activities must be completed before this one occur at the same time.
can start?
The event is indicated on the network as a circle, square, ellipse or any form
of geometrical symbols with a number written therein for identification.
1. Numbering the events follows the construction of the network.
2. No two events shall have the same identification number in the network.
3. For this reason, one or more dummy activities may be used in a network.
FUNDAMENTAL ELEMENTS OF
PERT/CPM NETWORKING
Activities can either be:
•By their end points such as 1-2; 2-4; etc.
•By letter assigned to an arrow such as; a, b, c, etc.
Dummy Activity – is an arrow on a network showing the
dependent relationship between two activities. However, dummy
activity does not represent actual work efforts, and do not
consume time. Dummy activity may be used in the network to
distinguish between two or more parallel activities.
Duration of an Activity – is the time it takes an activity to be The network diagram indicates sequence of
finished. In short, this is the normal time duration of a task. relationships among major activities on a
Duration activity is the span of time from the Early Start to its project. For instance, activity 2-4 cannot be
Early Finish or from its Late Start to its Late Finish. started according to the network until after
Path – is a sequence of activities that leads from the starting activity 1-2 is completed.
node to the finishing node. Thus, the sequence 1-2-4-6 in the
network of the figure shown is a path. There are two paths from
the starting node to the finishing node. They are:
•Path 1-2-4-6
•Path 1-3-5-6
1 2 3 4
5 6 7 8
RULES FOR NUMBERING EVENTS IN NETWORK DIAGRAM
From the following table of information, (a) Draw a precedence diagram, (b) Find the Critical Path, (c)
Determine the expected duration of the project.
₱
DEFINITION OF TERMS
• Critical Path - is the longest route in the network of • The Earliest Start of an activity cannot be
activities representing a project. The sum of the
activities duration along this route is the duration of the
earlier than the earliest event time of the
project. event.
• In other words, the time required to complete a project • In other words, the Earliest Start of any
is numerically equal to the length of the route which is activity is always equal to the Earliest Event
called critical path.
at the beginning of an arrow which is
• Critical Activities - Activities along the critical path. sometimes called i-node. The point of an
arrow is called j-node.
• Earliest Event - Is the earliest time occurrence of an
event sometimes called Earliest Event Time or Early
Event Time. It is the earliest time an event can happen
• Early Start is not necessarily the point in time
without delaying the Earliest Start of any activity. that the activity will be over, but it is the
• The Earliest Event time is numerically equal to the earliest time that it can occur. It is the first
longest path of activities in series from the project start day after the physical assumption of the
to the finish. Unless specified, the Earliest Event Time of
the starting event is assumed to be zero.
activity.
DEFINITION OF TERMS
• The Earliest Finish of an activity is equal to its • The Latest Finish of an activity cannot be later
Earliest Start plus its duration or time. than the latest event time of its j-node. In short,
all activities with the same J-node have the
ES= ES + Duration or same late finish which is the same as the latest
EF = Early Event + Duration event time at their common node.
• The Latest Event time - is the latest time the LS +D= LF or LS = LF-D
event may occur without delaying project
completion. • Activity Total Float or Activity Total Slack - Is
It is numerically equal to the length of the the span of time an activity can be delayed
critical path minus the longest path from the after its earliest start time without delaying the
project and event to the event in question. project completion. It is numerically equal to the
total time for the activity minus the activity
duration.
LF - EF = Total Float or
LS - ES = Total Float
DEFINITION OF TERMS
• The activity Free Float - is the span of time an activity can be delayed after its Early Start
without delaying the Earliest Start of any succeeding actual activity that may be availed of and
still allow its succeeding real activities to begin at their Earliest Start time.
FF = ES -(ES+D)
• Independent Float - Is that portion of the activities Free Float that would remain if all its
preceding activities used up all their float.
I.F.= ES -(LF-D)
Note : When the result of applying this formula is negative, it means that there is no
independent float.
COMPUTING THE EARLY START AND
THE EARLY FINISH
An algorithm is used to develop four types of informations about the network activities, they are:
ES = The Early Start of time activity. This is assuming that all preceding activities start at the earliest time.
EF = Early Finish of time activity.
LS = Latest time the activity can Start and not delay the project
LF= Latest time the activity can Finish and not delay the project.
After determining the value of each activity, we can proceed to find the following.
1. Expected duration of the project
2. The slack time
3. Determine which activity falls under the critical path
SAMPLE PROBLEM 3.1
• Using the following network diagram, compute for the value of ES and EF
times
SAMPLE PROBLEM 3.1
SOLUTION:
Assume an Early Start (ES = 0) for activities without predecessors or we start from 0. Hence,
activities 1-2 and 1-3 as starting activities are assigned to 0.
The EF time for these activities are:
1) The EF (1-2) = 0 + 10= 10 and
EF (1-3) = 0 + 6 = 6
2) The Early Finish (EF) of activity 1-2 becomes the ES for the two activities 2-4 and 2-5 that follows
it.
3) Similarly, the EF of activity 1-3 becomes the ES for activity 3-5.
Therefore:
ES (2-4) = 10
ES (2-5) = 10
ES (3-5) = 6
SAMPLE PROBLEM 3.1
SUMMARY OF THE COMPUTATIONS:
4.) The corresponding time for these activities are: Activity Duration ES EF
EF (2-4) = 10 + 8 =18
EF (2-5) = 10 + 13 = 23 1-2 10 0 10
EF (3-5) = 6 + 12 = 18 1-3 6 0 6
EF (4-5) = 18 + 4 = 22
2-4 8 10 18
5.) The activity 4-5 has an early starting time ES
equal to EF(2-4)=18 and an early finish time of 2-5 13 10 23
18 +4=22.
3-5 12 6 18
6.) Activity 5-6 with three predecessors has an
early starting time ES equal to 18, 22 and 23. 4-5 4 18 22
Select the the largest number which is 23 plus
duration 2 = 25, the early finish EF. Summary of 5-6 2 23 25
the above computations:
COMPUTING THE LAST START AND THE
LAST FINISH
LF = LS + Duration or
LS = LF - Duration
SOLUTION:
1) It was found in illustration 3-1 that EF5-6 = 25 and this EF is automatically becomes the LF.
Thus, EF = LF = 25 weeks
2) Solve for the values of LS going Backward from node (6) starting from 25 weeks.
3) LS 5-6 = 25 - 2 (time) = 23
4) For activity 5-6 to start not later than week 23 all immediate predecessors must be finished not later
than that time.
5) For activity 4-5, subtract ; 7) In the same manner:
LS45; = 23 - 4 = 19 For activity 2-5 subtract;
LS 2-5; = 23 -13 = 10
6) For activity 3-5, subtract;
LS 4-5; = 23 - 12 = 11
SAMPLE PROBLEM 3.2
Activity Duration LF LS
For activity 2-4 subtract; LS 2-4; = 19 - 8 = 11
For activity 1-3 subtract; LS1-3; = 11 - 6 = 5
For activity 1-2 subtract, LS 1-2; 10 - 10 = 0 5-6 2 25 23
8) Take note that in node (2) we use the smallest value 4-5 4 23 19
of 10 not 11 weeks in solving backward for LS/LF.
Unlike that in illustration 6-1 we use the largest value of
3-5 12 23 11
ES as we go forward for the next value of EF.
9) Since there are two arrows leaving Node 2, that is 2-5 13 23 10
activity 2-4 with LS = 11 and activity 2-5 with LS = 10
the Latest Finish (LF) for activity 1-2 which is 10 will be 2-4 8 19 11
used being the smallest LS for a leaving arrow.
1-3 6 11 5
The value of LF and LS found will be tabulated as
follows: 1-2 10 10 0
SAMPLE PROBLEM 3.3
SOLUTION:
Activity LS ES Slacks or LF Slacks
EF
1-2 0 0 0 5 5 0
1-3 2 0 2 4 2 2
2-4 5 5 0 8 8 0
2-5 5 5 0 9 9 0
3-4 4 2 2 8 6 2
4-5 8 8 0 11 11 0
SOLVING THE FLOAT OR SLACK
TIME
The term Slack is used by PERT which is equivalent to Float of CPM network system.
Slack or Float is the word used for those activities which do not fall on the critical path.
Meaning, that these activities have scheduling Time Leeway that can be used without
adverse effect on the project time completion.
Float = LS - ES
Float = LF – EF
SAMPLE PROBLEM 3.4
• From the following diagram, determine each of the following:
(a) The length of each path, (b) The critical path and (c) The amount of float time for each path
DATA SHEET
Step – 2 Fill up the column for ES and EF Step – 3 Continue filling up the column for ES and EF
Step – 4 Continue filling up the column for ES and EF Step – 5 Continue filling up the column for ES and EF
Step – 6 Computing the Last Start (LS) and Last Step – 7 Computing the Last Start (LS) and Last
Finish (LF) by Working Backward on the Network. Finish (LF) by Working Back on the Network.
Step – 8 Computing the Last Start (LS) and Last Finish Step – 9 Computing the Total Float or Slack Time
(LF) by Working Back on the Network.
Step – 10 Computing the Free Float
Time Scaled Event
Network
The Gantt chart is a popular tool for planning and scheduling simple
projects. It serves as an ai of the manager to schedule project
activities an then, to monitor progress over-time by comparing the
planned progress to the actual work progress.
Ongoing Activities
4
Ta b u l a t i o n
4.) D a y s 8 t o 11 f o r a c t i v i t i e s A , D ,
F and K.
Activity A = 10 men
Activity D= 15 men
Activity F = 5 men
Activity K = 10 men
To t a l . . . . . . . . . . . . . 4 0 m e n x 4
days..................160 man day
5.) Day 12 for activities D, F and K Ta b u l a t i o n
15 men + 5 men + 10 men = 30 men
To t a l . . . . . . . . . 3 0 m e n x 1 d a y. . . . . . . . . . . . . . . . . . . 3 0
man days
Three Time
Estimates 2
The Most Likely time or
Probabilistic time
1. Frequency distribution
2. Normal curve or normal
probability curve,
3. Standard deviation
4. Normal deviate or
probability factor.
Expected Time- is the time computed considering the three times estimate
𝑎 + 4𝑚 + 𝑏
𝐸𝑡 =
6
SOLUTION:
Crash this activity to its
minimum time of 8 weeks.
Subtract: 12-8- 4 weeks
Multiply:
4 weeks x P 500 per week = P
2,000
Subtract:
33 weeks- 4 weeks = 29
weeks
SAMPLE PROBLEM 5.1
SOLUTION:
The least expensive activity along this path is
activity B with P 600 cost per week.
SOLUTION:
The least expensive activity along
this path is activity E with a cost of
P 800 per week
Subtract :
Normal time - Crash time
7-3 weeks x P 800 = P 3,200
SOLUTION:
SOLUTION: