Operations and Project Management Session 3 Extra Some Additional Details on CPM and PERT.

Slides:



Advertisements
Similar presentations
3 Project Management PowerPoint presentation to accompany
Advertisements

WBS: Lowest level OBS: Lowest level
Project Management Projects are unique, one-time operations designed to accomplish a specific set of objectives in a limited timeframe Project managers.
Finding the Critical Path
3 - 1 Course Title: Production and Operations Management Course Code: MGT 362 Course Book: Operations Management 10 th Edition. By Jay Heizer & Barry Render.
Chapter 17: Learning Objectives
1 Lecture by Junaid Arshad Department of Engineering Management Abridged and adapted by A. M. Al-Araki, sept WBS: Lowest level OBS: Lowest level.
Chapter 3 Project Management. Chapter 3 Project Management.
© 2006 Prentice Hall, Inc.3 – 1 Operations Management Chapter 3 – Project Management Chapter 3 – Project Management © 2006 Prentice Hall, Inc. PowerPoint.
Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
University of Mediterranean Karpasia
Chapter 3 (Continued) Outline Recap CPM (continued)  Assign time estimates to each activity  Compute the longest time path through the network.
Project Management Chapter 13
6. Project Management.
Project Management Techniques.
3 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall 3 3 Project Management PowerPoint presentation to accompany Heizer and Render Operations.
Operations Management
Operations Management
Operations Management
Operations Management
© 2008 Prentice-Hall, Inc. Chapter 13 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides.
3 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall 3 3 Project Management PowerPoint presentation to accompany Heizer and Render Operations.
Roberta Russell & Bernard W. Taylor, III
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 13-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 13.
© 2008 Prentice Hall, Inc.3 – 1 Operations Management Chapter 3 – Project Management PowerPoint presentation to accompany Heizer/Render Principles of Operations.
Operations Management Chapter 3 – Project Management.
MANA 705 DL © Sistema Universitario Ana G. Méndez, All rights reserved. W6 6.2 Operation Management Operation Management Managing Projects Techniques.
3 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall 3 3 Project Management PowerPoint presentation to accompany Heizer and Render Operations.
3 Project Management PowerPoint presentation to accompany
Project Management. Learning Objectives  Discuss the behavioral aspects of projects in terms of project personnel and the project manager.  Discuss.
Lecture 09 Project Management ISE Dept.-IU Office: Room 508.
Lean Project Management
3 - 1© 2011 Pearson Education 3 3 Managing Projects PowerPoint presentation to accompany Heizer and Render Operations Management, 10e, Global Edition Principles.
3 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall  Complex and temporary task of many related activities. (not ‘business as usual’)  May.
© 2006 Prentice Hall, Inc.3 – 1 Operations Management Chapter 3 – Project Management Chapter 3 – Project Management © 2006 Prentice Hall, Inc. PowerPoint.
1 Project Management Seminar Project Scheduling. 2 Importance of Project Management Three Components of Project Management Project Evaluation and Review.
3 Project Management PowerPoint presentation to accompany
© 2006 Prentice Hall, Inc.3 – 1 Operations Management Chapter 3 – Project Management Chapter 3 – Project Management © 2006 Prentice Hall, Inc. PowerPoint.
Project Management Techniques
To accompany Quantitative Analysis for Management, 7e by Render/Stair 13-1 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Quantitative Analysis.
1 OMGT 3123 Project Management  Project Controlling  Project Management Techniques: PERT And CPM  The Framework Of PERT And CPM  Network Diagrams And.
Time Planning and Control Activity on Node Network (AON)
3 - 1 Course Title: Production and Operations Management Course Code: MGT 362 Course Book: Operations Management 10 th Edition. By Jay Heizer & Barry Render.
Welcome to MM305 Unit 7 Seminar Dr. Bob Project Management.
OPSM 301 Operations Management Class 18: Project Management: Introduction and CPM Koç University Zeynep Aksin
Operations Management Project Management Chapter 3.
© 2007 Pearson Education Project Management. © 2007 Pearson Education Bechtel Group, INC.  Bechtel is a $16.3 billion-a-year construction contractor.
© 2006 Prentice Hall, Inc.3 – 1 Operations Management Chapter 3 – Project Management Chapter 3 – Project Management © 2006 Prentice Hall, Inc. PowerPoint.
3 - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall 3 3 Project Management PowerPoint presentation to accompany Heizer and Render Operations.
Welcome to MM305 Unit 7 Seminar Dr. Bill Wood Project Management.
Operations Management
Project Management Project Controlling
PROJECT MANAGEMENT.
Project Management (PERT/CPM) PREPARED BY CH. AVINASH
Operations Management
Learning Objectives When you complete this chapter, you should be able to : Identify or Define: Work breakdown structure Critical path AOA and AON Networks.
Time Planning and Control Activity on Node Network (AON)
PROJECT MANAGEMENT WITH CPM/PERT.
Project Scheduling Network Optimization can be used as an aid in the scheduling of large complex projects that consist of many activities A project is.
Project Planning and Budgeting
3 Project Management PowerPoint presentation to accompany
PLANNING ENGINEERING AND PROJECT MANAGEMENT
Time Planning and Control Activity on Node Network (AON)
Slides Prepared by JOHN LOUCKS
Project Management CPM/PERT Professor Ahmadi.
3 Project Management PowerPoint presentation to accompany
Critical Path Method and Assignments for COLL
Presentation transcript:

