networks4

 PERT for Project Planning and Scheduling

The example below steps through the construction of a PERT network, and then the PERT process. The goal is to determine when to schedule the activities so that the minimum number of days is used to complete the project. An important part of the solution is finding out which activities are on the critical path: any delay in these activities delays the completion of the entire project. 

We use the Activity-on-Arc version of PERT.

The example uses the data in the table below:



Popular posts from this blog

Contents

Chapter 1: Introduction.  An introduction to the process of optimization and an overview of the major topics covered in the course.  Last revision: December 2020 . Chapter 2: Introduction to Linear Programming.  The basic notions of linear programming and the simplex method. The simplex method is the easiest way to provide a beginner with a solid understanding of linear programming.  Last revision: December 2020. See animation  LP1 . A good  article on formulating LPs  by Gerry Brown and Rob Dell. Example questions with solutions . March 4, 2021. Chapter 3: Towards the Simplex Method for Efficient Solution of Linear Programs.  Cornerpoints and bases. Moving to improved solutions.  Last revision: December 2020 . See animation  LP2 . Chapter 4: The Mechanics of the Simplex Method.  The tableau representation as a way of illustrating the process of the simplex method. Special cases such as degeneracy and unboundedness.  Last revision: December 2020. See animation  LP3 . Example questions
Read more