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.

Slides:

Advertisements

Similar presentations

Prosjektstyring We have a project with three activities: planning, purchase and construction. Each of the activities.

Advertisements

3 Project Management PowerPoint presentation to accompany

Precedence Diagramming

Chapter 6 Scheduling. 222 Learning Objectives Estimate the duration for each activity Establish the estimated start time and required completion time.

IE 2030 Lecture 5: Project Management Drawing Gantt Charts Time on horizontal axis, Activities on vertical axis. 1 bar per activity Length of bar = required.

© The McGraw-Hill Companies, Software Project Management 4th Edition Activity planning Chapter 6.

Associate Professor MIS Department UNLV

CP Chapter 4 Schedule Planning.

Chapter 6: Developing a Project Plan

Chapter 6 Time Planning & Networks

Richard Fisher 1 The University of Texas at Dallas Project Management BA 4320 Richard Fisher The University of Texas at Dallas.

Developing the Project Plan

Start D finish A B C E I G H F J KL N M ActivityDescription AExcavate BFoundation CRough wall DRoof EExterior plumbing FInterior.

PRJ566 Project Planning and Management Lecture: Network Diagrams.

PRJ566 Project Planning and Management Lecture: Dependencies and Network Diagrams.

Finding the Critical Path

PLANNING ENGINEERING AND PROJECT MANAGEMENT

Project Management in Practice, Fourth Edition Prepared by Scott M. Shafer, Updated by William E. Matthews and Thomas G. Roberts, William Paterson University.

1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edwards University.

Network analysis is the general name given to certain specific techniques which can be used for the planning, management and control of projects. Use.

Calculating Float ActivityPrecedenceDuration Start0 D 4 A 6 FD, A7 ED8 GF, E5 BF5 HG7 CH8 EndC, B0 1. What is the duration of the critical.

1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edwards University.

The Topics that will be addressed in this Module include:

ES=32 EF=34 LS=33 LF=35 ES=10 EF=16 LS=10 LF=16 ES=4+6=10 EF=10 LS=4

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.

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.

2 – 1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall. Project Management 2.

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)

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.

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.

Project Networks. A,4 B,3 C,4 D,6 E,3 H,6 F,5 G,4 I,2 St,0 Fin,0 Example Network - terminology C,t Activity Duration of Activity (ES, LS) Early Start.

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.

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.

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.

15C Backward scanning and crashing

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.

Projmgmt-1/14 DePaul University Project Management I - Realistic Scheduling Instructor: David A. Lash.

Prosjektstyring bma ACTIVITY A B C D E A 4 / 5 / 6 B 8 / 10 / 13 C 9 / 12 / 16 D 7.

The Critical Path – Precedence diagram method Luise Lorenz Christina Mohr.

PROJECT BUDGETING The overall goal in the budgeting process of a project is to determine how much money is to be spent each week or each month. PERT /

© 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.

PROJECT MANAGEMENT Definitions WBS = Work Breakdown Structure

TK3333 Software Management Topic 6: Scheduling. Contents  Estimate the duration for each activity  Establish the estimated start time and required completion.

Prof.Dr. Ahmet R. Özdural – Class Notes_06 - KMU417 Project Planning and Organization – Fall Semester.

Project Management – Part 1. Overview What is a project? Project management techniques Activity lists Network diagrams Critical path analysis Gant charts.

Time Planning and Control Activity on Node Network (AON)

Most commonly used methods for project management.

Project Management Critical Path Method Demonstration

Project Time Management.

Project Management CPM Method Tutorial-p2

Project Management Planning Models

IS Project Management Mini review

Project Management CPM Method Tutorial-p1

תזמון פרויקטים.

Solution to Problem 2 Developed by: Alex J. Ruiz-Torres, Ph.D.

Time Planning and Control Activity on Node Network (AON)

BEST VIEWED IN SLIDE SHOW MODE

Lecture 5: Project Time Planning (Precedence Diagramming Technique)

Exercise – A small building.

Presentation transcript:

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 five activities: A, B, C, D and E. The activities have different durations that are shown in the figure. For example, activity A has a duration of 5 weeks. The figure in the lower left corner shows the different values that are calculated in the network. First, we calculate early positions for all of the activities. These show the earliest start points (ES) and earliest finish points (EF).

Prosjektstyring A 5 WEEKS B 10 WEEKS C 12 WEEKS D 8 WEEKS E 6 WEEKS ACTIVITY (t) ESEF FL LS LF First, we take the starting point in activity A and assume that it starts in the timepoint 0. The earliest start point (ES) for A is 0, and we can directly find the earliest finish (EF) by adding to it the duration of A: = 5 By looking at the network, we see that the earliest time point for activity A gives the earliest time point that both activities B and C can start on. Activity B has a duration of 10 weeks and its earliest finish is in week = 15 Activity C has a duration of 12 weeks and its earliest finish is in week = 17 The earliest time point that activity D can start on is the maximum of the earliest finish values for B and C. Therefore, activity D starts on week 17. The duration of activity D is 8 weeks, so its earliest finish is = 25 Activity E therefore has an earliest start point in week 25.The earliest finish for activity E is week 31 because the duration of the activity is 6 weeks = 31

Prosjektstyring A 5 WEEKS 05 B 10 WEEKS 515 C 12 WEEKS 517 D 8 WEEKS 1725 E 6 WEEKS 2531 ACTIVITY (t) ESEF FL LS LF Now we can calculate backwards in the network to find the latest position for all activities. This means that we will calculate the latest start points and latest finish points. The finish date of the project is not given, so we assume that the latest finish point is equal to the earliest finish point. Thus, we set the latest finish equal to 31. Now we can subtract to find the latest start for all activities. For activity E, which has a duration of 6 weeks, the latest start is week = 25 Additionally, by looking at the network structure we can see that activity D at has a latest finish point in week 25. Activity D has a duration of 8 weeks, which gives us a latest start point of = 17 Since 17 is the latest time point at which activity D can start, both activities B and C should be finished by this time. If either activity B or C are finished later, the entire project does not finish in week 31. Activity B has a duration of 10 weeks and the latest start point is = 7 Activity C has a duration of 12 weeks and has a latest start point of = 5 Now we have two values for activity A that can give us the latest finish. We should choose the lowest value, which is value 5. The latest start for activity A is 0 and the duration is = 0

Prosjektstyring For activity A, the float becomes = A 5 WEEKS B 10 WEEKS C 12 WEEKS D 8 WEEKS E 6 WEEKS ACTIVITY (t) ESEF FL LS LF Now we will calculate the float of the different activities in the network. We find the floats by looking at the differences between the latest finish points (LF) and the earliest finish points (EF). For activity E, the float becomes = 0 For activity D, the float becomes = 0 For activity C, the float becomes = 0 For activity B, the float becomes = 2

Prosjektstyring A 5 WEEKS B 10 WEEKS C 12 WEEKS D 8 WEEKS E 6 WEEKS ACTIVITY (t) ESEF FL LS LF This means that all activities in the network are critical, except activity B. Therefore, we find a chain of critical activities A, C, D and E, which form a critical path in the network. At the project start at time 0, the project will have a total duration of 31 weeks.