Presentation on theme: "Project Scheduling Critical Path Method Based on material from Chapter 6 of Project Management and Teamwork, by Karl Smith."— Presentation transcript:
Project Scheduling Critical Path Method Based on material from Chapter 6 of Project Management and Teamwork, by Karl Smith
How do you schedule complex projects? Make a list of things to do? Use an outline? Draw a concept map? Focus on those things we know how to do first? Use project management software?
Dinner & Concert How much time do you need to prepare and consume the meal? Menu consists of soup and baked chicken Soup must be boiled 35 minutes and will allow 15 minutes to serve and consume Chicken dish requires 30 minutes to boil rice, 15 minutes to brown chicken in frying pan, 15 minutes to bake rice and chicken in baking dish Sauce takes 5 minutes to prepare in frying pan and 15 minutes to boil peas Only have two pots and one frying pan Wine takes 5 minutes to uncork and 30 minutes to let breath before serving Allow 25 minutes to serve and consume entrée and wine
Critical Path Method Work breakdown structure ok for simple task with few activities When number of task large, a systematic solution is to use the Critical Path Method (CPM) –to use CPM must know the duration of each activity and the predecessors of each
CPM - Forward Pass Early Start (ES) - Earliest time that each activity can start - obtained by adding the earliest start of its latest starting predecessor to the that predecessor’s duration - when two or more activities must be competed before the next one can start, then the maximum must be used Early Finish (EF) - Determined by summing the early start (ES) and duration
CPM - Backward Pass Late Start (LS) - Latest possible starting time that each activity can have - calculated as the earliest starting successor, less the duration of the activity under consideration Late Finish (LF) - The resulting finish time based on late start (LS)
CPM - Critical Path & Floats Critical Path - The path for which activities cannot be delayed - activities on critical path will have equal earliest and latest times and are call critical Floats - The amount the termination of an activity can be delayed before delaying a successor is called free float (FF). FF i = (ES i+1 ) min - ES i - D i The amount of slack an activity has before it would cause the path on which it lies to become critical is called the total float (TF). TF i = LF i - EF i