1 TCOM 5143 Lecture 11 Project Management. 2 What’s Project Management? Project management involves planning and scheduling the different activities of.

Slides:



Advertisements
Similar presentations
WBS: Lowest level OBS: Lowest level
Advertisements

Chapter 7 Project Management
Associate Professor MIS Department UNLV
464 Lecture 09 CPM Revision. Scheduling Techniques r The scheduling techniques are î To plan, schedule, budget and control the many activities associated.
Finding the Critical Path
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edwards University.
Project Scheduling / Time Study
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.
Terminology Project: Combination of activities that have to be carried out in a certain order Activity: Anything that uses up time and resources CPM: „Critical.
A simple set of tasks in “timeline-schedule” form Req. Gathering Req. Analysis High Level Design Detail Design & Code Test Case DevelopmentTest Execution.
1 Topics to cover in 2 nd part ( to p2). 2 Chapter 8 - Project Management Chapter Topics ( to p3)
Developing a Project Plan
Project Scheduling Basic Approach. projectA project is a collection of tasks that must be completed in minimum time or at minimal cost. activitiesIt is.
pert and cpm ch 9 Learning objectives:
PERT / CPM PERTProgram Evaluation & Review Technique CPMCritical Path Method.
1 Project Scheduling CP - Chapter 10 Lecture 3. 2 Project Management  How is it different?  Limited time frame  Narrow focus, specific objectives 
Project Scheduling Prof. Jiang Zhibin Dept. of IE, SJTU.
إدارة المشروعات Projects Management
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Tutorial 2 Project Management Activity Charts (PERT Charts)
Project Scheduling Basic Approach. projectA project is a collection of tasks that must be completed in minimum time or at minimal cost. activitiesIt is.
MGMT 483 Week 8 Scheduling.
5/4/20151 NETWORK SCHEDULING TECHNIQUES. 5/4/20152 Network Diagrams  PMI defines the scheduling process as: “the identification of the project objectives.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
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.
Project Scheduling. SEEM Project Scheduling (PS) To determine the schedules to perform the various activities (tasks) required to complete the project,
PERT/CPM Models for Project Management
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
Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.
Projects: Critical Paths Dr. Ron Lembke Operations Management.
Project Management Techniques.
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.
1 Material Management Class Note # 5-A ( in review ) Project Scheduling & Management Prof. Yuan-Shyi Peter Chiu Feb
Software project management (intro) Scheduling Network.
PROJECT MANAGEMENT Outline What is project mean? Examples of projects… Project Planning and Control Project Life Cycle Gantt Chart PERT/CPM.
MANA 705 DL © Sistema Universitario Ana G. Méndez, All rights reserved. W6 6.2 Operation Management Operation Management Managing Projects Techniques.
Project Scheduling: PERT/CPM
Copyright 2006 John Wiley & Sons, Inc. Beni Asllani University of Tennessee at Chattanooga Project Management Operations Management - 5 th Edition Chapter.
Project Management Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 PROJECT MANAGEMENT 18-1 Project Management.
Switch off your Mobiles Phones or Change Profile to Silent Mode.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
8-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Project Management Chapter 8.
Chapter 7 – PERT, CPM and Critical Chain Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.
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.
Project Management – Part 1. Overview What is a project? Project management techniques Activity lists Network diagrams Critical path analysis Gant charts.
Project Planning & Scheduling What is a “project”? Objectives and tradeoffs Planning and Control in Projects Scheduling Methods Constant-Time Networks.
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.
Project Management Chapter Topics
Project Management: PERT/CPM
Project Planning & Scheduling
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.
Project Scheduling Lecture # 1.
Project Planning & Scheduling
Projects: Critical Paths
Project Management CPM Method Tutorial-p2
PROJECT SCHEDULING PERT - Cost.
PLANNING ENGINEERING AND PROJECT MANAGEMENT
Time Planning and Control Precedence Diagram
CHAPTER 8: SCHEDULING (PENJADUALAN)
תזמון פרויקטים.
Lecture 5: Project Time Planning (Precedence Diagramming Technique)
Slides Prepared by JOHN LOUCKS
Presentation transcript:

