Question

Consider the following project network and activity times (in weeks): Start Finish Activity | A B C D E F G H Time 5 37 6 7 310 8 a. Identify the critical path. b. How much time will be needed to complete this project? c. Can activity D be delayed without delaying the entire project? If so, by how many weeks? d. Can activity C be delayed without delaying the entire project? If so, by how many weeks? What is the schedule for activity E? e.

Answer 1

1. A - D - F - H

2. 22

3. NO, activity D is on the critical path.

4. YES, slack of C = 2

5. In the table below.

EXPLANATION

To utilize the CPM method, we will make use of a forward and backward pass of the project diagram and the activities to find the ES, EF, LS, and LF values.

The ES, EF values are calculated using a forward pass where the ES of the next activity is the maximum EF of all the predecessor activities.

The LS, LF values are calculated using a backward pass where the LS of the next activity is the minimum LF of all the predecessor activities.

ACTIVITY	TIME	ES	EF	LS	LF	SLACK
A	5	0	5	0	5	0
B	3	0	3	1	4	1
C	7	5	12	7	14	2
D	6	5	11	5	11	0
E	7	3	10	4	11	1
F	3	11	14	11	14	0
G	10	11	21	11	21	0
H	8	14	22	14	22	0

DURATION = CPM = A - D - F - H = 22