Scribd
Upload
51 views23 pages

Planning Engineering & Project Management: Lecturer: Engr. Afshan Naseem

This lecture discusses critical path analysis for project planning and management. It provides an example network diagram with 7 activities and calculates the earliest start, earliest finish, latest start, and latest finish dates for each activity. It identifies the critical path with 0 slack as A-B-D-E-G-F, which is the longest path through the network and determines the shortest time to project completion. The lecture also discusses computing slack and identifying the critical path for another example network with 5 activities. It introduces new notation for representing the start and finish dates in a linear schedule and works through an example of this.

Uploaded by

Junaid Y
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 PPTX, PDF, TXT or read online on Scribd
51 views23 pages

Planning Engineering & Project Management: Lecturer: Engr. Afshan Naseem

This lecture discusses critical path analysis for project planning and management. It provides an example network diagram with 7 activities and calculates the earliest start, earliest finish, latest start, and latest finish dates for each activity. It identifies the critical path with 0 slack as A-B-D-E-G-F, which is the longest path through the network and determines the shortest time to project completion. The lecture also discusses computing slack and identifying the critical path for another example network with 5 activities. It introduces new notation for representing the start and finish dates in a linear schedule and works through an example of this.

Uploaded by

Junaid Y
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 PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 23

LECTURE NO.

PLANNING ENGINEERING & PROJECT MANAGEMENT


LECTURER:

ENGR. AFSHAN NASEEM

DEPARTMENT OF ENGINEERING MANAGEMENT, COLLEGE OF E&ME, NUST

CRITICAL PATH ANALYSIS

CRITICAL PATH ANALYSIS

Provides activity information

Earliest (ES) & latest (LS) start Earliest (EF) & latest (LF) finish Slack (S): Allowable delay

Identifies critical path

Longest path in network Shortest time project can be completed Any delay on activities delays project Activities have 0 slack

CRITICAL PATH ANALYSIS EXAMPLE


Event ID Pred. None Description Prepare Site Pour fdn. & frame Buy shrubs etc. Roof Do interior work Landscape Move In Time (Wks)

A B C D E F G

A B B D C E,F

1 6 3 2 3 4 1

NETWORK SOLUTION

B A
1

D
2

E
3

G
1

C
3

F
4

EARLIEST START & FINISH STEPS


Begin at starting event & work forward ES = 0 for starting activities

ES is earliest start EF is earliest finish

EF = ES + Activity time

ES = Maximum EF of all predecessors for non-starting activities

ACTIVITY A EARLIEST START SOLUTION

Activity A B C D E F

ES 0

EF 1

LS

LF

Slack

B A
1
6

D
2

E
3

G
1

C
3

F
4

For starting activities, ES = 0.

EARLIEST START SOLUTION

Activity A B C D E F G

ES 0 1 1 7 9 4 12

EF 1 7 4 9 12 8 13

LS

LF

Slack

B A
1
6

D
2

E
3

G
1

C
3

F
4

LATEST START & FINISH STEPS


Begin at ending event & work backward LF = Maximum EF for ending activities

LF is latest finish; EF is earliest finish LS is latest start

LS = LF - Activity time

LF = Minimum LS of all successors for non-ending activities

EARLIEST START SOLUTION

Activity A B C D E F G

ES 0 1 1 7 9 4 12

EF 1 7 4 9 12 8 13

LS

LF

Slack

B
A
6 1 C 3

D E
2 3 G F 1 4
13

LATEST FINISH SOLUTION

Activity ES EF A 1 B0 D E B A 61 2 7 3 C 1 1 4 C F D 7 9 3 4 E 9 12 F 4 8 G 12 13

G 1

LS 0 1 4 7 9 7 12

LF 1 7 7 9 12 12 13

Slack

COMPUTE SLACK

Activity A B C D E F G

ES 0 1 1 7 9 4 12

EF 1 7 4 9 12 8 13

LS 0 1 5 7 9 8 12

LF 1 7 8 9 12 12 13

Slack 0 0 4 0 0 4 0

CRITICAL PATH

B A 1 6

D 2

E 3 G

C
3

F
4

NEW NOTATION
ES EF

C7
LS LF Compute ES, EF for each activity, Left to Right Compute, LF, LS, Right to Left

EXAMPLE

C7 A 21 B5 D2

F8 G2 E5

EXAMPLE
21 28 28 36

C7
0 21

F8
36 38

A 21
21 26 26 28 28 33

G2 B5 D2 E5

F cannot start until C and D are done. G cannot start until both E and F are done.

EXAMPLE
21
21 21 21 21 21 26 26 26 26 28 28 28 31 33 36

28
28

28
28

36
36 36 36 38 38

C7
0 0

F8 G2

A 21 B5 D2 E5

E just has to be done in time for G to start at 36, so it has slack. D has to be done in time for F to go at 28, so it has no slack.

PROBLEM
Event ID Pred. None Description Prepare Site Pour fdn. & frame Buy shrubs etc. Roof Do interior work Landscape Move In Time (Wks)

A B C D E F G

A B B D C E,F

21 5 7 2 5 8 2

18

PROBLEM
21
21 21 21 21 21 26 26 26 26 28 28 28 31 33 36

28
28

28
28

36
36 36 36 38 38

C7
0 0

F8 G2

A 21 B5 D2 E5

PROBLEM
Event ID Pred. None Time (Wks)

1 2 3 4 5 6 7

1 None 3 1 2 4,5,6

8 6 4 9 11 3 1

20

PROBLEM

DISCUSSION

22

Assignment no.2 Draw a Gantt chart for the following project. A batch of mobile phones is to build within 1st January 2013 to 31st December 2013. No work will be done during following period: 15th June 10th July 7th October 9th November Note: Think of minimum 15 activities to build a car. Minimum 4 activities must be overlapping. No work will be done on weekends. Construct a Gantt chart and calculate total no. of days to finish this project with time frame. Due Date: 22nd November,2012

23

Engr.Afshan Naseem

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