Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Chapter 6 (B) CPM CE - Example 2

    Uploaded by

    sing bling
    This document discusses how to perform critical path method (CPM) analysis on a project network diagram. It provides the steps to calculate early start, early finish, late start, late finish, total slack and free slack for each activity. It also identifies the critical and non-critical paths in the network.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    Chapter 6 (B) CPM CE - Example 2

    Uploaded by

    sing bling
    7 views9 pages
    This document discusses how to perform critical path method (CPM) analysis on a project network diagram. It provides the steps to calculate early start, early finish, late start, late finish, total slack and free slack for each activity. It also identifies the critical and non-critical paths in the network.

    Original Description:

    critical path method analsis

    Original Title

    Chapter 6 (b) CPM CE_Example 2

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses how to perform critical path method (CPM) analysis on a project network diagram. It provides the steps to calculate early start, early finish, late start, late finish, total slack and free slack for each activity. It also identifies the critical and non-critical paths in the network.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    7 views9 pages

    Chapter 6 (B) CPM CE - Example 2

    Uploaded by

    sing bling
    This document discusses how to perform critical path method (CPM) analysis on a project network diagram. It provides the steps to calculate early start, early finish, late start, late finish, total slack and free slack for each activity. It also identifies the critical and non-critical paths in the network.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 9

    Critical Path Method Analysis

    (CPM)
    Calculate ES, EF, LS, LF, TS, FS after drawing network
    diagram. Show your results in tabular form also.

    Activity Predecessor Duration


    A 0 5
    B 0 3
    C A 8
    D A, B 7
    E 0 7
    F C, D, E 4
    G F 5
    Network Diagram
    Activity Predecessor Duration
    A 0 5
    A, 5 C, 8 B 0 3
    C A 8
    D A, B 7
    E 0 7
    F C, D, E 4
    G F 5

    Start, 0 B, 3 D, 7 F, 4 G, 5 End, 0

    E, 7
    Early Times:
    ES = 0, EF = 5 ES = 5, EF = 13
    Early Start (ES) = Max (EF of
    predecessor activity)

    A, 5 C, 8
    Early Finish (EF) = ES (Current
    activity) + Duration of current
    activity

    ES = 0, EF = 0 ES = 0, EF = 3 ES = 5, EF = 12 ES = 13, EF = 17 ES = 17, EF = 22 ES = 22, EF = 22

    Start, 0 B, 3 D, 7 F, 4 G, 5 End, 0

    ES = 0, EF = 7

    E, 7
    Late Times:
    ES = 0, EF = 5 ES = 5, EF = 13 1.Late Finish (LF) = Min (LS of
    LS = 0, LF = 5 LS = 5, LF = 13
    successor activity)

    A, 5 C, 8
    2.Late Start (LS) = LF (Current
    activity) – Duration of current
    activity

    ES = 0, EF = 0 ES = 0, EF = 3 ES = 5, EF = 12 ES = 13, EF = 17 ES = 17, EF = 22 ES = 22, EF = 22


    LS = 0, LF = 0 LS = 3, LF = 6 LS = 6, LF = 13 LS = 13, LF = 17 LS = 17, LF = 22 LS = 22, LF = 22

    Start, 0 B, 3 D, 7 F, 4 G, 5 End, 0

    ES = 0, EF = 7
    LS = 6, LF = 13

    E, 7
    Total Slack = LF – EF or LS – ES
    ES = 0, EF = 5 ES = 5, EF = 13 “Total slack is the duration of an activity
    LS = 0, LF = 5 LS = 5, LF = 13
    TS = 0 TS = 0
    for which if it is delayed there will be no
    effect on project’s deadline”.
    A, 5 C, 8

    ES = 0, EF = 0 ES = 0, EF = 3 ES = 5, EF = 12 ES = 13, EF = 17 ES = 17, EF = 22 ES = 22, EF = 22


    LS = 0, LF = 0 LS = 3, LF = 6 LS = 6, LF = 13 LS = 13, LF = 17 LS = 17, LF = 22 LS = 22, LF = 22
    TS = 0 TS = 3 TS = 1 TS = 0 TS = 0 TS = 0

    Start, 0 B, 3 D, 7 F, 4 G, 5 End, 0

    ES = 0, EF = 7
    LS = 6, LF = 13
    TS = 6

    E, 7
    Free Slack =
    ES = 0, EF = 5 ES = 5, EF = 13
    LS = 0, LF = 5 LS = 5, LF = 13
    TS = 0, FS = 0 TS = 0, FS = 0
    Min (ES of successor activity) – EF
    (current activity)
    A, 5 C, 8 1. “Free slack is the duration of an activity for
    which if it is delayed there will be no effect
    on project’s deadline”.
    2. “It is the duration of an activity for which if
    it is delayed there will be no effect on the
    start of immediate successor/s activity/s”.

    ES = 0, EF = 0 ES = 0, EF = 3 ES = 5, EF = 12 ES = 13, EF = 17 ES = 17, EF = 22 ES = 22, EF = 22


    LS = 0, LF = 0 LS = 3, LF = 6 LS = 6, LF = 13 LS = 13, LF = 17 LS = 17, LF = 22 LS = 22, LF = 22
    TS = 0, FS = 0 TS = 3, FS = 2 TS = 1, FS = 1 TS = 0, FS = 0 TS = 0, FS = 0 TS = 0, FS = 0

    Start, 0 B, 3 D, 7 F, 4 G, 5 End, 0

    ES = 0, EF = 7
    LS = 6, LF = 13
    TS = 6, FS = 6

    E, 7
    ES = 0, EF = 5 ES = 5, EF = 13 Paths’ length:
    LS = 0, LF = 5 LS = 5, LF = 13
    TS = 0, FS = 0 TS = 0, FS = 0
    1. Start, A, C, F, G, End = 22

    2. Start, A, D, F, G, End = 21
    A, 5 C, 8
    3. Start, B, D, F, G, End = 19

    4. Start, E, F, G, End = 16

    ES = 0, EF = 0 ES = 0, EF = 3 ES = 5, EF = 12 ES = 13, EF = 17 ES = 17, EF = 22 ES = 22, EF = 22


    LS = 0, LF = 0 LS = 3, LF = 6 LS = 6, LF = 13 LS = 13, LF = 17 LS = 17, LF = 22 LS = 22, LF = 22
    TS = 0, FS = 0 TS = 3, FS = 2 TS = 1, FS = 1 TS = 0, FS = 0 TS = 0, FS = 0 TS = 0, FS = 0

    Start, 0 B, 3 D, 7 F, 4 G, 5 End, 0

    ES = 0, EF = 7 Critical Path:
    LS = 6, LF = 13 1. Start, A, C, F, G, End
    TS = 6, FS = 6
    Non Critical Paths:
    1. Start, A, D, F, G, End = 21
    E, 7
    2. Start, B, D, F, G, End = 19

    3. Start, E, F, G, End = 16
    CPM

    You might also like