0% found this document useful (0 votes)
15 views11 pages

Om303 8

The document discusses project management techniques, focusing on scheduling through network analysis, specifically the Critical Path Method (CPM) and Program Evaluation and Review Technique (PERT). CPM is used for scheduling projects with known activity times, while PERT accommodates uncertain activity durations. Key steps in solving CPM problems include determining activity times, developing project networks, and calculating earliest and latest start and finish times.

Uploaded by

Mayeth Valencia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
15 views11 pages

Om303 8

The document discusses project management techniques, focusing on scheduling through network analysis, specifically the Critical Path Method (CPM) and Program Evaluation and Review Technique (PERT). CPM is used for scheduling projects with known activity times, while PERT accommodates uncertain activity durations. Key steps in solving CPM problems include determining activity times, developing project networks, and calculating earliest and latest start and finish times.

Uploaded by

Mayeth Valencia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

project
management
Chapter 8 and 9: SCHEDULING A PROJECT WORK and PRODUCING A WORKABLE SCHEDULE
thru NETWORK ANALYSIS

presented by
John Karl Ian P. Guce
BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

NETWORK ANALYSIS
In many situations, project managers are responsible for planning, scheduling, and
controlling projects that consist of different tasks handled by a variety of departments and
individuals. Usually, these projects are complex that the decision-maker cannot possibly
bear in mind all the information pertaining to the plan, schedule, and progress of the
project. In such a situation, the critical path method (CPM) and program/project
evaluation and review technique (PERT) play an important role.
BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

CRITICAL PATH METHOD (CPM)


The Critical Path Method (CPM) is a network-based project scheduling procedure. It is
used primarily for industrial projects for which activity times generally were known. J.E.
Kelly of Remington Rand and M.R. Walker of Du Pont in 1957 develop CPM to aid in
scheduling maintenance shutdown of chemical processing plants.

The Critical Path is the longest path through a PERT network.

The critical path is composed of activities with zero slack time.


BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

CRITICAL PATH METHOD (CPM)


Critical Path Activities are activities in a PERT network that are on the critical path and
consequently have zero slack time.

Activities that must be completed immediately prior to the start of the activity in question
are called Immediate Predecessors.

Activity that can be delayed without exceeding the critical project time are Activity Slacks.

There are two main procedures in a PERT/CPM network:

Forward Pass involves moving forward through the project network to determine the
earliest start and earliest finish for each activity, while the Backward Pass involves moving
backward through the network to determine the latest start and the latest finish time for
each activity.
BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

CRITICAL PATH METHOD (CPM)


STEPS IN SOLVING A CPM PROBLEM
1. Determine the list of activities, its immediate predecessors, and approximate time,
which is already provided in the problem.
2. Develop the project network.
3. Determine the completion time per activity
4. Determine the earliest start time and earliest finish time of the initial activities.
a. ES = earliest start time for an activity
b. EF = earliest finish time for an activity
c. t = activity time
i. The earliest finish time for any activity is 𝐸𝐹=𝐸𝑆+𝑡.
5. Compute for the earliest start time and finish time using the forward pass.
6. Develop the latest start time and latest finish time using the backward pass.
a. LS = latest start time for an activity
b. LF = latest finish time for an activity
c. t = activity time
i. The latest start time for any activity is 𝐿𝑆=𝐿𝐹−𝑡.
BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

CRITICAL PATH METHOD (CPM)


STEPS IN SOLVING A CPM PROBLEM
7. Compute for the latest finish time and latest start time.
8. Compute for the slack of all activities using the formula provided below and identify the
zero slack to determine the critical path.

Slack = LS - ES = LF - EF
BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

CRITICAL PATH METHOD (CPM)


EXAMPLE
BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

CRITICAL PATH METHOD (CPM)


EXAMPLE
BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

PROJECT EVALUATION AND REVIEW TECHNIQUE (PERT)


Program/Project Evaluation and Review Technique (PERT) is a network technique, designed
for project planning and scheduling that uses probabilistic activity times. It is used to
handle uncertain activity times. The PERT was developed under the sponsorship of the U.S.
Navy Special Projects Office in 1958 as a tool for scheduling and controlling the Polaris
missile project.
BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

PROJECT EVALUATION AND REVIEW TECHNIQUE (PERT)


Essential Formula
BATANGAS STATE UNIVERSITY - TNEU OM303 - PROJECT MANAGEMENT

PROJECT EVALUATION AND REVIEW TECHNIQUE (PERT)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy