1. Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs

2. 24.3 Critical Path Problems 0 Developing and manufacturing products frequently involves many interconnected activities. 0 Some activities cannot be started until other activities have been completed. 0 Weighted digraphs can be used and are often created using a table.

3. Important facts about critical paths 0 The weight of the critical path is the minimal length of time required to complete the project. 0 Increasing the time required for any critical activity will also increase the time necessary to complete the project. 0 A critical activity is any task, that if delayed, will also delay the entire project.

4. Drawing Weighted Diagrams When drawing weighted diagrams for critical path problems, the following conventions apply: 0 The edges (arcs) represent the activities 0 The vertices (nodes) represent events 0 The ‘start vertices’ have no immediate predecessors (activities that must take place before them) 0 A vertex (finishing node) representing the completion of the project, must be included in the network

5. 0 No multiple edges (an activity can only be represented by one edge) 0 2 vertices can be connected by, at most, one edge. In order to satisfy the last two conventions, it is sometimes necessary to include a dummy activity that takes zero time. Insert diagram

6. Earliest Starting Time (EST) 0 The earliest time an activity can be commenced. 0 The EST for activities without predecessors is zero. Insert diagram (page 653)

7. Latest Starting Time (LST) 0 The time an activity can be left if the whole project is to be completed on time. 0 LSTs are found by working backwards through the network. Insert diagram (page 653)

8. Float 0 The float or slack of a non-critical activity is the amount by which the latest starting time is greater than its earliest starting time. Float time = latest starting time – earliest starting time 0 The existence of a float means that an activity can start later than its earliest start time, or the duration of the activity can be increased.

9. 0 For critical activities, the float time is zero. 0 For non-critical activities this is the difference between the LST & EST. Insert diagram Critical Path = B – D – E – F Float times: Activity A = 3-0 = 3 Activity B = 9-9 = 0 Activity C = 18-9 = 9 Activity D = 9-9 = 0 etc…

10. Project Crashing 0 Project Crashing is the process of shortening the length of time in which a project can be completed by completing some activities more quickly. 0 This can usually only be done by increasing the cost of the project. Insert diagram