Scribd
Upload
84 views25 pages

26 Pert

CPM and PERT are network-based methods for planning, scheduling, and controlling projects. CPM assumes deterministic activity durations while PERT assumes probabilistic durations. Each activity is represented by an arc in the network diagram. Critical path calculations involve forward and backward passes to determine earliest and latest occurrence times of events. Activities on the critical path cannot be delayed without delaying project completion.

Uploaded by

Potnuru Vinay
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
84 views25 pages

26 Pert

CPM and PERT are network-based methods for planning, scheduling, and controlling projects. CPM assumes deterministic activity durations while PERT assumes probabilistic durations. Each activity is represented by an arc in the network diagram. Critical path calculations involve forward and backward passes to determine earliest and latest occurrence times of events. Activities on the critical path cannot be delayed without delaying project completion.

Uploaded by

Potnuru Vinay
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 25

CPM and PERT

CPM and PERT CPM (Critical Path Method) and PERT (Program Evaluation and Review Technique) are network based methods designed to assist in the planning, scheduling, and control of projects. A project is a collection of interrelated activities with each activity consuming time and resources. The objective of CPM and PERT is to provide analytic means for scheduling the activities.

The two techniques, CPM and PERT which were developed independently, differ in that CPM assumes deterministic activity durations, whereas PERT assumes probabilistic durations. First we discuss CPM and then provide the details of PERT.

Network Representation
Each activity of the project is represented by an arc pointing in the direction of progress in the project. The nodes of the network establish the precedence relationships among the different activities of the project.

Two rules are available for constructing the network:


Rule 1: Each activity is represented by one, and only one arc. Rule 2: Each activity must be identified by two distinct end nodes.
1 A 2

Activity A has two end nodes: 1- start node, 2 end node

Use of dummy activity: To establish correct precedence relationships, dummy activities are used. A dummy activity, which is normally depicted by a dashed arc, consumes no time or resources. For example, if two activities that can start concurrently and have the same duration can be represented using a dummy activity as:

Or also as 2

A
1

A B
1

Dummy

B
Dummy

Rule 3: To maintain the correct precedence relationships, the following questions must be answered as each activity is added to the network:
(a) What activities must immediately precede the current activity? (b) What activities must follow the current activity? (c) What activities must occur concurrently with the current activity?

The answers to these questions may require the use of dummy activities to ensure correct precedence among the activities.

Problem 1 problem set 6.6A page 269


1.Construct the project network consisting of activities A to L with the following precedence relationships: (a) A, B and C, the first activities of the project, can be executed concurrently. (b) A and B precede D. (c) B precedes E, F and H.

(d) F and C precede G.


(e) E and H precede I and J.

(f) C, D, F and J precede K.


(g) K precede L. (h) I, G and L are the terminal activities of the project.

Figure for problem 1 problem set 6.6A E 2 B 1 A 3 C 4 5 6 J D 7 K

H
F

I
8 L 9

2. Construct the project network consisting of activities A to I with the following precedence relationships: (a)A and B, the first activities of the project start immediately.
(b) A and B precede C. (c) B precedes D and E. (d) A and B precede F. (e) F and D precede G and H.

(f) C and G precede I.


(g) E, H and I are terminal activities

2 A F
Dummy

C G

I
H 6

1
B

5
D

Critical Path Computations


The objective in CPM is the construction of time schedule for the project. To achieve this, we carry out computations that produce the following information: Total duration needed to complete the project

Classification of the activities of the project as critical and non-critical

An activity is said to be critical if there is no " leeway" in determining its start and finish times. A non-critical activity allows some scheduling slack, so that the start time of the activity can be delayed or advanced within limits without affecting the total completion time of the project.
To carry out the necessary computations, we define an event as a point in time at which some activities are terminated and others started. In terms of the network, an event corresponds to a node.

Given an event j, we define


ESj = LCj =
j

= earliest occurrence time of the event j.

j = Latest occurrence time of the event j. Dij = duration of the activity (i,j) The definitions of the earliest and latest occurrence times of the event j are specified relative to start and completion time of the project.

It is to be noted that the earliest occurrence time of the event j is the earliest time at which all the activities emanating from the node j can start. Similarly, the latest occurrence time of the event j is the latest time by which all activities that end at the node j must be completed.

The critical path calculations involve two passes:


the forward pass determines the earliest occurrence times of the events and the backward pass calculates their latest occurrence times .

Forward Pass (Earliest Occurrence Times):


The computations start at node 1 (the start node) and advance recursively to end node n. Initial step: We set ES1 = 0 (This means the project starts at time 0.)

General Step j: If (p, j), (q, j), , (v, j) are the activities ending at node j, we define
ESj = Max { ESp+ Dpj, ESq+ Dqj, , ESv+Dvj } The forward pass ends when ESn has been computed which is the duration of the project.

Backward Pass (Latest Occurrence Times):

The computations now start at node n (the end node) and advance recursively to start node 1.
Initial step: We set LCn = ESn General Step i: If (i, p), (i, q), , (i, v) are the activities starting at node i, we define LCi = Min { LCp- Dip, LCq- Diq, , LCv- Div } The backward pass ends when LC1 has been computed which is start time of the project.

Critical activity defined


Based on the preceding calculations, an activity (i, j) is called critical if:

ESi = LCi
ESj = LCj

ESj ESi = LCj LCi = Dij


Thus an activity (i, j) is critical if the earliest occurrence time and Latest occurrence time of its end nodes are the same and their difference is the duration of the activity.

A critical path of the project is a path comprising of critical activities of the project.
It is to be remembered that

a project can have more than one critical path, Any critical path will start at node 1 and will end at node n and that
The sum of the durations of the activities lying on a critical path is the duration of the project.

Determine the critical path of the project (network) given below. 6 6 3 3 5 5 2 0 3 7 13 0 3 13 6 1 3 4 6 2 2 6 3 2 6 2 2 4

19 19

Determine the critical path of the project (network) given below. 14 3 4 13 3 C 2 4 5 F 7 I 0 0 A G 6 3 7 4 Dummy 2 0 H 5 1 10

17 17

3 B
3 3 3

7 E

You might also like