1. Project Management November 22, 2013

2. Engineering Economics Macroeconomics Operations Research Linear programming PERT/CPM Queueing Theory Accounting

3. Project Management Tools: Work breakdown structure: what there is to do Gantt Chart: times to do things Critical Path Method: dependencies; time/cost trade-offs

4. Work breakdown structure: what there is to do E.g., “Prepare beans on toast”

5. Prepare Beans on Toast Prepare BeansPrepare ToastCombine Open Can Place Beans in saucepan Place Saucepan on stove Light stove Stir beans till warm Slice bread Place bread in toaster Depress toaster button Remove toast from toaster Butter the toast

6. WBS activities should be mutually exclusive and collectively exhaustive The WBS allows us to calculate total project cost and personnel requirements It can include time estimates for each activity, but it doesn’t, by itself, allow us to calculate project duration.

7. TaskStartEnd9:009:029:049:069:089:109:12 1Open can9:009:01 2Fill saucepan 9:019:03 3Saucepan on stove 9:039:04 4Light stove 9:049:05 5Stir9:059:10 6Cut bread9:009:01 7Bread in toaster 9:019:06 8Butter toast 9:069:07 9Beans onto toast 9:109:11 A Gantt Chart for Beans on Toast

8. TaskStartEnd9:009:029:049:069:089:109:12 1Open can9:009:01 2Fill saucepan 9:019:03 3Saucepan on stove 9:039:04 4Light stove 9:049:05 5Stir9:059:10 6Cut bread9:009:01 7Bread in toaster 9:019:06 8Butter toast 9:069:07 9Beans onto toast 9:109:11 Dependencies shown, but not self-evident

9. CPM: Two conventions Start Can Open Bread cut Beans on Toast Ready Beans Ready Toast Ready Open Can Slice bread Toast Bread Heat Beans Beans onto toast Dummy AOA AON Start Open Can Slice bread Heat Beans Toast bread Beans onto toast End

10. Finding the critical path Start Open Can T: ES: EF: LS: LF: Slice bread T: ES: EF: LS: LF: Heat Beans T: ES: EF: LS: LF: Toast bread T: ES: EF: LS: LF: Beans onto toast T: ES: EF: LS: LF: End Add notation: “T” = time, “ES” = Earliest Start, “EF” = Earliest Finish “LS” = Latest Start, “LF” = Latest Finish

11. Finding the critical path Start Open Can T: 1:00 ES: EF: LS: LF: Slice bread T:1:00 ES: EF: LS: LF: Heat Beans T: 5:00 ES: EF: LS: LF: Toast bread T:3:00 ES: EF: LS: LF: Beans onto toast T: 1:00 ES: EF: LS: LF: End Fill in the times.

12. Finding the critical path Start Open Can T: 1:00 ES:0 EF:1 LS: LF: Slice bread T:1:00 ES: 0 EF:1 LS: LF: Heat Beans T: 5:00 ES: EF: LS: LF: Toast bread T:3:00 ES: EF: LS: LF: Beans onto toast T: 1:00 ES: EF: LS: LF: End ES for the first activity is zero, EF is ES + T

13. Finding the critical path Start Open Can T: 1:00 ES:0 EF:1 LS: LF: Slice bread T:1:00 ES: 0 EF:1 LS: LF: Heat Beans T: 5:00 ES:1 EF:6 LS: LF: Toast bread T:3:00 ES:1 EF:4 LS: LF: Beans onto toast T: 1:00 ES:6 EF:7 LS: LF: End For subsequent activities, ES is max(EF of all upstream activities), EF is ES + T

14. Finding the critical path Start Open Can T: 1:00 ES:0 EF:1 LS: LF: Slice bread T:1:00 ES: 0 EF:1 LS: LF: Heat Beans T: 5:00 ES:1 EF:6 LS: LF: Toast bread T:3:00 ES:1 EF:4 LS: LF: Beans onto toast T: 1:00 ES:6 EF:7 LS: LF: End For subsequent activities, ES is max(EF of all upstream activities), EF is ES + T

