1. IE 366 Chapter 6, Section 10 Project Planning and Scheduling

2. IE 366 Gantt Charts: Cesarean Section Facilitator Project

3. IE 366 Critical Path Method (CPM) ● Define – Activities/Tasks – Activity precedence relationships – Activity times ● Construct network (graph) – Node = beginning of activity – Arc (line) = activity – Number on arc = duration of activity ● Make forward pass – Find earliest possible start times – Maximum of incoming paths ● Make backward pass – Find latest necessary start times to finish on schedule – Minimum of outgoing paths ● Calculate slack times – Latest – earliest ● Critical path is path with zero slack

4. IE 366 CPM Steps ● Define – Activities/Tasks – Activity precedence relationships – Activity times ● Construct network (graph) – Node = beginning of activity – Arc (line) = activity – Number on arc = duration of activity ● Make forward pass – Find earliest possible start times – Maximum of incoming paths ● Make backward pass – Find latest necessary start times to finish on schedule – Minimum of outgoing paths ● Calculate slack times – Latest – earliest ● Critical path is path with zero slack

5. IE 366 CPM Example: Preparing a Meal 7Begin meal8 584,6Serve meal7 1075Assemble spaghetti6 3062Prepare spaghetti ingredients5 573Assemble salad4 1042Prepare salad ingredients3 53,51Instruct helper on salad preparation2 152 Set up kitchen1 MinutesPrecedesFollowsActivityNumber

6. IE 366 CPM Steps ● Define – Activities/Tasks – Activity precedence relationships – Activity times ● Construct network (graph) – Node = beginning of activity – Arc (line) = activity – Number on arc = duration of activity ● Make forward pass – Find earliest possible start times – Maximum of incoming paths ● Make backward pass – Find latest necessary start times to finish on schedule – Minimum of outgoing paths ● Calculate slack times – Latest – earliest ● Critical path is path with zero slack

7. IE 366 CPM Example: Construct Network 1

8. IE 366 CPM Example: Construct Network 12

9. IE 366 CPM Example: Construct Network 123

10. IE 366 CPM Example: Construct Network 1234

11. IE 366 CPM Example: Construct Network 123 5 4

12. IE 366 CPM Example: Construct Network 123 5 4 6

13. IE 366 CPM Example: Construct Network 123 5 4 6 7

14. IE 366 CPM Example: Construct Network 123 5 4 6 78

15. IE 366 CPM Example: Construct Network (neatly) 12 3 5 4 6 78

16. IE 366 CPM Example: Construct Network 12 3 5 4 6 78 15 5 5 30 10 5 5

17. IE 366 CPM Steps ● Define – Activities/Tasks – Activity precedence relationships – Activity times ● Construct network (graph) – Node = beginning of activity – Arc (line) = activity – Number on arc = duration of activity ● Make forward pass – Find earliest possible start times – Maximum of incoming paths ● Make backward pass – Find latest necessary start times to finish on schedule – Minimum of outgoing paths ● Calculate slack times – Latest – earliest ● Critical path is path with zero slack

18. IE 366 CPM Example: Forward Pass 12 3 5 4 6 78 0 15 5 5 30 10 5 5

19. IE 366 CPM Example: Forward Pass 12 3 5 4 6 78 0 15 5 5 30 10 5 5

20. IE 366 CPM Example: Forward Pass 12 3 5 4 6 78 0 15 5 5 20 30 10 5 5 35 30

21. IE 366 CPM Example: Forward Pass 12 3 5 4 6 78 0 15 5 5 20 50 30 10 5 5 35/60 30

22. IE 366 CPM Example: Forward Pass 12 3 5 4 6 78 0 15 5 5 20 50 30 10 5 5 35/6065 30

23. IE 366 CPM Steps ● Define – Activities/Tasks – Activity precedence relationships – Activity times ● Construct network (graph) – Node = beginning of activity – Arc (line) = activity – Number on arc = duration of activity ● Make forward pass – Find earliest possible start times – Maximum of incoming paths ● Make backward pass – Find latest necessary start times to finish on schedule – Minimum of outgoing paths ● Calculate slack times – Latest – earliest ● Critical path is path with zero slack

24. IE 366 CPM Example: Backward Pass 12 3 5 4 6 78 0 15 5 5 20 50 30 10 5 5 35/6065 30

25. IE 366 CPM Example: Backward Pass 12 3 5 4 6 78 0 15 5 5 20 50 30 10 5 5 35/60 60 65 30

26. IE 366 CPM Example: Backward Pass 12 3 5 4 6 78 0 15 40 5 5 20 45 2050 30 10 5 5 35/60 60 65 30 55

27. IE 366 CPM Example: Backward Pass 12 3 5 4 6 78 0 15 40/15 5 5 20 45 20 50 30 10 5 5 35/60 60 65 30 55

28. IE 366 CPM Example: Backward Pass 12 3 5 4 6 78 0 0 15 40/15 5 5 20 45 20 50 30 10 5 5 35/60 60 65 30 55

29. IE 366 CPM Steps ● Define – Activities/Tasks – Activity precedence relationships – Activity times ● Construct network (graph) – Node = beginning of activity – Arc (line) = activity – Number on arc = duration of activity ● Make forward pass – Find earliest possible start times – Maximum of incoming paths ● Make backward pass – Find latest necessary start times to finish on schedule – Minimum of outgoing paths ● Calculate slack times – Latest – earliest ● Critical path is path with zero slack

30. IE 366 CPM Example: Critical Path 12 3 5 4 6 78 0 0 15 40/15 5 5 20 45 20 50 30 10 5 5 35/60 60 65 30 55

31. IE 366 Project Evaluation and Review Technique (“Enhanced PERT”)