1 TCOM 5143 Lecture 11 Project Management

2 What’s Project Management? Project management involves planning and scheduling the different activities of a project. A project is made of a number of activities that all need to be completed in order to finish the project. Activities are usually interdependent on each other; i.e., some activities cannot start unless other activities are finished.

3 Project management techniques such PERT/CPM can be used to answer questions such as the following: What is the total time to complete (finish) the project? What are the scheduled start and finish dates for each specific activity? Which activities are “critical” and must be completed exactly as scheduled in order to keep the project in schedule? How long can “noncritical” activities be delayed before they cause a delay in the total project?

4 PERT/CPM networks PERT stands for Program Evaluation and Review Technique CPM stands for Critical Path Method The main step in project scheduling is to identify all activities or jobs of the project and the immediate predecessors of every activity. The immediate predecessors of a particular activity are the activities that should be completed first before the activity in question can start.

5 Example 1. Consider the example project of buying a small business. The project activities are listed below.

B A C D

7 The activities are shown on the branches or arcs of the network. The nodes of the network correspond to the beginning and ending of the activities. The completion of all the activities that lead into a node is called an event. For example, node 3 corresponds to the event that both activities A and C have been completed B A C D

8 Example 2 Consider developing the network for a project having the following activities and immediate predecessors B A C D

9 Example 2 (cont.) Activity E starts after the completion of activity C. To represent this, it is incorrect to show activity E beginning at node 3 because if E starts at node 3 this implies that both A and C precede E, which is incorrect. To avoid the above problem, we insert in the network a dummy activity. A dummy variable is a fictitious variable used to ensure that the proper precedence relationships among the activities are shown in the network. A dummy activity is represented by a dashed line.

10 Completion of the network for the example project could be shown as follows: 5 D B A C E 5 D B A C E F 6 G

11 Rule: It is not acceptable to have two activities that start at the same node and finish at the same node. To solve the above problem, we add a dummy activity. 5 D B A C E F 6 G 7 Note: Dummy activities can be used to show precedence relationships correctly and to eliminate the possible confusion of two or more activities having the same starting and ending nodes.

12 Project Scheduling with PERT/CPM LAN example:Consider the project of designing a telecommunication network LAN with the following activities.

13 LAN example (cont.) 4 D B A C E F 6 G 7 H I Can we complete the project in less than 51 weeks? Why?

14 The critical path A path is a sequence of connected activities that leads from the starting node of the project to the completion node of the project. A path does not need to pass through all the nodes in the network. The longest path is called the critical path. The activities on the critical path are called the critical activities of the project.

15 Is the critical path useful? Rule: The critical path determines the total time required to finish the project. Consider the following small example The longest path is the path with total time equal to 12. A, D and E are critical activities Rule: The only way for the project manager to reduce the total project time is to reduce the length of the critical path by shortening the durations of the critical activities B A C 5 1 E D

16 Start times We assume that the project starts at time 0. Let ES(j)=Earliest start time for activity j EF(j)=Earliest finish time for activity j T(j)=duration time for activity j Rule: EF(j) = ES(j) + T(j)

17 Start times (cont.) Rule: The earliest start time for an activity leaving a particular node is equal to the largest of the earliest finish times for all activities entering the node. Equivalently, Let activity j leave node k, then ES(j)=Max{EF(i) for all activities i such that i enters node k}.

A [0,5] Activity Earliest start time Earliest finish time 5 Activity time 4 D[5,8] B[0,6] A [0,5] C[5,9] E[5,6] F[6,10] 6 G[10,24] 7 H[9,21] I[24,26] Rule: The total time required to finish the project is equal to the earliest finish time for the last activity of the project. For the LAN example, it is 26 weeks.

19 Finish times Let LS(j)=Latest start time for activity j LF(j)=Latest finish time for activity j T(j)=duration time for activity j Rule: LS(j) = LF(j) - T(j)

20 Finish times (cont.) Rule: The latest finish time for an activity entering a particular node is equal to the smallest of the latest start times for all activities leaving the node. Equivalently, If we let activity j enter node k. Then LF(j)=Min{LS(i) for all activities i such that i leaves node k}. In the example above, if LS(C)=12 and LS(E)=9, what is LF(B)? LF(B)=Min{LS(C),LS(E)}=Min12,9}= B C 5 1 E 4

