logging in or signing up Pert_CPM l_whyn Download Post to : URL : Related Presentations : Let's Connect Share Add to Flag Embed Email Send to Blogs and Networks Add to Channel Copy embed code: Embed: Flash iPad Dynamic Copy Does not support media & animations Automatically changes to Flash or non-Flash embed WordPress Embed Customize Embed URL: Copy Thumbnail: Copy The presentation is successfully added In Your Favorites. Views: 75 Category: Entertainment License: All Rights Reserved Like it (0) Dislike it (0) Added: December 09, 2011 This Presentation is Public Favorites: 0 Presentation Description No description available. Comments Posting comment... Premium member Presentation Transcript Basics Of PERT/CPM: Basics Of PERT/CPM PERT=Project Evaluation Review Technique CPM = Critical Path MethodWhy PERT/CPM?: Why PERT/CPM? Prediction of deliverables Planning resource requirements Controlling resource allocation Internal program review External program review Performance evaluation Uniform wide acceptanceThe CPM Diagram: The CPM Diagram “Tasks” are Arrows “Events” are Circles “Dummy Tasks” are Dashed Arrows “Critical Tasks” are Thick ArrowsStarting Point: Task Primary Properties: Starting Point: Task Primary Properties Crash Limit Prerequisite task set (may be empty) Optimal Staffing Duration at Optimal Staffing Level Fixed and Variable costsIf a task seems too complex or involved to easily determine primary properties . . . Break the task up into simpler tasks . . . Or create a CPM sub-project. : If a task seems too complex or involved to easily determine primary properties . . . Break the task up into simpler tasks . . . Or create a CPM sub-project.We will use PERT/CPM Analysis to determine Task Secondary properties:: We will use PERT/CPM Analysis to determine Task Secondary properties: Tail Event and Head Event Earliest Start, Earliest Complete Latest Start, Latest Complete Critical / Non-Critical Status Total Float, Free Float Scheduled Start, Scheduled Complete Actual Staffing, Duration, and Variable CostsWe will then use Task Secondary Properties to generate Project Management Tools:: We will then use Task Secondary Properties to generate Project Management Tools: Gantt Chart (Project Schedule) Manpower Chart Expenditure Curves Project Completion (PC)Generate Initial CPM Diagram: Generate Initial CPM Diagram Must strictly enforce all prerequisite relationships. Number of events is initially unknown Critical path is initially unknown Iterative Process Try to minimize number of Dummy TasksCPM Hint #1: CPM Hint #1 Add or remove events at your pleasure. Do not number events until last.CPM Hint #2: CPM Hint #2 The initial event is the Tail Event for all tasks which have empty prerequisite sets (Initial Tasks). The Final Event is the Head Event for all tasks which are not members of any prerequisite set (Final Tasks).CPM Hint #3: CPM Hint #3 Tasks which have identical prerequisite sets have the same Tail EventCPM Hint #4: 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: Finish CPM Diagram Remove all redundant Dummy Tasks Remove all redundant Events Number all remaining events Not really finished . . haven’t identified critical tasks yet.Generate PERT Chart: Enter Data for Each Task : 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: 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.PowerPoint Presentation: 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: 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].PowerPoint Presentation: 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: 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 do not have the permission to view this presentation. In order to view it, please contact the author of the presentation.