© J. Christopher Beck 20081 Lecture 4: Program Evaluation and Review Technique (PERT)

Slides:



Advertisements
Similar presentations
Chapter 9: Probabilistic Scheduling Models
Advertisements

Chapter 7 Project Management
Project Management CPM/PERT Professor Ahmadi.
Chapter 13 Project Scheduling: PERT/CPM
Chapter 9 Project Scheduling: PERT/CPM
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edwards University.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Project Management and scheduling Objectives of project scheduling Network analysis Scheduling techniques.
Contents College 4 §4.1, §4.2, §4.4, §4.6 Extra literature on resource constrained project scheduling (will be handed out)
Terminology Project: Combination of activities that have to be carried out in a certain order Activity: Anything that uses up time and resources CPM: „Critical.
1 Topics to cover in 2 nd part ( to p2). 2 Chapter 8 - Project Management Chapter Topics ( to p3)
IEOR Basic Project Scheduling. IEOR Project Scheduling zJobs subject to precedence constraints zJob on arc format (most common)
PROJECT MANAGEMENT. Outline What is a “project”? Project Management Objectives and tradeoffs Planning and Control in Projects Scheduling Methods Constant-Time.
1 Project Scheduling CP - Chapter 10 Lecture 3. 2 Project Management  How is it different?  Limited time frame  Narrow focus, specific objectives 
1 1 Slide © 2004 Thomson/South-Western Chapter 12 Project Scheduling: PERT/CPM n Project Scheduling with Known Activity Times n Project Scheduling with.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
MGMT 483 Week 8 Scheduling.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Other Scheduling Methods Dr. Ayham Jaaron Chapter 11.
Lecture 10: Integer Programming & Branch-and-Bound
Spring 2008, King Saud University PERT Dr. Khalid Al-Gahtani 1 Activity Duration 1.“Guess” the activity duration, especially smaller activities. 2.Use.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Chapter 10 Project Scheduling: PERT/CPM
1 Project Scheduling Contents 1. Problem Statement 2. Critical Path Method 3. Extensions to the classical project scheduling problems Literature Operations.
1 Slide © 2005 Thomson/South-Western Chapter 10 Project Scheduling: PERT/CPM Project Scheduling with Known Activity Times Project Scheduling with Known.
In the name of Allah the Most Gracious the Most Merciful.
Project Management Techniques.
1 Material Management Class Note # 5-A ( in review ) Project Scheduling & Management Prof. Yuan-Shyi Peter Chiu Feb
© J. Christopher Beck Lecture 4: Project Planning 1.
© 2000 by Prentice-Hall Inc Russell/Taylor Oper Mgt 3/e Chapter 6 Project Management.
MATHEMATICS 3 Operational Analysis Štefan Berežný Applied informatics Košice
Operations Management Contemporary Concepts and Cases Chapter Fourteen Project Planning and Scheduling Copyright © 2011 by The McGraw-Hill Companies,
Project Management Chapter 13 OPS 370. Projects Project Management Five Phases 1. Initiation 2. Planning 3. Execution 4. Control 5. Closure.
© J. Christopher Beck Lecture 5: Project Planning 2.
1 1 Project Scheduling PERT/CPM Networks. 2 2 Originated by H.L.Gantt in 1918 GANTT CHART Advantages - Gantt charts are quite commonly used. They provide.
1 Material Management Class Note # 6 Project Scheduling & Management Prof. Yuan-Shyi Peter Chiu Feb
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
© J. Christopher Beck Lecture 6: Time/Cost Trade-off in Project Planning.
0 Production and Operations Management Norman Gaither Greg Frazier Slides Prepared by John Loucks  1999 South-Western College Publishing.
Estimate Project Duration n Experience n Historical Data n Research n Modeling n Experiments n Breakdown/Roll-Up n Delphi Method n Consultants n Three.
Project Scheduling Software
Change management control Sources of Change  Project scope changes  Implementation of contingency plans  Improvement changes ISE Ch. 6 1.
CPM – Critical Path Method Can normal task times be reduced? Is there an increase in direct costs? Additional manpower Additional machines Overtime, etc…
Chapter 7 : Risk Management – part 2
Project Management Chapter 13 Sections 13.1, 13.2, and 13.3.
Project Crashing. c=6 e=9 b=6 a=7 f=8 g=5 d=4 Given the information below, what is the total additional cost to crash the project as much as possible?
Project Management Concepts Gantt Chart – shows tasks as bars whose length indicates timing. PERT* chart (Network Diagram) – shows relationships between.
COB 300C - The Operations Dimension Project Management.
Project Planning & Scheduling What is a “project”? Objectives and tradeoffs Planning and Control in Projects Scheduling Methods Constant-Time Networks.
IE 366 Chapter 6, Section 10 Project Planning and Scheduling.
PERT CPM assumes duration of activity is known with certainty.
Project Management.
Project Planning & Scheduling
Project Management (PERT/CPM) PREPARED BY CH. AVINASH
deterministic Fixed and known in advance, representing a
Basic Project Scheduling
Project Planning & Scheduling
Project Management and scheduling
Basic Project Scheduling
PROJECT MANAGEMENT WITH CPM/PERT.
Decision making and Organization Management
مدیریت عمومی دانش کهن. مدیریت عمومی دانش کهن ارایه تحقیق پایان ترم 3 نمره امتحان پایان ترم 10 نمره ارایه تکالیف کلاس 2 نمره امتحانات.
Slides Prepared by JOHN LOUCKS
Project Management CPM/PERT Professor Ahmadi.
Uncertain activity duration (P14)
AOA A style of project network diagram in which arrows
Uncertain activity duration (P14)
PERT Program Evaluation and Review Technique
Presentation transcript:

