project management -critical path analysis...
TRANSCRIPT
![Page 1: Project Management -Critical Path Analysis 05-Mar-14mrprebble.weebly.com/uploads/2/2/7/5/22752498/cpa.pdf · Project Management -Critical Path Analysis 05-Mar-14 3 When there are](https://reader034.vdocuments.site/reader034/viewer/2022050200/5f544436be5a0b56e05c7595/html5/thumbnails/1.jpg)
Project Management - Critical Path Analysis 05-Mar-14
1
![Page 2: Project Management -Critical Path Analysis 05-Mar-14mrprebble.weebly.com/uploads/2/2/7/5/22752498/cpa.pdf · Project Management -Critical Path Analysis 05-Mar-14 3 When there are](https://reader034.vdocuments.site/reader034/viewer/2022050200/5f544436be5a0b56e05c7595/html5/thumbnails/2.jpg)
Project Management - Critical Path Analysis 05-Mar-14
2
![Page 3: Project Management -Critical Path Analysis 05-Mar-14mrprebble.weebly.com/uploads/2/2/7/5/22752498/cpa.pdf · Project Management -Critical Path Analysis 05-Mar-14 3 When there are](https://reader034.vdocuments.site/reader034/viewer/2022050200/5f544436be5a0b56e05c7595/html5/thumbnails/3.jpg)
Project Management - Critical Path Analysis 05-Mar-14
3
When there are two or more activities ending at the same
node (working backwards), always take the activity with
the LOWEST of the values.
![Page 4: Project Management -Critical Path Analysis 05-Mar-14mrprebble.weebly.com/uploads/2/2/7/5/22752498/cpa.pdf · Project Management -Critical Path Analysis 05-Mar-14 3 When there are](https://reader034.vdocuments.site/reader034/viewer/2022050200/5f544436be5a0b56e05c7595/html5/thumbnails/4.jpg)
Project Management - Critical Path Analysis 05-Mar-14
4
![Page 5: Project Management -Critical Path Analysis 05-Mar-14mrprebble.weebly.com/uploads/2/2/7/5/22752498/cpa.pdf · Project Management -Critical Path Analysis 05-Mar-14 3 When there are](https://reader034.vdocuments.site/reader034/viewer/2022050200/5f544436be5a0b56e05c7595/html5/thumbnails/5.jpg)
Project Management - Critical Path Analysis 05-Mar-14
5
� All diagrams start with
� Project name on top, duration below
� EST’s first, left to right = previous EST + next activity duration.
� LFT’s, right to left = previous LFT – duration. The first and last nodes’ EST and LFT are equal.
� If more than one activity leads to a node (left or right), the EST of that node will be the highest option, the LFT will be the lowest.
� The critical path follows the nodes that have identical ESTs and LFTs.