1. OM480 Defining the Project Parameters – Scheduling 101 (With Material from the Text Authors)

2. Overview Scheduling Precedence Relationships PERT/CPM Critical Chain Activity Networks

3. Scheduling Project = Problem scheduled for solution Requires: –Planning –Organizing –Coordinating –Directing –Controlling gninnalP drawkcaB Forward Execution

4. Project Management Trade-Offs Performance Quality CostTime

5. © Project Priority Matrix Constrain Enhance Accept TimePerformanceCost

6. WBS/Work Packages to Network Circuit board Design cost account Production cost account Test cost account Software cost account Lowest element OrganizatioUnitsOrganizatioUnits Design WP D-1-1 Specifications WP D-1-2 Documentation Production WP P-10-1 Proto 1 WP P-10-2 Final Proto 2 Test systems WP T-13-1 Test Software WP S-22-1 Software preliminary WP S-22-1 Software final version B Proto 1 5 D Final proto 2 4 A Specifications and documentation 2 C Preliminary software 3 F Final software 2 K Test 3 A D-1-1 D-1-2 B P-10-1 D P-10-2 F S-22-2 K T-13-1 C S-22-1

7. Duration and Activities Effort is not duration –Time spent in actual “work” Duration lasts longer –Elapsed time from activity start to finish –Imagine “NFL two-minute warning” See Page 183-184 for techniques Realities of Duration Planning –Deliveries –Breakdowns/Repairs –Approvals

8. PERT –Program Evaluation and Review Technique –US Navy “Polaris Missile” Program – 1950s –Statistical manipulation of 3 duration estimates Most Optimistic Most Likely Most Pessimistic –Probability-based P(MO) + P(ML) + P(MP) = Duration –More reflective of “realities”

9. CPM –Critical Path Method –DuPont and Remington Engineers – 1950s New Product/Process Roll-out –Less sophisticated than PERT –Relies on one duration estimate –Same duration techniques as PERT

10. Hypothetical Network 2561 4 3

11. Activity and Project Frequency Distributions ACTIVITYPROJECT a m b TE (A)(B)

12. PERT Activity Calculation T(e) = a + 4m + ba = Most Optimistic (MO) 6m = Most Likely (ML) b = Most Pessimistic (MP) T(e) = Activity Duration When Probabilities are “Unknown” or too lazy/scared To calculate!!!

13. Possible Project Durations T E =64 T S =67

14. PERT Schedule Probability Z is derived from a table of predetermined probabilities Z = T(S) – T(E)Z = Probability of SD(T[E]) 2 Meeting Schedule T(S) = Scheduled Duration T(E) = Critical Path Duration

15. PERT Simulation Activity Times and Variances Activity ambt(e) 1-2172947 2-361224 2-4161928 3-5131619 4-52514 5-6258

16. Activity ambt(e) [(b-a)/6]2 Var 1-2172947 2-361224 2-4161928 3-5131619 4-52514 5-6258

17. Hypothetical Network 2561 4 3 5 16 620 13 30 T E =62 Calculate t(e) and Z for this network……

18. Z Table Z ValueProbabilityZ ValueProbability -2.00.02+2.00.98 -1.50.07+1.50.93 0.16+1.00.84 -0.70.24+0.70.76 -0.50.31+0.50.69 -0.30.38+0.30.62 -0.10.36+0.10.54

19. Activity Networks Flowchart-based representation of activities –Sequenced –Precedence Consecutiveness Concurrency Activity on Node –Action is in the “box” Activity on Arrow –Activity is on the “line”

20. Critical Chain Based on “Theory of Constraints” –Eliyahu Goldratt “The Goal”

21. Rollup of Network Plans WP-2 A B C D E F WP-1 WP-4 WP-3 Level 1 - Milestone Plan Level 2 - Plans Level 3 - Plans

22. Air Control Inc., Custom Order Project—Gantt Chart 07142128354249 2 13 15 10 18 15 10 5 Order review Design custom parts Order standard parts Produce standard parts Software development Manufacture custom hardware Assemble Test

23. Software Conversion Project Responsibility Matrix Activities Organization Unit/Individual Legend R = Responsibility C = Contributes A = Advises

24. Air Control Inc., Custom Order Project—Network Diagram 1 Order review 2 0 2 0 2 2 3 4 5 Software development Order standard parts Produce standard parts Design custom parts 18 2 20 22 40 15 2 17 15 30 10 2 12 5 15 13 2 12 5 15 6 78 Manufacture custom hardware Assemble Test Activity 8 # Legend 15 15 30 15 30 10 30 40 30 40 5 40 45 40 45 Duration ES EF LS LF

