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.

Slides:



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

Precedence Diagramming
WBS: Lowest level OBS: Lowest level
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.
PLANNING ENGINEERING AND PROJECT MANAGEMENT
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
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
Spring 2008, King Saud University Arrow Diagramming Dr. Khalid Al-Gahtani 1 CPM Network Computation Computation Nomenclature The following definitions.
1 Lecture by Junaid Arshad Department of Engineering Management Abridged and adapted by A. M. Al-Araki, sept WBS: Lowest level OBS: Lowest level.
CSSE Sep.2008 Constructing and Analyzing the Project Network Diagram Chapter 6.
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.
Tutorial 2 Project Management Activity Charts (PERT Charts)
PREPARED BY : NOR AZAH BINTI AZIZ KOLEJ MATRIKULASI TEKNIKAL KEDAH PROJECT NETWORK DIAGRAM.
MGMT 483 Week 8 Scheduling.
Network exercise (P2) Consider the PERT/CPM network shown below. D A 2
Project Scheduling Critical Path Method
Dr. Hany Abd Elshakour 5/4/2015 3:55 PM 1. Dr. Hany Abd Elshakour 5/4/2015 3:55 PM 2 Time Planning and Control Activity on Node Network and Precedence.
Chapter 3 (Continued) Outline Recap CPM (continued)  Assign time estimates to each activity  Compute the longest time path through the network.
Project Scheduling: Networks, Duration Estimation, and Critical Path
Chapters 8, 9, and 10 Design Stage 1 Preconstruction Stage 2: Procurement Conceptual Planning Stage3: Construction Stage 4: Project Close-out.
Activity networks – Example 1 TaskDuration (hours)Immediate predecessors A3- B4- C6- D5A E1B F6B G7C, D, E The table below shows the tasks involved in.
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.
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.
1 ARCH 435 PROJECT MANAGEMENT Lecture 3: Project Time Planning (Arrow Diagramming Technique) Activity on Arrow (AOA)
Project Scheduling: Networks, Duration estimation, and Critical Path
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.
Scheduling Computations for Precedence Networks. Prof. Awad Hanna Tabular Format (Precedence Diagram)  Can be carried out on the tabular form without.
USING MS PROJECT Project management software programs such as Microsoft Project can be used for developing the project schedule We demonstrate the use.
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.
Time Planning and Con trol Precedence Diagram.  Precedence Diagramming  An important extension to the original activity-on-node concept appeared around.
8-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Project Management Chapter 8.
© 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
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.
Project Management – Part 1. Overview What is a project? Project management techniques Activity lists Network diagrams Critical path analysis Gant charts.
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:
Time Planning and Control Time-Scaled Network
Activity networks – Example 1
Time Planning and Control Activity on Node Network (AON)
Project Time Management.
Projects: Critical Paths
Project Management CPM Method Tutorial-p2
Time Planning and Control Activity on Node Network (AON)
Activity on Arrow Project Management.
Time Planning and Control Precedence Diagram
Tabular Format (Precedence Diagram)
Time Planning and Control Time-Scaled Network
Project Management CPM Method Tutorial-p1
Time Planning and Control Activity on Node Network (AON)
BEST VIEWED IN SLIDE SHOW MODE
General Foundry Example of PERT/CPM
Lecture 5: Project Time Planning (Precedence Diagramming Technique)
Time Planning and Control Precedence Diagram
Presentation transcript:

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 maximum time an activity can be delayed without delaying the completion of the project. TF of “A”= LS of “A”- ES of “A” (or LF of “A”- EF of “A”)

Free Float : The maximum time activity can be delayed without FF of “A” = Minimum ES of all immediate successors - EF of “A” FF of “A” = Minimum{ 12, 21, 14 } - 10 = = 2

Critical Path : The longest path or paths from project start to all activities with zero float belong to the critical path. 2. Interpretation of Total and Free Floats A total float (TF) indicates the time frame in which an activity can take place without delaying the project completion while a free float indicts the time frame in which that activity can take place without delaying the start time of the immediate successors.

The best way to visualize these floats is to draw a time-phased diagram of the schedule. A time- phased diagram is a schedule display against a time scale. Let us draw the time-phased diagram of the network shown in Figure 1. ES, EF, LS, LF, TF, and FF of each activity are summarized in Table 1. The time-phased diagram in Figure 2 shows every activity starting on its early start time. The time-phased diagram shows that activities A and E and G have no float (TF=FF=0) Because any delay in these activities will result in a delay of the total project.

Activities F and H have the same total float (TF=2) because both of them can be delayed two days without delaying the project. Activity F has no free float because any delay in activity F will delay the start of activity H. Activity H has a free float equal to total float because activity H has no successors. The same thin can be said about activities C and D. Activity C and D have both a total float of 10 days. But activity C has a free float of zero.

3. Schedule Computation Checks a. In the case of only one starting activity, ES and LS of the first activity must be equal. b. Free float must be always less or equal to total float (FF <= TF). c. All activities in the critical path must have zero free and to 1 d. When an activity has only one predecessor, the free float of that predecessor is always equal to zero (FF=0) f. The best and most reliable check is to draw a time- phased diagram.