© J. Christopher Beck Lecture 4: Program Evaluation and Review Technique (PERT)

© J. Christopher Beck Outline Quick CPM Review Program Evaluation and Review Technique (PERT)

© J. Christopher Beck Readings P Ch 4.2, 4.3 Slides borrowed from Twente & Iowa See Pinedo CD

© J. Christopher Beck A Small Example (again) “job on node”-representation:

© J. Christopher Beck Forward Procedure STEP1: For each job that has no predecessors: STEP2: compute for each job j: STEP3: S’ 1 = 0 S’ 2 = 0 S’ 3 = 0 C’ 1 = 2 C’ 2 = 3 C’ 3 = 1 S’ 4 = 3 S’ 5 = 3 S’ 6 = 7 C’ 6 = 8 C’ 5 = 5 C’ 4 = 7 C max = 8

© J. Christopher Beck Backward Procedure STEP1: For each job that has no successors: STEP2: compute for each job j: STEP3: Verify that: S’’ 1 = 1 S’’ 2 = 0 C’’ 1 = 3 C’’ 2 = 3 S’’ 3 = 7S’’ 5 = 6 S’’ 6 = 7 C’’ 3 = 8 C’’ 6 = 8 C’’ 5 = 8 S’’ 4 = 3C’’ 4 = 7 C max = 8

© J. Christopher Beck OK so …

© J. Christopher Beck Uncertain Processing Times Great, project scheduling is easy! In the real world, do we really know the duration of a job? What if we have estimates of duration? What if we have a distribution: p j = (μ j, δ j )?

© J. Christopher Beck Program Evaluation & Review Technique (PERT) Idea: estimate p j and use CPM to estimate: Ê(C max ) – expected makespan Ṽ(C max ) – variance of makespan

© J. Christopher Beck Simplest Approach Given p j = (μ j, δ j ), let p j = μ j Use CPM to find critical path Estimate the expected makespan Ê(C max ) = Σ μ j, j in critical path Ṽ(C max ) = Σ (δ j 2 ), j in critical path This is a very crude approximation! See Example Q: What if there are two CPs?

© J. Christopher Beck Estimating (μ j, δ j ) Assume you have 3 estimates of p j Optimistic: p a j Most likely: p m j Pessimistic: p b j Reasonable estimates: μ j = (p a j +4p m j +p b j ) / 6 δ j = (p b j -p a j ) / 6 “No battle plan survives the first encounter with the enemy.”

© J. Christopher Beck PERT Steps 1. Find μ j, δ j 2 i.e., using estimates on previous slide 2. Use CPM to find critical path(s) with p j = μ j 3. Estimated expected value and variance of C max Assume makespan is normally distributed

© J. Christopher Beck PERT Problems More than one CP? non-CP with high variance? expected makespan must be larger than single CP estimate (why?) Assumption of normal distribution

© J. Christopher Beck PERT Practice Jobpajpaj pmjpmj pbjpbj Predecessors ,3, , Draw precedence graph Find μ j, δ j 2 Find Critical Path(s) Estimate expected value and variance of C max

© J. Christopher Beck More PERT Practice Example Jobs pajpaj pmjpmj pbjpbj Find expected makespan and variance Hint: same graph as 4.2.3