Operations and Project Management Session 3 Extra Some Additional Details on CPM and PERT

3 - 2© 2011 Pearson Education, Inc. publishing as Prentice Hall  Network techniques  Developed in 1950’s  CPM by DuPont for chemical plants (1957)  PERT by Booz, Allen & Hamilton with the U.S. Navy, for Polaris missile (1958)  Consider precedence relationships and interdependencies  Each uses a different estimate of activity times PERT and CPM

3 - 3© 2011 Pearson Education, Inc. publishing as Prentice Hall Six Steps PERT & CPM 1.Define the project and prepare the work breakdown structure 2.Develop relationships among the activities - decide which activities must precede and which must follow others 3.Draw the network connecting all of the activities

3 - 4© 2011 Pearson Education, Inc. publishing as Prentice Hall Six Steps PERT & CPM 4.Assign time and/or cost estimates to each activity 5.Compute the longest time path through the network – this is called the critical path 6.Use the network to help plan, schedule, monitor, and control the project

3 - 5© 2011 Pearson Education, Inc. publishing as Prentice Hall 1.When will the entire project be completed? 2.What are the critical activities or tasks in the project? 3.Which are the noncritical activities? 4.What is the probability the project will be completed by a specific date? Questions PERT & CPM Can Answer

3 - 6© 2011 Pearson Education, Inc. publishing as Prentice Hall 5.Is the project on schedule, behind schedule, or ahead of schedule? 6.Is the money spent equal to, less than, or greater than the budget? 7.Are there enough resources available to finish the project on time? 8.If the project must be finished in a shorter time, what is the way to accomplish this at least cost? Questions PERT & CPM Can Answer

3 - 7© 2011 Pearson Education, Inc. publishing as Prentice Hall Determining the Project Schedule Perform a Critical Path Analysis  The critical path is the longest path through the network  The critical path is the shortest time in which the project can be completed  Any delay in critical path activities delays the project  Critical path activities have no slack time

3 - 8© 2011 Pearson Education, Inc. publishing as Prentice Hall Determining the Project Schedule Perform a Critical Path Analysis Table 3.2 ActivityDescriptionTime (weeks) ABuild internal components2 BModify roof and floor3 CConstruct collection stack2 DPour concrete and install frame4 EBuild high-temperature burner4 FInstall pollution control system 3 GInstall air pollution device5 HInspect and test2 Total Time (weeks)25

3 - 9© 2011 Pearson Education, Inc. publishing as Prentice Hall Determining the Project Schedule Perform a Critical Path Analysis Table 3.2 ActivityDescriptionTime (weeks) ABuild internal components2 BModify roof and floor3 CConstruct collection stack2 DPour concrete and install frame4 EBuild high-temperature burner4 FInstall pollution control system 3 GInstall air pollution device5 HInspect and test2 Total Time (weeks)25 Earliest start (ES) =earliest time at which an activity can start, assuming all predecessors have been completed Earliest finish (EF) =earliest time at which an activity can be finished Latest start (LS) =latest time at which an activity can start so as to not delay the completion time of the entire project Latest finish (LF) =latest time by which an activity has to be finished so as to not delay the completion time of the entire project

