Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 63 views

    55CPM

    Uploaded by

    limulsa78
    This document provides instructions for completing a critical path method (CPM) diagram and analysis. It describes how to: 1) enforce prerequisite tasks from the final tasks backwards; 2) remove redundant dummy tasks and events; 3) enter data for each task in a PERT chart; 4) determine earliest and latest start/completion times in forward and backward passes; 5) calculate total float, free float, and critical tasks with zero total float.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    55CPM

    Uploaded by

    limulsa78
    63 views9 pages
    This document provides instructions for completing a critical path method (CPM) diagram and analysis. It describes how to: 1) enforce prerequisite tasks from the final tasks backwards; 2) remove redundant dummy tasks and events; 3) enter data for each task in a PERT chart; 4) determine earliest and latest start/completion times in forward and backward passes; 5) calculate total float, free float, and critical tasks with zero total float.

    Original Description:

    kkk

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides instructions for completing a critical path method (CPM) diagram and analysis. It describes how to: 1) enforce prerequisite tasks from the final tasks backwards; 2) remove redundant dummy tasks and events; 3) enter data for each task in a PERT chart; 4) determine earliest and latest start/completion times in forward and backward passes; 5) calculate total float, free float, and critical tasks with zero total float.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    63 views9 pages

    55CPM

    Uploaded by

    limulsa78
    This document provides instructions for completing a critical path method (CPM) diagram and analysis. It describes how to: 1) enforce prerequisite tasks from the final tasks backwards; 2) remove redundant dummy tasks and events; 3) enter data for each task in a PERT chart; 4) determine earliest and latest start/completion times in forward and backward passes; 5) calculate total float, free float, and critical tasks with zero total float.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 9

    CPM Hint #3

    Tasks which have identical prerequisite sets have the same Tail Event

    CPM Hint #4
    Starting with the Final Tasks, work backwards, enforcing the smallest prerequisite sets first. Use Dummy Tasks to enforce any prerequisites in large sets which have already been enforced in a smaller set.

    Finish CPM Diagram


    Remove all redundant Dummy Tasks Remove all redundant Events Number all remaining events Not really finished . . havent identified critical tasks yet.

    Generate PERT Chart: Enter Data for Each Task


    Task Symbol Tail Event Head Event Task Duration (TD)

    Forward Pass: Determine Earliest Start (ES) and Earliest Complete (EC) for each Task
    For all Initial Tasks, ES = 0 Once ES is Determined, EC equals ES plus TD. The ES for all tasks with tail [i] is equal to the largest value of EC for all tasks with head [i]. PC is the largest value of EC for all Final Tasks.

    Backward Pass: Determine Latest Start (LS) and Latest Complete (LC) for each Task
    For all Final Tasks, LC = PC Once LC is Determined, LS equals LC minus TD. The LC for all tasks with head [j], is equal to the smallest value of LS for all tasks with tail [j]. At least one Initial Task must have LS = 0; none may be negative.

    Determine Total Float (TF): Allowable delay in start of task which will not delay Project Completion
    For task with tail [i] and head [j], TF[i,j] = (LC[j] ES[i]) TD[i,j] ES[i] is earliest start for all tasks with tail [i]. LC[j] is latest complete for all tasks with head [j].

    Determine Free Float (FF): Allowable delay in start of task which will not delay start of any other task.
    For task with tail [i] and head [j], FF[i,j] = ES[j] - ES[i] - TD[i, j] = ES[j] - EC[i,j] If [j] is the final event, use PC for ES[j]

    Determine Critical Path

    All Tasks with zero Total Float are Critical. Any delay in these Tasks will delay Project Completion. Darken these Tasks to finish CPM Diagram.

    You might also like