PROJECT MANAGEMENT Chu Eu Ho Dept. of Civil and Environmental Engineering Massachusetts Institute of Technology.

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
USING MS PROJECT Project management software programs such as Microsoft Project can be used to compute the earliest and latest start and finish times and.
Project Scheduling: PERT-CPM
Project Management Projects are unique, one-time operations designed to accomplish a specific set of objectives in a limited timeframe Project managers.
PRJ566 Project Planning and Management Lecture: Network Diagrams.
PRJ566 Project Planning and Management Lecture: Dependencies and Network Diagrams.
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.
X- FUNDAMENTAL SCHEDULING PROJESS
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.
Network Diagramming Network Analysis  The common term for network analysis is PERT  PERT stands for Program Evaluation and Review Technique  The word.
CSSE Sep.2008 Constructing and Analyzing the Project Network Diagram Chapter 6.
2 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Project Management 2.
A simple set of tasks in “timeline-schedule” form Req. Gathering Req. Analysis High Level Design Detail Design & Code Test Case DevelopmentTest Execution.
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.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
PREPARED BY : NOR AZAH BINTI AZIZ KOLEJ MATRIKULASI TEKNIKAL KEDAH PROJECT NETWORK DIAGRAM.
Prosjektstyring A (12) B (10) C (12) D (9) E (18) F (11) H (10) G (11) I (7) FF3 SS8 FF5 FF7FS0 SF21 SS8 FF3.
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.
Chapters 8, 9, and 10 Design Stage 1 Preconstruction Stage 2: Procurement Conceptual Planning Stage3: Construction Stage 4: Project Close-out.
Network planning Learning objectives After these lectures you should be able to: - Produce and analyse activities networks - Calculate earliest and latest.
Project Management (2) Chapter 16, Part 2. EJR 2006 Review of Project Management, Part 1 What is a project? Examples of projects Project performance expectations.
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.
CE 405 – SCHEDULING CRITICAL PATH In order to be an effective Scheduler/ Project Manager – and realizing that you will have too many things demanding your.
EMGT 501 HW #2 Answer. 020/3 X 3 05/601-1/62/3050/3 X 6 0-5/300-2/3-1/3180/3 (c).3/230with )3/80,0,0,3/50,3/20,0(*)*, ( solution Optimal   Z.
EMGT 501 HW #2 Solutions Chapter 6 - SELF TEST 21 Chapter 6 - SELF TEST 22.
Software project management (intro) Scheduling Network.
Time Management Ahmed Awad, Ph.D., PMP. Time Management It includes the processes required to ensure timely completion of the project. b Activity Definition.
USING MS PROJECT Project management software programs such as Microsoft Project can be used for developing the project schedule We demonstrate the use.
Project Management Chapter 3 BUSI 2106 – Operations Management.
USING MS PROJECT 2010 Project management software programs such as Microsoft Project 2010 can be used for developing the project schedule and budget, and.
The Critical Path – Precedence diagram method Luise Lorenz Christina Mohr.
MANA 705 DL © Sistema Universitario Ana G. Méndez, All rights reserved. W6 6.2 Operation Management Operation Management Managing Projects Techniques.
Amin Salari, CCM, PMP, LEED AP – Lundgren Management
© Construction Management Association of America. Do Not Duplicate or Reproduce. Standards of Practice Course CPM Scheduling Lab.
Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 PROJECT MANAGEMENT 18-1 Project Management.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Project Management Part 5 Project Scheduling. Topic Outline: Project Scheduling Identifying relationships among activities Project network diagrams Identifying.
PROJECT MANAGEMENT Definitions WBS = Work Breakdown Structure
A tutorial on MS Project James Burns. 22 Learning Objectives  Entering Tasks in the Gantt View  Task subordination  Linking of Tasks  Setting start.
Irwin/McGraw-Hill  The McGraw-Hill Companies, Inc Project Scheduling IENG 321 IENG 321.
Project Management – Part 1. Overview What is a project? Project management techniques Activity lists Network diagrams Critical path analysis Gant charts.
Project Management Fundamentals - Planning Tools 1.
Chapter 4 MIS Project Management Lecturer Sihem Smida Sihem Smida Developing a project plan.
The Network Diagram. When to Do What?  Carrying out one activity after the other may result in project completion, but it will take the longest possible.
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 MGT 30725
UNIT II Scheduling Procedures & Techniques FLOAT
Project Management (PERT/CPM) PREPARED BY CH. AVINASH
Project Management Critical Path Method Demonstration
Project Scheduling Chapter 14.
A tutorial on MS Project
Projects: Critical Paths
Time Planning and Control Precedence Diagram
Project Management CPM Method Tutorial-p1
תזמון פרויקטים.
BEST VIEWED IN SLIDE SHOW MODE
General Foundry Example of PERT/CPM
In-Class Scheduling Exercise
Exercise – A small building.
Presentation transcript:

