100% found this document useful (3 votes)
2K views

Critical Path Method Problem

This document provides a Critical Path Method (CPM) problem to solve using the provided activity dependencies and durations table. The problem asks 7 questions: 1) The minimum time to complete the project is 18 days. 2) The critical path is BFEGJ. 3) The early start for activity E is 6 days. 4) The late start for activity A is 4 days. 5) The late finish for activity F is 6 days. 6) The total float for activity H is 4 days. 7) The free float between activities D and G is 1 day.

Uploaded by

haznawi
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
100% found this document useful (3 votes)
2K views

Critical Path Method Problem

This document provides a Critical Path Method (CPM) problem to solve using the provided activity dependencies and durations table. The problem asks 7 questions: 1) The minimum time to complete the project is 18 days. 2) The critical path is BFEGJ. 3) The early start for activity E is 6 days. 4) The late start for activity A is 4 days. 5) The late finish for activity F is 6 days. 6) The total float for activity H is 4 days. 7) The free float between activities D and G is 1 day.

Uploaded by

haznawi
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Critical Path Method (CPM) Problem Question Using the table of data provided, answer the following questions:

: 1. What is the minimum time required to complete the project?


Activity Dependencies Duration

A B C D E F G H I J

A, F B C, D, E D, G E G

2 2 4 8 3 4 3 2 7 6

2. What is the Critical Path for this project?

3. What is the Early Start (ES) date for activity E?

4. What is the Late Start (LS) date for activity A?

5. What is the Late Finish (LF) date for activity F?

6. What is the Total Float / Slack for activity H?

7. What is the Free Float / Slack between activities D & G?

Example prepared by Bradford Peyton Oct 2008

Critical Path Method (CPM) Problem Solution


4 0 4 0 2 6 6 6 2 9 9 9 11

A 2

E 3

I 7

16 18

0 0 0

0 2 2 2 2

B 2

F 4

6 6

S
0 5

0 4 9 9 9

0 12 12 12 12

F
18 18

C 4

G 3

J 6

1 0 1

4 8 9 12 16

D 8

H 2

14 18

Free Float/Slack = Answers =

Early Start (successor) Early Finish (predecessor) (1) 18 days / (2) BFEGJ / (3) 6 days / (4) 4 days / (5) 6 days / (6) 4 days / (7) 1 day

Example prepared by Bradford Peyton Oct 2008

You might also like