Network planning Learning objectives After these lectures you should be able to: - Produce and analyse activities networks - Calculate earliest and latest.

Slides:



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

Lecture Network Analysis
WBS: Lowest level OBS: Lowest level
© The McGraw-Hill Companies, Software Project Management 4th Edition Activity planning Chapter 6.
PLANNING ENGINEERING AND PROJECT MANAGEMENT
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edwards University.
Calculate the critical path Arrow diagram Critical Path Method Edina Nagy Lajos Kiss Szabolcs Hornyák.
Chapter 13 Project Scheduling: PERT/CPM
Chapter 9 Project Scheduling: PERT/CPM
Prosjektstyring A 5 WEEKS B 10 WEEKS C 12 WEEKS D 8 WEEKS E 6 WEEKS ACTIVITY (t) ESEF FL LS LF We have a network with.
ES=32 EF=34 LS=33 LF=35 ES=10 EF=16 LS=10 LF=16 ES=4+6=10 EF=10 LS=4
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.
Project Management Project  A series of related jobs usually directed toward some major output and requiring a significant time to perform Project management.
CSSE Sep.2008 Constructing and Analyzing the Project Network Diagram Chapter 6.
D1: Critical Events And Critical Paths. D1: Critical Events And Paths A critical path is the list of activities on an activity network that, if they are.
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.
Fall 2001BA Project Management1 BA 301 – Spring 2003.
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.
Critical Path Method (CPM)
إدارة المشروعات Projects Management
PREPARED BY : NOR AZAH BINTI AZIZ KOLEJ MATRIKULASI TEKNIKAL KEDAH PROJECT NETWORK DIAGRAM.
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
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
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.
ActivityDurationPredecessor Activity A3- B5- C4A D7B E10B F3E G8C, D In this example, we will carry out a calculation by using an AOA-network and the information.
Chapters 8, 9, and 10 Design Stage 1 Preconstruction Stage 2: Procurement Conceptual Planning Stage3: Construction Stage 4: Project Close-out.
ActivityDurationPredecessor Activity A3- B5- C4A D7B E10B F3E G8C, D In this example we will carry out a calculation by using AOA-network, on the basis.
Managing time ‘Time is nature’s way of stopping everything happening at once’ Hughes & Cotterell 2002 Production Process.
___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry Project Management Example -
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 Slide © 2005 Thomson/South-Western Chapter 10 Project Scheduling: PERT/CPM Project Scheduling with Known Activity Times Project Scheduling with Known.
Precedence Network Calculations the basic information that should be calculated in the precedence network are: 1) Early activity start (ES) 2) Early activity.
Projmgmt-1/14 DePaul University Project Management I - Realistic Scheduling Instructor: David A. Lash.
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.
Project Time Management J. S. Chou, P.E., Ph.D.. 2 Activity Sequencing  Involves reviewing activities and determining dependencies.  A dependency or.
The Critical Path – Precedence diagram method Luise Lorenz Christina Mohr.
Project Time Management J. S. Chou, P.E., Ph.D.. 2 Activity Sequencing  Involves reviewing activities and determining dependencies.  A dependency or.
© 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 Definitions WBS = Work Breakdown Structure
6/10/01Network Problems: DJK1 Network Problems Chapters 9 and 10.
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.
Dependencies and Network Diagrams. Agenda Dependencies Milestones The Network Early/Late Start/End dates Slack/Float Critical Path.
Prof.Dr. Ahmet R. Özdural – Class Notes_06 - KMU417 Project Planning and Organization – Fall Semester.
PROJECT MANAGEMENT ENCE-7323 TO 763-N CLASS 3 September 17, 2001 Carl E. Edlund
Project Planning, Scheduling and Control Planning: –defines objectives, tasks and preceeding relationships; estimates time and resources Scheduling: –identifies.
Scheduling Scheduling : is the process of converting a project action plan into an operating time table. Why scheduling ? To answer the following questions:
& Urban Planning Civil Engineering Department
Project Management Critical Path Method Demonstration
Project Time Management.
Project Management CPM Method Tutorial-p2
ENM448-Project Planning and Management
Project Scheduling Basics Activity on Node Precedence Diagrams
Project Management CPM Method Tutorial-p1
תזמון פרויקטים.
Software Project Management
Management & Project Control - Present by Dr.Amir.A.Shojaie
Analysing the AoA network
BEST VIEWED IN SLIDE SHOW MODE
Lecture 5: Project Time Planning (Precedence Diagramming Technique)
In-Class Scheduling Exercise
LECTURE 3.
Exercise – A small building.
Analysing the AoA network
Operations Research Lecture 7.
Presentation transcript:

Network planning Learning objectives After these lectures you should be able to: - Produce and analyse activities networks - Calculate earliest and latest start and finishing times for activities - Calculate activity floats and determine the critical path(s) through a network - Update networks as new information becomes available

PDM Footings/1 wk Brickwork/3 wks Roof/ 2 wks Landscape/1 wk Fence/1 wk

A ES EF t LS LF TF FF A = Activity description, i.e. ‘Brickwork’ t = Duration (usually in work days) ES = Earliest Start EF = Earliest Finish LS = Latest Start LF = Latest Finish TF = Total Float FF = Free Float

Network analysis Forward pass A/1 B/3 D/2 F/ C/0.5 D/0.5 ES EF NOTE: ES for the first activity is ‘0’, not ‘1’! Name/Duration

Network analysis Backward pass A/1 B/3 D/2 F/ C/0.5 D/ ES EF NOTE: The backward pass starts with the same Name/Duration LF value as the last EF for the final activity LS LF

Activity Draw an PDM network for this project. Then do a forward and backward pass. Activity Duration Depends on A 5 None B 5 A C 12 A D 3 C E 6 B and 2/3 of C F 8 B and 2/3 of C G 14 A H 5 D, E, F and G

Solution F/ A/5 B/5 E/ C1/8 C2/4 D/3 H/ G/

Development of a network Level 1 Level 2 Level 3 Final

Activity Float Critical activities: Have no float and are therefore fixed in time. ES = LS and EF = LF Total Float (TF): The amount of time that an activity can be delayed, without that affecting the project completion time. TF = LF – EF = LS – ES Free Float (FF): The amount of time an activity can be delayed, without that affecting the start of any following activity. FF = ES( any following activity ) – EF

13 21 F/ A/5 B/5 E/ C1/8 C2/4 D/3 H/ G/ Determine the Critical Paths(s) and all activity floats!

Activity TF FF Critical? A 0 0 Yes B 3 3 C1 0 0 Yes C2 1 0 D 1 1 E 2 2 F 0 0 Yes G 2 2 H 0 0 Yes Critical Path = A - C1 - F - H

13 21 F/ A/5 B/5 E/ C1/8 C2/4 D/3 H/ G/ Critical Path (A – C1 – F – H) highlighted in network

Tutorial: Critical Path Method (CPM) Carry out a critical path analysis for the following project in order to determine the total completion time for the project and the critical activities. Illustrate the critical path(s) in the CPM network. Calculate and list the Total and Free floats for all activities. Activity Duration Depends on activity A 3 weeks - B 2 - C 5 A D 6 A and B E 4 Half of D F 4 C G 5 D H 8 C and E I 9 D J 6 I and H K 18 B L 4 K