Consider a project with following sequence of activities Act

Consider a project with following sequence of activities: Activity Predecessor Time (days) 2 10 A,D E,F 1. A 2. B 13 3. C

Solution

The precedence diagram as follows :

                                 A

                              B

                                      C

                             D

                                      F

                                                         E

                                                                                                   G

The possible paths and their corresponding durations as follows :

A-E-G = 2 + 3 + 8 = 13 days

B-D-E-G = 5 + 10 + 3 + 8 = 26 days

C-F-G = 1 + 6 + 8 = 15 days

The critical path ( i.e. the path with longest duration ) is B-D-E-G

Project completion time ( i.e. duration of critical path ) = 26 days

It is to be noted that Slack for activities on Critical Path namely B, D, E and G are ZERO

Slack for activity A = Duration of B-D-E-G – Duration of A-E-G = 26 – 13 = 13 days

Slack for activity C, F = Duration fo B-D-E-G – Duration of C-F-G = 26 – 15 = 11 days

ACTIVITY

SLACK TIME ( DAYS)

A

13

B

0

C

11

A	B	C
D	F
E
G