ABSTRACT
Networks of some sort exist in a wide range of contexts. Network representations are very useful for the portrayal of relationships and connections between system components. This chapter begins with an introduction to network analysis, which shows how the critical path method and program evaluation and review technique can be used to plan, control, and monitor a wide range of projects. We have demonstrated how we can provide resources for managing unpredictable or uncertain periods of operation and how to use this knowledge to include a probability estimate of the chances that the project will be completed within a given time frame. Crashing has been introduced as a procedure to reduce activity times to meet project completion deadlines. Next, an effective approach is proposed for the formulation of a broad variety of network modelling problems. Specifically, the shortest path problems, maximum flow problems, minimal spanning tree problems, the travelling salesman problem, and the Chinese postman problem are considered. Various formulations for the problems are provided along with their solutions. All learning outcomes, solved examples, questions, and practice problems are mapped with Bloom’s Taxonomy levels (BT level) 1 to 6.
