1. 1 TCOM 5143 Lecture 11 Project Management

2. 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. 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. 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. 5 Example 1. Consider the example project of buying a small business. The project activities are listed below.

6. 6 1 2 43 B A C D

7. 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. 1 2 43 B A C D

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

9. 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. 10 Completion of the network for the example project could be shown as follows: 5 D 1 2 4 3 B A C E 5 D 1 2 4 3 B A C E F 6 G

11. 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 1 2 4 3 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. 12 Project Scheduling with PERT/CPM LAN example:Consider the project of designing a telecommunication network LAN with the following activities.

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

14. 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. 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 1-3-4-5 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. 3 2 9 5 1 2 4 3 B A C 5 1 E D

16. 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. 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}.

18. 18 1 2 A [0,5] Activity Earliest start time Earliest finish time 5 Activity time 4 D[5,8] 1 3 5 2 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] 5 3 14 6 4 12 1 4 2 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. 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. 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}=9 2 24 3 B C 5 1 E 4

21. 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 12. 3 2 9 5 1 2 4 3 B[3,6] A[0,2] C[6,11] 5 1 E[11,12] D[2,11] LFLS

22. 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] 1 3 5 2 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] 5 3 14 6 4 12 1 4 2 Note in the LAN example, LF(A)=Min{LS(C), LS(D), LS(E)} = Min{8, 7, 5}=5.

23. 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. 24 Activity schedule for the LAN example

25. 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. 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. 27 Lab Upgrade Example. C 1 3 5 2 B A D 6 F 7 E G 2 1 2 3 3 2 1

28. 28 C[2,3] 1 3 5 2 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. 29

30. 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. 31 The costs for the activities for the lab Upgrade example are shown in the table below.

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

33. 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 $30 000 (latest starting time schedule) and $43 000 (earliest starting time schedule). ES LS

34. 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. 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. 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. 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. 38 Cost overrun and cost underrun (cont.) Lab upgrade example