25. © Air Control Inc., Custom Order Project—Network with Dates 1 Order review 2 1-Jan 2-Jan 1-Jan 2-Jan 2 3 4 5 Software development Order standard parts Produce standard parts Design custom parts 18 2-Jan 20-Jan 22-Jan 9-Jan 15 2-Jan 17-Jan 15-Jan 30-Jan 10 2-Jan 12-Jan 5-Jan 15-Jan 13 2-Jan 15-Jan 2-Jan 15-Jan 6 78 Manufacture custom hardware Assemble Test Activity 8 # Legend 15 15-Jan 30-Jan 15-Jan 30-Jan 10 30-Jan 9-Jan 30-Jan 9-Jan 5 9-Jan 14-Jan 9-Jan 14-Jan Duration ES date EF date LS date LF date

26. AOA Network Building Blocks 8079 Install software EventActivity

27. Partial Koll Business Center AOA Network 4 5 132 A Application approval D Service availability check C Traffic study B Construction plans

28. Partial AOA Network Koll Network 2 3 14 A X C B E (A) 2 3 14 A B C X E (B) 2 3 1 4 A B X C E (C)

29. Partial AOA Network Koll Network 2 3 1 4 A B C X E (D) 5 D 2 3 1 4 A B C X E (E) 5 D F ?

30. Activity-on-Arrow Network KOLL BUSINESS CENTER County Engineers Design Department 2 3 1 4 A5A5 B C 10 X 5 15 0 678 0 Y F 10 G 170 H 35 E 15 D5D5 Activity Duration Legend

31. Activity-on-Arrow Network Forward Pass KOLL BUSINESS CENTER County Engineers Design Department 2 3 1 4 A5A5 B C 10 X 5 15 0 678 0 Y F 10 G 170 H 35 E 15 D5D5 Legend 5 15 20 10 30 200 35 235 EF

32. Activity-on-Arrow Network Backward Pass KOLL BUSINESS CENTER County Engineers Design Department 2 3 1 4 A5A5 B C 10 X 5 15 0 678 0 Y F 10 G 170 H 35 E 15 D5D5 Legend 5 15 20 30200 235 LS EF 0 10 185 20

33. Activity-on-Arrow Network Backward Pass, Forward Pass, and Slack KOLL BUSINESS CENTER County Engineers Design Department 2 3 1 4 A5A5 B C 10 X 5 15 0 678 0 Y F 10 G 170 H 35 E 15 D5D5 Legend 5 15 20 30200 235 LS EF 0 10 185 20 5 15 20 10 30 200 35

34. Air Control Inc., Custom Order Project— AOA Network Diagram 2 3 1 4 Order review 2 0 2 0 2 567 Software development 18 020 2240 Order standard parts 15 217 1530 Produce standard parts 10 212 1515 Design custom parts 13 215 215 Manufacture Custom Hardware 15 1530 1530 Assemble 10 3040 3040 Test 5 4045 4045 Legend Dur. ES EF LS LF

35. Activity-on-Node Network Fundamentals X Y Z Y and Z are preceded by X Y and Z can begin at the same time, if you wish (B) ABC A is preceded by nothing B is preceded by A C is preceded by B (A) J K L M J, K, & L can all begin at the same time, if you wish (they need not occur simultaneously) All (J, K, L) must be completed before M can begin but XZ AA Y (C) (D) Z is preceded by X and Y AA is preceded by X and Y

36. Activity-on-Node Network Fundamentals KOLL BUSINESS CENTER County Engineers Design Department EF

37. Activity-on-Node Network Forward Pass EF KOLL BUSINESS CENTER County Engineers Design Department 20 15 20 15 10 200 35

38. Activity-on-Node Network Backward Pass LS KOLL BUSINESS CENTER County Engineers Design Department 20 185 10 15 5 20

39. Activity-on-Node Network with Slack LS EF KOLL BUSINESS CENTER County Engineers Design Department 20 15 185 10 15 5 20 10 20 15

40. Example of Laddering Using Finish-to-Start Relationship Trench 1/3 Lay pipe 1/3 Refill 1/3 AON network

41. Finish-to-Start Relationship XY Lag 2

42. Start-to-Start Relationship Activity M Activity N Activity P Activity Q Lag 5 A B

43. Use of Lags to Reduce Detail Trench 1 mile Lay pipe 1 mile Lag 3 Refill 1 mile Lag 3

44. Finish-to-Finish Relationship Lag 4 Prototype Testing

45. Start-to-Start Relationship Lag 3 System documentation Testing

46. Combination Relationships Lag 2 Code Debug Lag 4

47. Network Using Lags Legend Lag 5 Lag 10 Lag 5 Lag 10

48. Hammock Activity Example Legend