3 - 10© 2011 Pearson Education, Inc. publishing as Prentice Hall Determining the Project Schedule Perform a Critical Path Analysis Figure 3.10 A Activity Name or Symbol Earliest Start ES Earliest Finish EF Latest Start LS Latest Finish LF Activity Duration 2

3 - 11© 2011 Pearson Education, Inc. publishing as Prentice Hall Forward Pass Begin at starting event and work forward Earliest Start Time Rule:  If an activity has only a single immediate predecessor, its ES equals the EF of the predecessor  If an activity has multiple immediate predecessors, its ES is the maximum of all the EF values of its predecessors ES = Max {EF of all immediate predecessors}

3 - 12© 2011 Pearson Education, Inc. publishing as Prentice Hall Forward Pass Begin at starting event and work forward Earliest Finish Time Rule:  The earliest finish time (EF) of an activity is the sum of its earliest start time (ES) and its activity time EF = ES + Activity time

3 - 13© 2011 Pearson Education, Inc. publishing as Prentice Hall ES/EF Network for Milwaukee Paper Start 0 0 ES 0 EF = ES + Activity time

3 - 14© 2011 Pearson Education, Inc. publishing as Prentice Hall ES/EF Network for Milwaukee Paper Start A2A2 2 EF of A = ES of A ES of A

3 - 15© 2011 Pearson Education, Inc. publishing as Prentice Hall B3B3 ES/EF Network for Milwaukee Paper Start A2A EF of B = ES of B ES of B

3 - 16© 2011 Pearson Education, Inc. publishing as Prentice Hall C2C2 24 ES/EF Network for Milwaukee Paper B3B3 03 Start A2A2 20

3 - 17© 2011 Pearson Education, Inc. publishing as Prentice Hall C2C2 24 ES/EF Network for Milwaukee Paper B3B3 03 Start A2A2 20 D4D4 7 3 = Max (2, 3)

3 - 18© 2011 Pearson Education, Inc. publishing as Prentice Hall D4D4 37 C2C2 24 ES/EF Network for Milwaukee Paper B3B3 03 Start A2A2 20

3 - 19© 2011 Pearson Education, Inc. publishing as Prentice Hall E4E4 F3F3 G5G5 H2H D4D4 37 C2C2 24 ES/EF Network for Milwaukee Paper B3B3 03 Start A2A2 20 Figure 3.11

3 - 20© 2011 Pearson Education, Inc. publishing as Prentice Hall Backward Pass Begin with the last event and work backwards Latest Finish Time Rule:  If an activity is an immediate predecessor for just a single activity, its LF equals the LS of the activity that immediately follows it  If an activity is an immediate predecessor to more than one activity, its LF is the minimum of all LS values of all activities that immediately follow it LF = Min {LS of all immediate following activities}

3 - 21© 2011 Pearson Education, Inc. publishing as Prentice Hall Backward Pass Begin with the last event and work backwards Latest Start Time Rule:  The latest start time (LS) of an activity is the difference of its latest finish time (LF) and its activity time LS = LF – Activity time

3 - 22© 2011 Pearson Education, Inc. publishing as Prentice Hall LS/LF Times for Milwaukee Paper E4E4 F3F3 G5G5 H2H D4D4 37 C2C2 24 B3B3 03 Start A2A2 20 LF = EF of Project 1513 LS = LF – Activity time

3 - 23© 2011 Pearson Education, Inc. publishing as Prentice Hall LS/LF Times for Milwaukee Paper E4E4 F3F3 G5G5 H2H D4D4 37 C2C2 24 B3B3 03 Start A2A2 20 LF = Min(LS of following activity) 1013

3 - 24© 2011 Pearson Education, Inc. publishing as Prentice Hall LS/LF Times for Milwaukee Paper E4E4 F3F3 G5G5 H2H D4D4 37 C2C2 24 B3B3 03 Start A2A2 20 LF = Min(4, 10) 42

3 - 25© 2011 Pearson Education, Inc. publishing as Prentice Hall LS/LF Times for Milwaukee Paper E4E4 F3F3 G5G5 H2H D4D4 37 C2C2 24 B3B3 03 Start A2A

3 - 26© 2011 Pearson Education, Inc. publishing as Prentice Hall Computing Slack Time After computing the ES, EF, LS, and LF times for all activities, compute the slack or free time for each activity  Slack is the length of time an activity can be delayed without delaying the entire project Slack = LS – ES or Slack = LF – EF

