PLANNING ENGINEERING AND PROJECT MANAGEMENT

Slides:



Advertisements
Similar presentations
3 Project Management PowerPoint presentation to accompany
Advertisements

Precedence Diagramming
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.
© The McGraw-Hill Companies, Software Project Management 4th Edition Activity planning Chapter 6.
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
Chapter 17 Project Management McGraw-Hill/Irwin
Chapter 6 Time Planning & Networks
Project Management Projects are unique, one-time operations designed to accomplish a specific set of objectives in a limited timeframe Project managers.
Precedence Diagram Technique Precedence Networks Critical Path Analysis.
Where We Are Now Copyright © 2011 The McGraw-Hill Companies, All Rights Reserved.
PRJ566 Project Planning and Management Lecture: Network Diagrams.
PRJ566 Project Planning and Management Lecture: Dependencies and Network Diagrams.
Project Management Project Management
Finding the Critical Path
Project Management CPM/PERT Professor Ahmadi.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edwards University.
Chapter 13 Project Scheduling: PERT/CPM
Chapter 9 Project Scheduling: PERT/CPM
Chapter 3 Project Management.
Network analysis is the general name given to certain specific techniques which can be used for the planning, management and control of projects. Use.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edwards University.
ES=32 EF=34 LS=33 LF=35 ES=10 EF=16 LS=10 LF=16 ES=4+6=10 EF=10 LS=4
3 - 1 Course Title: Production and Operations Management Course Code: MGT 362 Course Book: Operations Management 10 th Edition. By Jay Heizer & Barry Render.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
1 Lecture by Junaid Arshad Department of Engineering Management Abridged and adapted by A. M. Al-Araki, sept WBS: Lowest level OBS: Lowest level.
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.
Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Tutorial 2 Project Management Activity Charts (PERT Charts)
Creating the Project Plan
PREPARED BY : NOR AZAH BINTI AZIZ KOLEJ MATRIKULASI TEKNIKAL KEDAH PROJECT NETWORK DIAGRAM.
MGMT 483 Week 8 Scheduling.
Project Scheduling Critical Path Method
Construction Planning and Scheduling A G E NG 520 Schedule Computations Part #2 1. Definition and Computation of Total and Free Floats: Total Float : The.
Chapter 3 (Continued) Outline Recap CPM (continued)  Assign time estimates to each activity  Compute the longest time path through the network.
Network planning Learning objectives After these lectures you should be able to: - Produce and analyse activities networks - Calculate earliest and latest.
Chapter 10 Project Scheduling: PERT/CPM
Precedence Network Calculations the basic information that should be calculated in the precedence network are: 1) Early activity start (ES) 2) Early activity.
Projects: Critical Paths Dr. Ron Lembke Operations Management.
Project Management Techniques.
The Critical Path – Precedence diagram method Luise Lorenz Christina Mohr.
3 Project Management PowerPoint presentation to accompany
Network Planning Methods Example PERT & CPM
3 - 1© 2011 Pearson Education 3 3 Managing Projects PowerPoint presentation to accompany Heizer and Render Operations Management, 10e, Global Edition Principles.
Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 PROJECT MANAGEMENT 18-1 Project Management.
To accompany Quantitative Analysis for Management, 7e by Render/Stair 13-1 © 2000 by Prentice Hall, Inc., Upper Saddle River, N.J Quantitative Analysis.
Welcome to MM305 Unit 7 Seminar Dr. Bob Project Management.
ENGM 631 Optimization Ch. 10: PERT/CPM. Great Pyriamid of Cheops (2,500 B.C.) 42,300,000 Stone Blocks 440 Stories 4Accuracy of 0.04 inch 413 acres level.
OPSM 301 Operations Management Class 18: Project Management: Introduction and CPM Koç University Zeynep Aksin
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.
Operations Management Project Management Chapter 3.
Operations and Project Management Session 3 Extra Some Additional Details on CPM and PERT.
Scheduling Scheduling : is the process of converting a project action plan into an operating time table. Why scheduling ? To answer the following questions:
Project Management (PERT/CPM) PREPARED BY CH. AVINASH
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 for Business
Project Time Management.
Projects: Critical Paths
Time Planning and Control Activity on Node Network (AON)
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.
PLANNING ENGINEERING AND PROJECT MANAGEMENT
ENGINEERING MANAGEMENT (GE 404)
Time Planning and Control Activity on Node Network (AON)
General Foundry Example of PERT/CPM
Exercise – A small building.
Presentation transcript:

PLANNING ENGINEERING AND PROJECT MANAGEMENT Lecture#08 PLANNING ENGINEERING AND PROJECT MANAGEMENT By Lec. Junaid Arshad DEPARTMENT OF ENGINEERING MANAGEMENT

Topics Covered CPM Calculations for AOA and AON Networks Slack Time / Float Critical Path, Critical Activity Practice Problems

CPM Calculations for AON Network Provides activity information Early start (ES) & late start (LS) Early finish (EF) & late finish (LF) Slack (S) / Float (FL) Identifies critical path This and the next several slides illustrate the definitions of terms appropriate to critical path analysis. There are many opportunities for good managers to truly manage a project once they have a PERT network established. For instance, sub-contractors know early start and late start times and the managers know the activities on the critical path upon which to focus effort.