15. Finding the critical path Start Open Can T: 1:00 ES:0 EF:1 LS: LF: Slice bread T:1:00 ES: 0 EF:1 LS: LF: Heat Beans T: 5:00 ES:1 EF:6 LS: LF: Toast bread T:3:00 ES:1 EF:4 LS: LF: Beans onto toast T: 1:00 ES:6 EF:7 LS: LF:7 End The earliest finish of the final activity is also the latest acceptable finish for the final activity, assuming we don’t want the project completion to be delayed.

16. Finding the critical path Start Open Can T: 1:00 ES:0 EF:1 LS:0 LF:1 Slice bread T:1:00 ES: 0 EF:1 LS: 2 LF: 3 Heat Beans T: 5:00 ES:1 EF:6 LS:1 LF:6 Toast bread T:3:00 ES:1 EF:4 LS:3 LF: 6 Beans onto toast T: 1:00 ES:6 EF:7 LS:6 LF:7 End Then we do a second, backwards, pass through the network, where for each node, LF is min(LS of all downstream nodes) and LS is LF - T

17. Finding the critical path Start Open Can T: 1:00 ES:0 EF:1 LS:0 LF:1 Slice bread T:1:00 ES: 0 EF:1 LS: 2 LF: 3 Heat Beans T: 5:00 ES:1 EF:6 LS:1 LF:6 Toast bread T:3:00 ES:1 EF:4 LS:3 LF: 6 Beans onto toast T: 1:00 ES:6 EF:7 LS:6 LF:7 End The difference between EF and LF for a node is the slack for that activity Slack = 2

18. Finding the critical path Start Open Can T: 1:00 ES:0 EF:1 LS:0 LF:1 Slice bread T:1:00 ES: 0 EF:1 LS: 2 LF: 3 Heat Beans T: 5:00 ES:1 EF:6 LS:1 LF:6 Toast bread T:3:00 ES:1 EF:4 LS:3 LF: 6 Beans onto toast T: 1:00 ES:6 EF:7 LS:6 LF:7 End Activities with no slack are on the critical path Slack = 2

19. Crashing a Project Crashing an activity means spending more money in order to get it done faster (Important note: This doesn’t always work – see Brooks, “The Mythical Man-Month”) It’s obviously a waste of money to crash any activity that has slack.

20. Crashing a Project 1.Assume linearity: Crash cost – normal cost Crash cost/ unit time = Normal Time –Crash Time 2. Find minimum crash cost/unit time on the critical path 3. Reduce time as much as possible 4. Repeat

21. You own a start-up software company. You and your colleagues are planning the launch of a new computer. “Before we can start designing the Mark II, we need to complete three steps: there’s the market research, which will take about six weeks, there’s about five weeks of technical research needed to identify the best chip set, and meanwhile we’re going to have to raise capital to pay for all of this – we should allow four weeks for that. The good news is that all those activities can go on independently. When they’re all complete, we’ve reached Milestone 1 and we can start working on the hardware and software.” “That’s a dependency – we can’t write the software till we’ve got a machine to run it on.” “There’s a way round that: we can emulate the Mark II on a Mark I machine. It won’t run as fast, but we can use it for debugging. So we can develop the pre-prototype hardware, which should take about twelve weeks, and write software on an emulated machine at the same time – we should be able to get that done in ten weeks. Once both those things are done, we’re at Milestone 2.” “Once the pre-prototype hardware is done, we can adapt the software to run on it. That will take another twelve weeks. Meanwhile our hardware engineers can build the prototype Mark II. That’s going to be the longest step in the whole process – we’ll allow twenty-four weeks for that. And once those two steps are complete, we’re at Milestone 3.”

22. “Once we’re past Milestone 3, there’s a lot of things we can get started on. We can start designing the production version of the Mark II, and at the same time design the production tooling. Both those steps should take about sixteen weeks. We’ll also be in a position to release guidelines to applications developers, inside and outside the company. We can expect the first applications to be ready within twenty weeks, ideally just as the Mark II is put on the market.” “Milestone 3 is also the point at which we can start adapting the software to the prototype machine. Let’s allow eighteen weeks for that. ” “So when the production tooling and the production version of the Mark II are complete, and assuming the software for the prototype machine is ready by that time, we’ve at Milestone 4. Then all we’ve got to do is design the hardware packaging – call that a six-week job – adapt the software to the production version of the machine – allow twelve weeks for that – once the software is complete, we package that too, which shouldn’t take more than four weeks – and, as long as the applications developers are on schedule, we can put the machine on the market.” Represent the project as a Gantt chart, and calculate the earliest possible finish date.

