1.040/1.401 Project Management Spring 2007 Deterministic Planning Part I Dr. SangHyun Lee Department of Civil and Environmental Engineering.

Slides:



Advertisements
Similar presentations
1.040/1.401 Project Management Spring 2007 Lecture 9 Deterministic Planning Part II Dr. SangHyun Lee Department of Civil and Environmental.
Advertisements

WBS: Lowest level OBS: Lowest level
Developing a Project Plan CHAPTER SIX Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Developing a Project Plan CHAPTER SIX Student Version Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Chapter 6: Developing a Project Plan
Project Management 6e..
Project Management Project Management
F O U R T H E D I T I O N Project Management © The McGraw-Hill Companies, Inc., 2003 supplement 3 DAVIS AQUILANO CHASE PowerPoint Presentation by Charlie.
3 - 1 Course Title: Production and Operations Management Course Code: MGT 362 Course Book: Operations Management 10 th Edition. By Jay Heizer & Barry Render.
Operations Management Session 27: Project Management.
1 Lecture by Junaid Arshad Department of Engineering Management Abridged and adapted by A. M. Al-Araki, sept WBS: Lowest level OBS: Lowest level.
PROJECT MANAGEMENT CPM/PERT V P B Chakravarthi. K Abhijeet Kumar.
Developing a Project Plan
Gantt Chart Graph or bar chart with a bar for each project activity that shows passage of time Provides visual display of project schedule Slack amount.
CSSE 372 Week 6 Day 2 Constructing and Analyzing the Project Network Diagram  PERT Chart PERT was invented for the Nautilus submarine project. Ok, maybe.
إدارة المشروعات Projects Management
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
MGMT 483 Week 8 Scheduling.
5/4/20151 NETWORK SCHEDULING TECHNIQUES. 5/4/20152 Network Diagrams  PMI defines the scheduling process as: “the identification of the project objectives.
Project Scheduling Critical Path Method
Project Development Scheduling and Probability of Completion.
Chapter 3 (Continued) Outline Recap CPM (continued)  Assign time estimates to each activity  Compute the longest time path through the network.
Chapters 8, 9, and 10 Design Stage 1 Preconstruction Stage 2: Procurement Conceptual Planning Stage3: Construction Stage 4: Project Close-out.
1 Operations Management Lesson 5 Project Management.
Project Scheduling. SEEM Project Scheduling (PS) To determine the schedules to perform the various activities (tasks) required to complete the project,
Projects: Critical Paths Dr. Ron Lembke Operations Management.
Chapter 16 – Project Management
Roberta Russell & Bernard W. Taylor, III
Where We Are Now. Where We Are Now Developing the Project Plan The Project Network A flow chart that graphically depicts the sequence, interdependencies,
PROJECT MANAGEMENT Outline What is project mean? Examples of projects… Project Planning and Control Project Life Cycle Gantt Chart PERT/CPM.
THE MANAGERIAL PROCESS Clifford F. Gray Eric W. Larson Developing a Project Plan Chapter 6.
Operations Management Project Management
MANA 705 DL © Sistema Universitario Ana G. Méndez, All rights reserved. W6 6.2 Operation Management Operation Management Managing Projects Techniques.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Project Management Operations Management - 5 th Edition Chapter.
Project Management Chapter Unique, one-time operations designed to accomplish a specific set of objectives in a limited time frame. Build A A.
1 Project Management Chapter Lecture outline Project planning Project scheduling Project control CPM/PERT Project crashing and time-cost trade-off.
3 - 1© 2011 Pearson Education 3 3 Managing Projects PowerPoint presentation to accompany Heizer and Render Operations Management, 10e, Global Edition Principles.
Project Management: A Managerial Approach
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Chapter 17 Project Management Part.
McGraw-Hill/Irwin© 2008 The McGraw-Hill Companies, All Rights Reserved Developing a Project Plan Chapter 6.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 17 Project Management.
Project Management (專案管理)
Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 PROJECT MANAGEMENT 18-1 Project Management.
Work Systems and the Methods, Measurement, and Management of Work by Mikell P. Groover, ISBN ©2007 Pearson Education, Inc., Upper Saddle.
In Chapter 5: Scheduling the Project From Action Plan and WBS to Gantt chart and project network.  Gantt Chart  Project Network  Activity-on-arrow 
Project Planning and Budgeting Recall the four stages Project Definition and Conceptualization Project Planning and Budgeting Project Execution and Control.
Chapter 7 – PERT, CPM and Critical Chain Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.
Operations Management Project Management
Dr. Hany Abd Elshakour 2/18/ :27 PM 1. Dr. Hany Abd Elshakour 2/18/ :27 PM 2 Time Planning and Control Activity on Arrow (Arrow Diagramming.
Software Project Scheduling By: Sohaib Ejaz Introduction A Gantt chart is a graphical representation of the duration of tasks against the progression.
Project Management – Part 1. Overview What is a project? Project management techniques Activity lists Network diagrams Critical path analysis Gant charts.
Project Scheduling. Why Are Projects Late? an unrealistic deadline established by someone outside the software development group changing customer requirements.
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Project Management Operations Management - 5 th Edition Chapter.
Operations and Project Management Session 3 Extra Some Additional Details on CPM and PERT.
Project Planning, Scheduling and Control Planning: –defines objectives, tasks and preceeding relationships; estimates time and resources Scheduling: –identifies.
PROJECT MANAGEMENT.
Project Management: PERT/CPM
Project Management (PERT/CPM) PREPARED BY CH. AVINASH
Time Planning and Control Activity on Node Network (AON)
Project Management for Business
Projects: Critical Paths
PROJECT MANAGEMENT WITH CPM/PERT.
Time Planning and Control Activity on Node Network (AON)
Project Planning and Budgeting
Developing a Project Plan
PLANNING ENGINEERING AND PROJECT MANAGEMENT
Time Planning and Control Activity on Node Network (AON)
Slides Prepared by JOHN LOUCKS
Presentation transcript:

1.040/1.401 Project Management Spring 2007 Deterministic Planning Part I Dr. SangHyun Lee Department of Civil and Environmental Engineering Massachusetts Institute of Technology

Project Management Phase FEASIBILITY CLOSEOUT DEVELOPMENT OPERATIONS Fin.&Eval. Risk Estimating Planning&Scheduling DESIGNPLANNING Organization

Outline  Objective  Bar Chart  Network Techniques  CPM

Objective What are some of the Different Representations for Deterministic Schedules ? What are some of the Different Representations for Deterministic Schedules ? What are some Issues to Watch for? What are some Issues to Watch for?

Outline Objective Objective  Bar Chart  Network Techniques  CPM

Gantt Chart Characteristics n Bar Chart n Henry L. Gantt n World War I n Ammunition Ordering and Delivery n Activities Enumerated in the Vertical Axis n Activity Duration Presented on the Horizontal Axis n Easy to Read

Simple Gantt Chart

Gantt (Bar) Charts Very effective communication tool Very popular for representation of simpler schedules Can be cumbersome when have >100 activities Key shortcoming: No dependencies captured Most effective as reporting format rather than representation

Hierarchy of Gantt Charts

Activity Aggregation Source: Shtub et al., 1994 Hammock Activities Hammock Activities A graphical arrangement which includes a summary of a group of activities in the project. A graphical arrangement which includes a summary of a group of activities in the project. Duration equal to longest sequence of activities Duration equal to longest sequence of activities

Activity Aggregation Source: Shtub et al., 1994 Milestones Milestones A task with a zero duration that acts as a reference point marking a major project event. Generally used to mark: beginning & end of project, completion of a major phase, or a task for which the duration is unknown or out of control. A task with a zero duration that acts as a reference point marking a major project event. Generally used to mark: beginning & end of project, completion of a major phase, or a task for which the duration is unknown or out of control. Flag the start or the successful completion of a set of activities Flag the start or the successful completion of a set of activities

Outline Objective Objective Bar Chart Bar Chart  Network Techniques  CPM

Network Scheduling A network is a graphical representation of a project plan, showing the inter-relationships of the various activities. A network is a graphical representation of a project plan, showing the inter-relationships of the various activities. When results of time estimates & computations are added to a network, it may be used as a project schedule. When results of time estimates & computations are added to a network, it may be used as a project schedule. Source: Badiru & Pulat, 1995 Activity A Event i Event j Activity on Arrow AOA Activity on Node AON Activity A Activity B

Advantages Communications Communications Interdependency Interdependency Expected Project Completion Date Expected Project Completion Date Task Starting Dates Task Starting Dates Critical Activities Critical Activities Activities with Slack Activities with Slack Concurrency Concurrency Probability of Project Completion Probability of Project Completion Source: Badiru & Pulat, 1995

Network - Definitions Source: Badiru & Pulat, 1995 Finish I H G D E F Start A B C Arc Node (Activity) Milestone Dummy Merge Point Burst Point

Network - Definitions Source: Badiru & Pulat, 1995 Predecessor Activity of D Successor Activity of F Finish I H G D E F Start A B C

Definitions (Cont’d) Source: Badiru & Pulat, 1995 Activity Time and resource consuming effort with a specific time required to perform the task or a set of tasks required by the project Dummy Zero time duration event used to represent logical relationships between activities Milestone Important event in the project life cycle Node A circular representation of an activity and/or event

Definitions (Cont’d) Arc Arc A line that connects two nodes and can be a representation of an event or an activity A line that connects two nodes and can be a representation of an event or an activity Restriction / Precedence Restriction / Precedence A relationship which establishes a sequence of activities or the start or end of an activity A relationship which establishes a sequence of activities or the start or end of an activity Predecessor Activity Predecessor Activity An activity that immediately precedes the one being considered An activity that immediately precedes the one being considered Successor Activity Successor Activity An activity that immediately follows the one being considered An activity that immediately follows the one being considered Descendent Activity Descendent Activity An activity restricted by the one under consideration An activity restricted by the one under consideration Antecedent Activity Antecedent Activity An activity that must precede the one being considered An activity that must precede the one being considered Source: Badiru & Pulat, 1995

Definitions (Cont’d) Source: Badiru & Pulat, 1995 Merge Point Merge Point Exists when two or more activities are predecessors to a single activity (the merge point) Exists when two or more activities are predecessors to a single activity (the merge point) Burst Point Burst Point Exists when two or more activities have a common predecessor (the burst point) Exists when two or more activities have a common predecessor (the burst point) Network Network Graphical portrayal of the relationship between activities and milestones in a project Graphical portrayal of the relationship between activities and milestones in a project Path Path A series of connected activities between any two events in a network A series of connected activities between any two events in a network

Outline Objective Objective Bar Chart Bar Chart  Network Techniques  CPM

Critical Path Method (CPM) DuPont, Inc., and UNIVAC Division of Remington Rand DuPont, Inc., and UNIVAC Division of Remington Rand Scheduling Maintenance Shutdowns in Chemical Processing Plants Scheduling Maintenance Shutdowns in Chemical Processing Plants ~1958 ~1958 Construction Projects Construction Projects Time and Cost Control Time and Cost Control Deterministic Times Deterministic Times

CPM Objective Determination of the critical path: the minimum time for a project Determination of the critical path: the minimum time for a project

CPM Precedence Source: Badiru & Pulat, 1995 Technical Precedence Technical Precedence Caused by the technical relationships among activities (e.g., in conventional construction, walls must be erected before roof installation) Caused by the technical relationships among activities (e.g., in conventional construction, walls must be erected before roof installation) Procedural Precedence Procedural Precedence Determined by organizational policies and procedures that are often subjective with no concrete justification Determined by organizational policies and procedures that are often subjective with no concrete justification Imposed Precedence Imposed Precedence E.g., Resource Imposed (Resource shortage may require one task to be before another) E.g., Resource Imposed (Resource shortage may require one task to be before another)

CPM: AOA & AON Source: Feigenbaum, 2002 Newitt, 2005  Activity-on-Arrow  Activity-on-Node Excavate Footings Mobilize Clear & Grub Fabricate Forms Footings Fabricate Rebar Footings Form Footings Start Finish 1 Start Form Footings 5 7 Excavate Footings 6 Fabricate Footings Forms at Site Workshop Clear & Grub 2 3 Mobilize 4 Fabricate Rebar Footings 8 Finish Arc Arrow Activity Dummy Activity Event Dummy Activity

CPM Calculations Source: Hegazy, 2002 Hendrickson and Au, 1989/2003 Forward Pass Forward Pass Early Start Times (ES) Early Start Times (ES) Earliest time an activity can start without violating precedence relations Earliest time an activity can start without violating precedence relations Early Finish Times (EF) Early Finish Times (EF) Earliest time an activity can finish without violating precedence relations Earliest time an activity can finish without violating precedence relations

Forward Pass - Intuition It’s 8am. Suppose you want to know the earliest time you can arrange to meet a friend after performing some tasks It’s 8am. Suppose you want to know the earliest time you can arrange to meet a friend after performing some tasks Wash hair (5 min) Wash hair (5 min) Boil water for tea (10 min) Boil water for tea (10 min) Eat breakfast (10 min) Eat breakfast (10 min) Walk to campus (5 min) Walk to campus (5 min) What is the earliest time you could meet your friend? What is the earliest time you could meet your friend?

CPM Calculations Source: Hegazy, 2002 Hendrickson and Au, 1989/2003 Backward Pass Backward Pass Late Start Times (LS) Late Start Times (LS) Latest time an activity can start without delaying the completion of the project Latest time an activity can start without delaying the completion of the project Late Finish Times (LF) Late Finish Times (LF) Latest time an activity can finish without delaying the completion of the project Latest time an activity can finish without delaying the completion of the project

Backward Pass - Intuition Your friend will arrive at 9am. You want to know by what time you need to start all things Your friend will arrive at 9am. You want to know by what time you need to start all things Wash hair (5 min) Wash hair (5 min) Boil water for tea (10 min) Boil water for tea (10 min) Eat breakfast (10 min) Eat breakfast (10 min) Walk to campus (5 min) Walk to campus (5 min) What is the latest time you should start? What is the latest time you should start?

Slack or Float It’s 8am, and you know that your friend will arrive at 9am. How much do you have as free time? It’s 8am, and you know that your friend will arrive at 9am. How much do you have as free time? Wash hair (5 min) Wash hair (5 min) Boil water for tea (10 min) Boil water for tea (10 min) Eat breakfast (10 min) Eat breakfast (10 min) Walk to campus (5 min) Walk to campus (5 min)

CPM Example Source: Badiru & Pulat, 1995 Draw AON network

A2A2 F4F4 B6B6 C4C4 D3D3 G2G2 E5E5 End Start Forward Pass Source: Badiru & Pulat, ES EF

A2A2 F4F4 B6B6 C4C4 D3D3 G2G2 E5E5 End Start Source: Badiru & Pulat, 1995 Forward Pass

A2A2 F4F4 B6B6 C4C4 D3D3 G2G2 E5E5 End Start Source: Badiru & Pulat, 1995 Backward Pass 11 LS LF LF(k) = Min{LS(j)} j S(k) LF(k) = Min{LS(j)} j S(k) LS(k) = LF(k) – D(k) LS(k) = LF(k) – D(k) 

A2A2 F4F4 B6B6 C4C4 D3D3 G2G2 E5E5 End Start Source: Badiru & Pulat, 1995 Backward Pass

Slack or Float The amount of flexibility an activity possesses The amount of flexibility an activity possesses Degree of freedom in timing for performing task Degree of freedom in timing for performing task Source: Hendrickson and Au, 1989/2003 A2A2 F4F4 B6B6 C4C4 D3D3 G2G2 E5E5 End Start

Total Slack or Float Total Slack or Float (TS or TF) Total Slack or Float (TS or TF) Max time can delay w/o delaying the project Max time can delay w/o delaying the project TS(k) = {LF(k) - EF(k)} or {LS(k) - ES(k)} TS(k) = {LF(k) - EF(k)} or {LS(k) - ES(k)} A2A2 F4F4 B6B6 C4C4 D3D3 G2G2 E5E5 End Start TS = 4

Free Slack or Float Free Slack or Float (FS or FF) Free Slack or Float (FS or FF) Max time can delay w/o delaying successors Max time can delay w/o delaying successors FS(k) = Min{ES(j)} - EF(k) j S(k) FS(k) = Min{ES(j)} - EF(k) j S(k) A2A2 F4F4 B6B6 C4C4 D3D3 G2G2 E5E5 End Start FS = 3 

Independent Slack or Float Independent Slack or Float (IF) Independent Slack or Float (IF) Like Free float but assuming worst-case finish of predecessors Like Free float but assuming worst-case finish of predecessors IF(k) = Max { 0, ( Min(ES(j)) - Max(LF(i)) – D(k) ) } j S(k), i P(k) IF(k) = Max { 0, ( Min(ES(j)) - Max(LF(i)) – D(k) ) } j S(k), i P(k) A2A2 F4F4 B6B6 C4C4 D3D3 G2G2 E5E5 End Start IF = 1  

CPM Analysis Adapted from: Badiru & Pulat, 1995 ActivityDurationESEFLSLFTSFSIFCritical A B C Yes D E F G Yes

Critical Path The path with the least slack or float in the network The path with the least slack or float in the network Activities in that path: critical activities Activities in that path: critical activities For algorithm as described, at least one such path For algorithm as described, at least one such path Must be completed on time or entire project delayed Must be completed on time or entire project delayed Determines minimum time required for project Determines minimum time required for project Consider near-critical activities as well! Consider near-critical activities as well!

A2A2 F4F4 B6B6 C4C4 D3D3 G2G2 E5E5 End Start Critical Path Source: Badiru & Pulat, 1995 If EF i = ES j, then activity i is a critical activity (here, activity i is an immediate predecessor of activity j

Path Criticality = minimum total float = maximum total float = total float or slack in current path Rank paths from more critical to less critical Rank paths from more critical to less critical

Source: Badiru & Pulat, 1995 Calculate Path Criticality Calculate Path Criticality α min = 0, α max = 5 α min = 0, α max = 5 Path 1: [(5-0)/(5-0)](100 %) = 100 % Path 1: [(5-0)/(5-0)](100 %) = 100 % Path 2: [(5-3)/(5-0)](100 %) = 40 % Path 2: [(5-3)/(5-0)](100 %) = 40 % Path 3: [(5-4)/(5-0)](100 %) = 20 % Path 3: [(5-4)/(5-0)](100 %) = 20 % Path 4: [(5-5)/(5-0)](100 %) = 0 % Path 4: [(5-5)/(5-0)](100 %) = 0 % Path Criticality - Example