21 Finish times (cont.) We compute the latest start times and latest finish times by making a backward pass calculation. That is, using the total duration of the project as the latest finish time for the last activity of the project, we trace back trough the network, computing a latest start and latest time for each activity. In the small example, the duration of the project is B[3,6] A[0,2] C[6,11] 5 1 E[11,12] D[2,11] LFLS

22 Finish times (cont.) Let’s compute the latest finish times and latest start times for the activities of the LAN project. The latest finish time for activity I is 26 because it is the last activity in the project. 4 D[7,10] B[6,12] A [0,5] C[8,12] E[5,6] F[6,10] 6 G[10,24] 7 H[12,24] I[24,26] Note in the LAN example, LF(A)=Min{LS(C), LS(D), LS(E)} = Min{8, 7, 5}=5.

23 Slack of an activity Definition: The slack of an activity is defined as the length of time an activity can be delayed without affecting the total time required to finish the project. Slack(j)=LS(j)-ES(j) = LF(j)-EF(j) The activities with zero slack correspond to the critical activities of the project.

24 Activity schedule for the LAN example

25 Let’s answer the following questions regarding scheduling the activities of the LAN project. 1.What is the total time to complete the project? Answer: The project can be completed in 26 weeks. 2. What are the scheduled start and completion times for each activity? Answer: The activity schedule (see previous table) shows the earliest start, latest start, earliest finish, and latest finish times for each activity.

26 3. Which activities are critical and must be completed exactly as scheduled in order the keep the project on schedule? Answer: The five activities, A, E, F, G, and I, are the critical activities. 4. How long can “noncritical” activities be delayed before they cause a delay in the completion time for the project? Answer: The activity schedule (see previous table) shows the slack time associated with each activity.

27 Lab Upgrade Example. C B A D 6 F 7 E G

28 C[2,3] B[0,3] A [0,2] D[3,6] 6 F[6,8] 7 E[3,5] G[5,6] 2[3,5] 1[5,6] 2[6,8] 3[0,3] 3[3,6] 2[5,7] 1[7,8] ES EF LS LF

29

30 Planning and scheduling project costs: PERT/Cost technique The budgeting process for project involves the following:  Identify the costs for all the activities of the project.  Develop a schedule or forecast of when the costs are expected to incur.  During various stages of project completion, compare actual (incured) costs to scheduled (budgeted) costs, and take corrective actions if necessary.  In using the PERT/Cost technique, it is assumed that the cost of each activity occurs at a constant rate over the duration of the activity.

31 The costs for the activities for the lab Upgrade example are shown in the table below.

32 If the activities start at their earliest starting times, the month-by-month cost forecast is shown in the table below.

33 The figure below shows the forecasted total project costs for both the earliest and the latest starting time schedules. The area between the two curves shows the possible budgets for the project. For example, by month 3 total project costs should be between $ (latest starting time schedule) and $ (earliest starting time schedule). ES LS

34 Controlling project costs Periodically (for example biweekly or monthly) throughout the project's duration, the project manager should do the following: Collect up-to-date information on the cost status of all completed and in-process activities. Identify the sources of cost overruns and cost underruns and take corrective actions where necessary. There is a cost overrun for an activity when actual cost exceeds budgeted cost. There is a cost underrun when actual cost is less than budgeted cost.

35 Lab upgrade example At the end of the fourth month of the project, the project manager has collected the actual cost and percent completion data for the project activities as shown in the table below.

36 Cost overrun and cost underrun Let AC i = actual cost to date for activity i B i = budget for activity i p i = percent completion for activity i V i = value of work completed for activity i V i = (p i /100) B i.

37 Cost overrun and cost underrun (cont.) Cost overrun or cost underrun (D i ) for an activity is computed as the difference between the actual cost and the value for work completed (that is, the appropriate budgeted cost). D i = AC i - V i If D i is positive, there is a cost overrun. If D i is negative, there is a cost underrun.

38 Cost overrun and cost underrun (cont.) Lab upgrade example