Scribd Logo
Upload

Welcome to Scribd!

  • 45 views

    Critical Path: Vazi Okhandiar

    Uploaded by

    ThuTaNaing
    The critical path method is a technique for scheduling a set of project activities. It was developed in the late 1950s and involves identifying the longest continuous chain of tasks in a project network diagram required to complete the project on time. The critical path is determined by performing forward and backward passes to calculate early and late start/finish times for each task, and identifying the tasks with zero float which constitute the longest duration path through the project.

    Copyright:

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

    Critical Path: Vazi Okhandiar

    Uploaded by

    ThuTaNaing
    45 views13 pages
    The critical path method is a technique for scheduling a set of project activities. It was developed in the late 1950s and involves identifying the longest continuous chain of tasks in a project network diagram required to complete the project on time. The critical path is determined by performing forward and backward passes to calculate early and late start/finish times for each task, and identifying the tasks with zero float which constitute the longest duration path through the project.

    Original Description:

    CPM Method

    Original Title

    criticalpath

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The critical path method is a technique for scheduling a set of project activities. It was developed in the late 1950s and involves identifying the longest continuous chain of tasks in a project network diagram required to complete the project on time. The critical path is determined by performing forward and backward passes to calculate early and late start/finish times for each task, and identifying the tasks with zero float which constitute the longest duration path through the project.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    45 views13 pages

    Critical Path: Vazi Okhandiar

    Uploaded by

    ThuTaNaing
    The critical path method is a technique for scheduling a set of project activities. It was developed in the late 1950s and involves identifying the longest continuous chain of tasks in a project network diagram required to complete the project on time. The critical path is determined by performing forward and backward passes to calculate early and late start/finish times for each task, and identifying the tasks with zero float which constitute the longest duration path through the project.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 13

    Critical Path

    Vazi Okhandiar, PMP, MCT, MBA, MSCS, BSEE

    NR Computer Learning Center


    1835 W. Orangewood, #200
    Orange . CA 92868
    (714) 505-3475
    www.nrclc.com
    Critical Path Method (CPM)
    The critical path method is a project modeling technique
    developed in the late 1950s by Morgan R. Walker of DuPont
    and James E. Kelley, Jr. of Remington Rand. - Wikipedia
    Critical Path
    The critical path method was examined by the United States
    Navy, and established a version in 1958 called a PERT
    (Program Evaluation and Review Technique) analysis. PERT
    claimed to reduce project management time by up to 42
    percent, and was first used in the development of the Polaris
    missile.

    Ref: http://www.ehow.com/about_4703555_what-critical-
    path.html#ixzz2igTEV3Q7
    Critical Path
    A Critical Path is the path with the least amount of float or
    slack time. A float time is the amount of time that an activity
    can be delayed without delaying the project.
    A Critical Path is the longest amount of time it will take to
    complete the project.
    A Critical Path usually has 0 float but may have negative float
    if the end task is constrained to an early finish date.
    If any of the task identified in the critical path is late, then the
    project will be late.
    6. Steps for identifying Critical Path
    1. Specify the activates, duration and dependencies
    2. Draw a network diagram.
    3. Perform the forward pass to identify all Early Start and Early Finish times for
    the network.
    Early Finish = Early Start + Duration

    4. Perform the backward pass to identify all Late Start and Late Finish times
    for the network.
    Late Start = Late Finish Duration

    5. Calculate the slack time.


    Float = Late Start (LS) Early Start (ES)

    6. Identify the task on critical path with 0 float (slack) time.


    1. Task/Duration/Predecessor
    TASK Duration Predecessor

    A 2 ----
    B 2 A
    C 1 A
    D 3 A
    E 1 C,D
    F 3 B
    G 2 E,F
    Terminologies
    ID Task ID
    D- Duration
    ES Early Start
    EF Early Finish
    LS Late Start ES EF
    LF Late Finish F ID DR
    S - Slack
    LS LF
    2. Network Diagram

    B 2 F 3

    Activity

    A 2 C 1 G 2

    Duration

    ES EF

    D 3 E 1 F ID DR

    LS LF
    3. Forward Pass
    2 4 4 7
    B 2 F 3

    Early Early
    Start Finish Duration= 9days
    7 9
    0 2 2 3
    G 2
    A 2 C 1

    2 5 5 6
    ES EF
    D 3 E 1
    1sttask starts at 0 F ID DR
    EF = ES + DR
    LS LF
    ES = EF of predecessor
    When more than one predecessor, pick the larger #
    4. Backward Pass
    2 4 4 7
    B 2 F 3
    2 4 4 7
    1st task should end
    with LS = 0.
    2 3 7 9
    0 2
    C 1 G 2
    A 2
    5 6 7 9
    0 2

    Late Late
    Start Finish

    2 5 5 6 ES EF
    D 3 E 1 F ID DR
    LS = LF - DR 3 6 6 7 LS LF
    LF = LS of successor

    When more than one successor, pick the smallest #


    5. Slack / Float
    2 4 4 7
    0 B 2 0 F 3
    2 4 4 7

    7 9
    0 2 2 3
    0 G 2
    0 A 2 3 C 1
    7 9
    0 2 5 6
    Float = LS ES

    2 5 5 6 ES EF
    1 D 3 1 E 1 F ID DR
    3 6 6 7 LS LF

    Float = Late Start (LS) Early Start (ES)


    6. Critical Path
    The path with 0 Float is 4 7
    2 4
    the critical path.
    0 B 2 0 F 3
    2 4 4 7

    A-B-F-G is the critical path.


    7 9
    0 2 5 6
    0 A 2 0 C 1 0 G 2
    0 2 5 6 7 9

    2 5 5 6 ES EF

    0 D 3 1 E 1 F ID DR

    2 5 6 7 LS LF

    LS = LF - DR
    LF = LS of successor
    Thank You!
    Vazi Okhandiar, PMP, MCT, MBA, MSCS, BSEE
    NR Computer Learning Center
    1835 W. Orangewood, Suite 200
    Orange, CA 92868
    www.nrclc.com . (714) 505. 3475
    [email protected]

    You might also like