Scribd
Upload
55 views10 pages

Assignment 1 Name: Vinay Kumar Roll No.: GCET/229/17 Semester: 8 Branch: Mechanical Subject: Production Planning & Control

Vinay Kumar is a mechanical engineering student in the 8th semester working on a project about production planning and control. The document discusses the critical path method (CPM) for project scheduling. CPM involves identifying all tasks, their durations, dependencies and logical endpoints to build a network diagram. The critical path is identified by calculating the earliest start time (EST) moving forward and latest finish time (LFT) moving backward through the network. Activities with equal EST and LFT define the critical path, which must be completed on schedule for the project to finish on time.

Uploaded by

Vinay Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
55 views10 pages

Assignment 1 Name: Vinay Kumar Roll No.: GCET/229/17 Semester: 8 Branch: Mechanical Subject: Production Planning & Control

Vinay Kumar is a mechanical engineering student in the 8th semester working on a project about production planning and control. The document discusses the critical path method (CPM) for project scheduling. CPM involves identifying all tasks, their durations, dependencies and logical endpoints to build a network diagram. The critical path is identified by calculating the earliest start time (EST) moving forward and latest finish time (LFT) moving backward through the network. Activities with equal EST and LFT define the critical path, which must be completed on schedule for the project to finish on time.

Uploaded by

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

Assignment 1

Name: Vinay Kumar


Roll no.: GCET/229/17
Semester: 8 th

Branch: Mechanical
Subject: Production Planning
& Control
Early & Finish Time of CPM
Analysis

CPM:
The critical path method (CPM) is a project modeling
technique developed in the late 1950s by Morgan R. Walker
of DuPont and James E. Kelley, Jr. of Remington Rand.
Kelley and Walker related their memories of the development
of CPM in 1989. Kelley attributed the term "critical path" to
the developers of the Program Evaluation and Review
Technique which was developed at about the same time by
Booz Allen Hamilton and the U.S. Navy. The precursors of
what came to be known as Critical Path were developed and
put into practice by DuPont between 1940 and 1943 and
contributed to the success of the Manhattan Project. CPM is
commonly used with all forms of projects, including
construction, aerospace and defense, software development,
research projects, product development, engineering, and
plant maintenance, among others. Any project with
interdependent activities can apply this method of
mathematical analysis. Although the original CPM program
and approach is no longer used, the term is generally applied
to any approach used to analyze a project network logic
diagram.
The essential technique for using CPM is to construct a model
of the project that includes the following:
1. A list of all activities required to complete the project
(typically categorized within a work breakdown structure),
2. The time (duration) that each activity will take to complete,
3. The dependencies between the activities and,
4. Logical end points such as milestones or deliverable items.
A simple network diagram is shown below using an example:
A business wishes to build a new factory
Before it can do so it needs to:
1. Buy the land (Activity A- will take 12 weeks)
2. Draw up Plans (activity B- will take 3 weeks)
A simple network may be drawn to illustrate this scenario:

The main reason for drawing a network is to identify the


CRITICAL activities. To do this we must calculate the earliest
time at which given activity can start. This is called the
Earliest Start Time (EST) of the activity. It is calculated using
the formula:

To identify the CRITICAL activities we must also know the


latest time at which any given activity must end. This is called
the Latest Finishing Time (LFT) of the activity.It is calculated
by working BACKWARDS across the network using the
following formula:

Basic Scheduling Computations


The notations used are
(i, j) = Activity with tail event i and head event j
Ei = Earliest occurrence time of event i
Lj = Latest allowable occurrence time of event j
Dij = Estimated completion time of activity (i, j)
(Es)ij = Earliest starting time of activity (i, j)
(Ef)ij = Earliest finishing time of activity (i, j)
(Ls)ij = Latest starting time of activity (i, j)
(Lf)ij = Latest finishing time of activity (i, j)
The procedure is as follows:

1. Determination of Earliest time (Ej): Forward Pass


computation
 Step 1 The computation begins from the start node and
move towards the end node. For easiness, the forward pass
computation starts by assuming the earliest occurrence time of
zero for the initial project event.
 Step 2
i. Earliest starting time of activity (i, j) is the earliest event
time of the tail end event i.e. (Es)ij = Ei
ii. ii. Earliest finish time of activity (i, j) is the earliest
starting time + the activity time i.e. (Ef)ij = (Es)ij + Dij or
(Ef)ij = Ei + Dij
iii. Earliest event time for event j is the maximum of the
earliest finish times of all activities ending in to that
event i.e. Ej = max [(Ef)ij for all immediate predecessor
of (i, j)] or Ej =max [Ei + Dij]

2. Backward Pass computation (for latest allowable


time)
 Step 1
For ending event assume E = L. Remember that all E’s have
been computed by forward pass computations.
 Step 2
Latest finish time for activity (i, j) is equal to the latest event
time of event j i.e. (Lf)ij = Lj
 Step 3
Latest starting time of activity (i, j) = the latest completion
time of (i, j) – the activity time or (Ls)ij =(Lf)ij - Dij or (Ls)ij =
Lj - Dij
 Step 4
Latest event time for event ‘i’ is the minimum of the latest
start time of all activities originating from that event i.e. Li =
min [(Ls)ij for all immediate successor of (i, j)] = min [(Lf)ij -
Dij] = min [Lj - Dij].

In this section you will see how this can be used to find the
critical path. This will first involve finding the earliest
possible start for each activity, by going forwards through the
network. Secondly, the latest possible start time for each
activity is found by going backwards through the network.
Activities which have equal earliest and latest start time are on
the critical path. The technique will be illustrated using the
following sample problem:
The numbers in the top half of each circle will indicate the
earliest possible starting time. So, for activities A, B and C,
the number zero is inserted.

Moving forward through the network, the activity E is reached


next. Since both A and B have to be completed before E can
be started, the earliest start time for E is 7. This is put into the
top half of the circle at E. The earliest times at D and G are
then both 17, and for H, 22. Since F cannot be started until
both D and G are completed, its earliest start time is 25, and
consequently, 27 for I. The earliest start time for J is then 29,
which gives an earliest completion time of 32.
Since 32 is the earliest possible completion time, it is also
assumed to be the completion time in order to find the latest
possible start times. So 32 is also put in the lower half of the
finish' circle. Now working backwards through the network,
the latest start times for each activity are as follows:
J 32-3=29

I 29-2=27

F 27-2=25

H 32-8=24

D 25-8-17

G the minimum of 25-5=20 and 24-5=19

E the minimum of 17-10-7 and 19-10=9

A 7-7=0

B 7-2=5

C 27-15=12
This gives a completed network as shown below:

The vertices with equal earliest and latest starting times define
the critical path. This is clearly seen to be

AEDFIJ
Some important points:
• The EST of the first activity is always zero.
• Calculate the EST by working left to right across a
network.
• It is calculated using the following formula:
EST = EST of Previous activity + Duration of previous
activity
• When there are 2 simultaneous activities the HIGHEST
figure is used as the EST.
• The LFT of the last activity is always equal to its EST.
• The LFT of the first activity is always zero.
• Calculate the LFT by working right to left across a
network.
• It is calculated using the following formula:
LFT = LFT at end of following activity - Duration of
following activity
• When there are 2 simultaneous activities the LOWEST
figure is used as the LFT.

You might also like