PROJECT MANAGEMENT Chu Eu Ho Dept. of Civil and Environmental Engineering Massachusetts Institute of Technology

Some Observations from Chase an Engineer Reports What a Project Manager is most concerned with:- Financial Issues a. Engineering Design b. Construction Scheduling c. Control of Revenue Flow Engineers don t make good financial decisions

Scheduling is very important The faster you finish, the more you save on fixed costs and interests Fixed Costs - Salary - Overheads : Property Office Rental Equipment Utilities Variable Costs - Bank Loans - Professional Liability Insurance - Performance Bond - Payment Bond

Basement Construction Instrumentation Slurry wall installation Jet grouting Foundation installation King posts and decking erection Excavation Strut installation + preloading Excavation Strut installation + preloading Cutting off pileheads Casting Pilecaps Casting base slab Casting columns + intermediate floor slabs Casting ground floor slab

NETWORK SCHEDULING Activity Network A graphical representation describing connections between all activities in a project Activity Path A continuous string of activities within the network from beginning to end Critical Path The activity path with the longest duration, in which any delay of one activity causes a similar delay to the entire project completion

ACTIVITY RELATIONSHIPS Finish-Start FS = Activity j may start units of time after finishing activity i Normal FS = 0 Activity j may start immediately after finishing activity i Start-Start SS = Activity j may start units of time after starting activity i Finish-Finish FF = Activity j may finish units of time after finishing activity i

TIME TO START/FINISH Activity Duration d i The estimated duration of each activity Earliest Start ES i The earliest time that activity i may start Earliest Finish EF i The earliest time that activity i may finish EF i = ES i + d i Latest Start ES i The latest time that activity i may start Latest Finish EF i The latest time that activity i may finish LS i = LF i - d i

FLOAT TIME Total Float TF i The total time that activity i may be postponed without delaying project completion TF i = LS i - ES i or LF i - EF i Free Float FF i The maximum time that activity i may be postponed without delaying the earliest start (ES j ) or earliest finish (EF j ) of any following activity j

8 STEPS FOR NETWORK ANALYSIS 1. List all the activities 2. Assign duration for each activity 3. Set up Network Diagram 4. Carry out Forward Calculations for ES and EF 5. Determine Project Completion Time 6. Carry out Backward Calculations for LS and LF 7. Determine Float available TF and FF 8. Identify Critical Path(s)

Schedule computation Earliest Start (ES j ) and Earliest Finish (EF j ) of the subsequent activity j 1. Calculate all possible ES times for activity j:- FS relationship, ES j = EF i + SS relationship, ES j = ES i + FF relationship, ES j = {EF i + } - d j 2. Select the latest time for ES j 3. Calculate EF j = ES j + d j

Latest Start (LS i ) and Latest Finish (LF i ) of the previous activity i 1. Calculate all possible LF times for activity i:- FS relationship, LF i = LS j - SS relationship, LF i = {LS j - } + d i FF relationship, LF i = LF j - 2. Select the earliest time for LF i 3. Calculate LS i = LF i - d i

CALCULATIONS FOR FLOAT TOTAL FLOAT 1. Need to know ES, EF, LS and LF for activity i 2. Calculate TF for activity i TF i = {LS i – ES i } or {LF i - EF i }

FREE FLOAT 1. Calculate all possible FF between activity i and j:- FS relationship, FF i = {ES j - EF i } - SS relationship, FF i = {ES j - ES i } - FF relationship, FF i = {EF j - EF i } - 2. Select the smallest time gap for FF i

Network Scheduling Example Analysis