Forward and Backward Pass Forward pass is a technique to move forward through network diagram. Backward pass is its opposite. Early Start (ES) and Early Finish (EF) use the forward pass technique. Late Start (LS) and Late Finish (LF) use the backward pass technique. Note: If the float of the activity is zero, the two starts (ES and LS) and the two finish (EF and LF) are the same. Hence, If float of activity is zero, ES = LS and EF = LF.

Early Start and Early Finish Steps Begin at starting event and work forward ES = 0 for starting activities ES is earliest start EF = ES + Activity time EF is earliest finish ES = Maximum EF of all predecessors for non- starting activities

Late Start and Late Finish Steps Begin at ending event and work backward LF = Maximum EF for ending activities LF is latest finish; EF is earliest finish LS = LF - Activity time LS is latest start LF = Minimum LS of all successors for non-ending activities

AON Network Calculations ES LS EF LF Earliest Finish Latest Start Earliest Start Activity Name Activity Duration Latest Finish

CPM Calculations for an AON Network Problem 04 Activity Preceding Activity Duration (days) A - 10 B 07 C 12 D 18 E 14 F 13 G 16 H D, E I F, G 06 CPM Calculations for an AON Network

Slack Time/Float Slack Time is the amount of time an activity may be delayed without affecting the project deadline. This is also referred as float. Total Slack Time / Total Float: Time shared among more than one activity. Free Slack Time /Free Float: Time associated with a single activity.

Critical Activity An activity having zero slack time is called critical activity. The concept of critical activities is that it draws the attention of the project manager to the activities that needs the closest monitoring. Any delay of a critical activity leads to an equivalent delay of the total project.

Critical Path A path having longest duration (completion time) in the network is called critical path. Shortest time project can be completed Any delay on critical path activities, delays project Critical path activities have zero slack

Explanation of Total Float Total Float is valid for a chain and not for a single activity. In the under discussion example, C and G have a float of 06 days. This means that the sum of delays for C and G may run up to 06 days without affecting the project finish time. Analysis of float is a particularly neat tool for calculating consequences of schedule variance.

Assume the following data with respect to schedule (for problem 04) B will be delayed by 04 days D will be delayed by 01 day E will be delayed by 05 days G will be delayed by 03 days

It is recognized that D is critical, hence a delay of at least one day to the overall project is unavoidable. Activity G has a float of 06 days. Since no other activity on that chain has a delay, the float will accommodate the 03 day delay of G.

Further, B and E are both on the same chain Further, B and E are both on the same chain. The float along the chain is 07 days and the total delay is 4+5=9 days. This means a 02 day delay of the project. In conclusion, the project will be delayed by 02 days and B-E-H will be the new critical path. A-D will have a float of one, and C-G a float of 04.

CPM Calculations for AON Network CPM calculation for AON Network is same as for AOA network, but the calculation of events is omitted.

Problem 05: General Hospital’s Activities and Predecessors Activity Immediate Predecessors Duration (days) A - 2 B 3 C D A, B 4 E F G D, E 5 H F, G

AON Network for General Hospital Includes Critical Path Start A B C D F G H 13 2 15 8 5 4 10 3 7 E 1 Slack=0 Slack=6 Slack=1 Slack=0

Critical Path for General Hospital Start H B D G

Explanation of Free Float Consider slack time of activity F. Delaying this activity decreases only its slack time and does not impact the slack time of any other activity. This type of slack time is referred as free slack / free float.

Gantt Chart for General Hospital Early Start and Finish A Build internal components B Modify roof and floor C Construct collection stack D Pour concrete and install frame E Build high-temperature burner F Install pollution control system G Install air pollution device H Inspect and test 1 2 3 4 5 6 7 8 9 10 1112 13 1415 16 This and the following slide illustrate the translation of Early and Late Start and Finish time to Gantt charts.

Gantt Chart for General Hospital Late Start and Finish A Build internal components B Modify roof and floor C Construct collection stack D Pour concrete and install frame E Build high-temperature burner F Install pollution control system G Install air pollution device H Inspect and test 1 2 3 4 5 6 7 8 9 10 1112 13 1415 16 GENERAL HOSPITAL This and the following slide illustrate the translation of Early and Late Start and Finish time to Gantt charts.

Table for Network Scheduling Problem 06 Table for Network Scheduling

Problem 06 Solution - AOA Method

Early Event Time (TE)

Finding TE Values

Late Event Time (TL)

Finding TL Values

Critical Path

Activity Scheduling An activity’s early starting time equals the TE of its beginning event: ES = TE. An activity’s late finishing time equals the TL for its ending event: LF = TL. From these, Two times are computed using the expected activity completion time t: Early finishing time: EF = ES + t. Late starting time: LS = LF - t.

Problem 06 Solution - AOA Method Scheduled Times must fall between ES and LF and allow at least time t to complete.

CPM Calculations for an AOA Network Problem 07 Activity Preceding Activity Duration (weeks) A - 10 B 07 C 12 D 18 E 14 F 13 G 16 H D, E I F, G 06 CPM Calculations for an AOA Network

Predecessors (Dependencies) Table for Network Scheduling Problem 08   Activity Predecessors (Dependencies) Time (Weeks) A - 3 B 5 C 7 D 8 E F G 4 H I 6 J G - H Table for Network Scheduling

Q&A