Scribd Logo
Upload

Welcome to Scribd!

  • To Find The Critical Path OR

    Uploaded by

    Saif Suleman
    12 views7 pages
    The critical path of a project network is the longest sequence of connected activities that determines the minimum overall project duration. It identifies the most critical activities, where delays cannot be absorbed and will extend the project finish time. To find the critical path, one must analyze the activity relationships and durations in a project graph like an Activity on Node diagram to identify the longest path of connected tasks from start to finish.

    Original Description:

    Original Title

    Lecture 6 OR.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The critical path of a project network is the longest sequence of connected activities that determines the minimum overall project duration. It identifies the most critical activities, where delays cannot be absorbed and will extend the project finish time. To find the critical path, one must analyze the activity relationships and durations in a project graph like an Activity on Node diagram to identify the longest path of connected tasks from start to finish.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views7 pages

    To Find The Critical Path OR

    Uploaded by

    Saif Suleman
    The critical path of a project network is the longest sequence of connected activities that determines the minimum overall project duration. It identifies the most critical activities, where delays cannot be absorbed and will extend the project finish time. To find the critical path, one must analyze the activity relationships and durations in a project graph like an Activity on Node diagram to identify the longest path of connected tasks from start to finish.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    TO FIND THE

    CRITICAL PATH

    Lecture 6

    OR
    THE CRITICAL PATH
    So far we have listed all the activities with their precedence relationship we’ve projected these
    activities in a project graph represented by arrows or Activity On Node diagram (AON).
    Now we have to find the minimum time required for completion of the entire project. For this we
    must find the longest path with the sequence of connected activities through the network. This is
    called the critical path of the network and its length determines the time for completion of the
    project.
    The activities in the critical path are so critical that, if they are delayed, the project completion
    date cannot be met and the project finish time will have to be extended.
    We shall now see how to identify the critical path, the critical activities and the duration of the
    project. The meaning of path and length of a path should first be made clear.
    Let us take following example.

    You might also like