Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Lecture 11 (Network Diagram)

    Uploaded by

    NUR SYAQIRAH TAJUDDIN
    The document discusses calculating critical path and float for a network diagram. It provides the following steps: 1. Draw the network diagram showing tasks, durations, and dependencies. 2. Determine the critical path by finding the longest path through the tasks. 3. Calculate early start, early finish, late start, and late finish times through forward and backward passes to determine float on each task. 4. Calculate the project float by subtracting the required end date from the critical path duration. If negative, the project may require crashing or fast-tracking.

    Copyright:

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

    Lecture 11 (Network Diagram)

    Uploaded by

    NUR SYAQIRAH TAJUDDIN
    6 views9 pages
    The document discusses calculating critical path and float for a network diagram. It provides the following steps: 1. Draw the network diagram showing tasks, durations, and dependencies. 2. Determine the critical path by finding the longest path through the tasks. 3. Calculate early start, early finish, late start, and late finish times through forward and backward passes to determine float on each task. 4. Calculate the project float by subtracting the required end date from the critical path duration. If negative, the project may require crashing or fast-tracking.

    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 document discusses calculating critical path and float for a network diagram. It provides the following steps: 1. Draw the network diagram showing tasks, durations, and dependencies. 2. Determine the critical path by finding the longest path through the tasks. 3. Calculate early start, early finish, late start, and late finish times through forward and backward passes to determine float on each task. 4. Calculate the project float by subtracting the required end date from the critical path duration. If negative, the project may require crashing or fast-tracking.

    Copyright:

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

    Lecture 11 (Network Diagram)

    Uploaded by

    NUR SYAQIRAH TAJUDDIN
    The document discusses calculating critical path and float for a network diagram. It provides the following steps: 1. Draw the network diagram showing tasks, durations, and dependencies. 2. Determine the critical path by finding the longest path through the tasks. 3. Calculate early start, early finish, late start, and late finish times through forward and backward passes to determine float on each task. 4. Calculate the project float by subtracting the required end date from the critical path duration. If negative, the project may require crashing or fast-tracking.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    You are on page 1of 9

    CRITICAL PATH

    & FLOAT
    DR AN NISHA NUR WELLIANA ABD RASED
    CALCULATING CRITICAL PATH &
    FLOAT FOR A NETWORK DIAGRAM
    TASK EARLY START EARLY
    NAME (ES) FINISH (EF)

    DURATION LATE START LATE FINISH


    (D) (LS) (LF)

    • Find out the length of all the paths in the network diagram
    • The longest path is the critical path
    • Float = EF - LF
    = ES - LS
    ARROW NETWORK BASED ON
    THE EVENTS GIVEN
    ACTIVITY DURATION (D) PRECEDED BY
    TASK 1 4 DAYS -
    TASK 2 5 DAYS TASK 1
    TASK 3 3 DAYS TASK 1
    TASK 4 7 DAYS TASK 3
    TASK 5 4 DAYS TASK 2 & TASK 4
    CALCULATING CRITICAL
    PATH & FLOAT FOR A
    NETWORK DIAGRAM
     Identify tasks, durations & dependencies.
    5 DAYS

    TASK 2
    4 DAYS
    4 DAYS
    TASK 5
    TASK 1

    3 DAYS 7 DAYS
    TASK 3 TASK 4
    STEP 1: DRAW A NETWORK DIAGRAM
    5 DAYS
    TASK 4 9
    2
    5 4 DAYS
    DAYS TASK 14 18
    4 DAYS 5
    TASK 0 4 4
    1 DAYS
    4
    DAYS

    3 DAYS 7 DAYS
    TASK 4 7 TASK 7 14
    3 4
    3 7
    DAYS DAYS

     Task 5 is dependent on Task 2 and Task 4 being complete.


     So, ES for Task 5 is 14 days (dependent on Task 4, which is the longer task.
    STEP 2: DETERMINE CRITICAL PATH
     To determine critical path, calculate length (durations) of all the paths:

     Length of all tasks:

     Task1 → Task2 → Task5 = 4 + 5 + 4 = 13 days

     Task1 → Task3 → Task4 → Task5 = 4 + 3 + 7 + 4 = 18 days

     The longest path is the critical path

     Critical path = longest path = 18 days

     Critical Path = Task1 → Task3 → Task4 → Task5


    STEP 3: CALCULATE FLOAT IN ALL TASKS
    ES = Early Start – BACKWARD PASS
    EF = Early Finish
    5 DAYS
    LS = Late Start TASK 4 9
    2
    LF = Late Finish 5 9 14 4 DAYS
    DAYS TASK
    5
    14 18
    4 DAYS
    TASK 4 14 18
    1
    0 4 DAYS

    4 0 4
    DAYS

    3 DAYS 7 DAYS
    TASK 4 7 TASK 7 14
    3 4
    3 4 7 7 7 14
    DAYS DAYS

     For all tasks on Critical Path (Task1, Task 3, Task 4, Task 5), EF = LF & ES = LS
     Thus, float (slack) for tasks on Critical Path = LF – EF = 0
     Float for Task 2 = LF – EF = 14 – 9 = 5 days
    STEP 4: CALCULATE PROJECT FLOAT
     Customer requests an end date of 25 days.
     Project Float is the total amount of time that the project can be delayed without
    delaying the project completion date required by the customer.
     25 days – 18 days = 7 days.
     Project float can be negative when the date imposed by the customer is before the
    duration required in the project schedule.
     For negative project float, the project must be crashed or fast-tracked.
     Crashing is a technique used to decrease the duration of the project by assigning
    additional resources to tasks and decreasing the duration required for those tasks.
     Fast Tracking is a technique used to shorten project time by scheduling some activities
    concurrently that were originally scheduled sequentially.
    THANK YOU……

    You might also like