24. 2. Represent the project using both an AOA and an AON network diagram. Note that it may be useful to use `dummy arcs’ to represent the dependencies between some activities 3. Using the AON diagram developed in 2, perform a critical path analysis and complete a table showing the slack for each activity.

25. First, the Activity-on-Arc representation. The arcs are labelled according to the table below. We use dummy arcs, indicated by grey lines, to indicate that one activity cannot begin before others are completed. The milestones correspond to the nodes labelled `M’.

27. We next construct the AON network. This time we’ll use square nodes, and provide them with labels ready for a CPM analysis.

28. We can now begin the CPM analysis. We start going through the diagram, filling in the earliest start times. We define the earliest we can start as time 0, so this goes into the first row of boxes. Then we add the duration times to get the earliest each activity can finish. When we get to the second row of boxes, we apply the rule that the earliest an activity can start is the latest that any of the activities it depends upon can finish. All of the boxes in the second row depend on all of the boxes in the first row, so the earliest any of them can start is 6 weeks into the project.

29. We carry on in this way till we get to the bottom of the diagram, where we find that the earliest we can finish the project is in 76 weeks, the same answer as we got from the Gantt diagram. Then we start working our way back up the diagram, this time using the rule that the latest any activity can finish is the latest that any of the activities that depend on it can start. This gives us the `LF’ entry, and the `LS’ entry is the value of the LF entry minus the activity duration. When we’re done, the diagram should look like this, where we’ve marked the critical activities in yellow and the critical path in red:

31. 4. You discover that a rival company is planning to put out a product that will compete with the Mark II. Every week that you can shorten your time to market is worth $1 000 000 in increased sales. You know that each of the relevant activities can be shortened by a certain percentage, with per-week costs as follows: What is your most profitable strategy?

32. Production Tooling: 16 weeks ES: 42 EF: 58 LS: 54 LF: 70 End EF: 76 LF: 76 Package Software: 4 weeks ES: 72 EF: 76 LS: 72 LF: 76 Production Software: 12 weeks ES:60 EF:72 LS: 60 LF:72 Package Hardware: 6 weeks ES: 58 EF:64 LS: 70 LF: 76 Production Hardware: 16 weeks ES:42 EF: 58 LS: 44 LF: 60 Step 1: Crash Software Packaging 2 weeks Prototype Software: 18 weeks ES:42 EF:60 LS: 42 LF: 30 Develop apps: 20 weeks ES:42 EF:62 LS: 56 LF: 76

33. Production Tooling: 16 weeks ES: 42 EF: 58 LS: 54 LF: 70 End EF: 74 LF: 74 Package Software: 2 weeks ES: 72 EF: 74 LS: 72 LF: 74 Production Software: 12 weeks ES:60 EF:72 LS: 60 LF:72 Package Hardware: 6 weeks ES: 58 EF:64 LS: 68 LF: 74 Production Hardware: 16 weeks ES:42 EF: 58 LS: 44 LF: 60 Prototype Software: 18 weeks ES:42 EF:60 LS: 42 LF: 60 Develop apps: 20 weeks ES:42 EF: 62 LS: 54 LF: 74 Critical Path has not changed, but it’s shorter

34. Market Research: 6 weeks ES: 0 EF:6 LS: 0 LF: 6 Start Technical Research: 5 weeks ES: 0 EF:5 LS: 1 LF: 6 Raise Capital: 4 weeks ES: 0 EF:4 LS: 2 LF: 6 Pre-prototype Hardware: 12 weeks ES:6 EF:18 LS: 6 LF: 18 Software on emulated machine: 10 weeks ES:6 EF:16 LS: 20 LF: 30 Step 2: crash market research 1 week

35. Market Research: 6 weeks ES: 0 EF:5 LS: 0 LF: 5 Start Technical Research: 5 weeks ES: 0 EF:5 LS: 0 LF: 5 Raise Capital: 4 weeks ES: 0 EF:4 LS: 1 LF: 5 Pre-prototype Hardware: 12 weeks ES:5 EF:17 LS: 5 LF: 17 Software on emulated machine: 10 weeks ES:5 EF:16 LS: 19 LF: 29 Critical Path has changed