3 - 27© 2011 Pearson Education, Inc. publishing as Prentice Hall Computing Slack Time Table 3.3 EarliestEarliestLatestLatestOn StartFinishStartFinishSlackCritical ActivityESEFLSLFLS – ESPath A02020Yes B03141No C24240Yes D37481No E48480Yes F No G Yes H Yes

3 - 28© 2011 Pearson Education, Inc. publishing as Prentice Hall Critical Path for Milwaukee Paper E4E4 F3F3 G5G5 H2H D4D4 37 C2C2 24 B3B3 03 Start A2A

3 - 29© 2011 Pearson Education, Inc. publishing as Prentice Hall  CPM assumes we know a fixed time estimate for each activity and there is no variability in activity times  PERT uses a probability distribution for activity times to allow for variability Variability in Activity Times

3 - 30© 2011 Pearson Education, Inc. publishing as Prentice Hall  Three time estimates are required  Optimistic time (a) – if everything goes according to plan  Pessimistic time (b) – assuming very unfavorable conditions  Most likely time (m) – most realistic estimate Variability in Activity Times

3 - 31© 2011 Pearson Education, Inc. publishing as Prentice Hall Estimate follows beta distribution Variability in Activity Times Expected time: Variance of times: t = (a + 4m + b)/6 v = [(b – a)/6] 2

3 - 32© 2011 Pearson Education, Inc. publishing as Prentice Hall Estimate follows beta distribution Variability in Activity Times Expected time: Variance of times: t = (a + 4m + b)/6 v = [(b − a)/6]2 Probability of 1 in 100 of > b occurring Probability of 1 in 100 of < a occurring Probability Optimistic Time (a) Most Likely Time (m) Pessimistic Time (b) Activity Time Figure 3.12

3 - 33© 2011 Pearson Education, Inc. publishing as Prentice Hall Computing Variance Table 3.4 MostExpected OptimisticLikelyPessimisticTimeVariance Activity ambt = (a + 4m + b)/6[(b – a)/6] 2 A B C D E F G H

3 - 34© 2011 Pearson Education, Inc. publishing as Prentice Hall Probability of Project Completion Project variance is computed by summing the variances of critical activities  2 = Project variance =  (variances of activities on critical path) p

3 - 35© 2011 Pearson Education, Inc. publishing as Prentice Hall Probability of Project Completion Project variance is computed by summing the variances of critical activities Project variance  2 = = 3.11 Project standard deviation  p = Project variance = 3.11 = 1.76 weeks p

3 - 36© 2011 Pearson Education, Inc. publishing as Prentice Hall Probability of Project Completion PERT makes two more assumptions:  Total project completion times follow a normal probability distribution  Activity times are statistically independent

3 - 37© 2011 Pearson Education, Inc. publishing as Prentice Hall Probability of Project Completion Standard deviation = 1.76 weeks 15 Weeks (Expected Completion Time) Figure 3.13

3 - 38© 2011 Pearson Education, Inc. publishing as Prentice Hall Probability of Project Completion What is the probability this project can be completed on or before the 16 week deadline? Z=–/  p = (16 wks – 15 wks)/1.76 = 0.57 dueexpected date dateof completion Where Z is the number of standard deviations the due date or target date lies from the mean or expected date

3 - 39© 2011 Pearson Education, Inc. publishing as Prentice Hall Probability of Project Completion What is the probability this project can be completed on or before the 16 week deadline? Z=−/  p = (16 wks − 15 wks)/1.76 = 0.57 dueexpected date dateof completion Where Z is the number of standard deviations the due date or target date lies from the mean or expected date From Appendix I

3 - 40© 2011 Pearson Education, Inc. publishing as Prentice Hall Probability of Project Completion Time Probability (T ≤ 16 weeks) is 71.57% Figure Standard deviations 1516 WeeksWeeks

3 - 41© 2011 Pearson Education, Inc. publishing as Prentice Hall Determining Project Completion Time Probability of 0.01 Z Figure 3.15 From Appendix I Probability of Standard deviations 02.33

3 - 42© 2011 Pearson Education, Inc. publishing as Prentice Hall Variability of Completion Time for Noncritical Paths  Variability of times for activities on noncritical paths must be considered when finding the probability of finishing in a specified time  Variation in noncritical activity may cause change in critical path