Network Diagram with Finish-to-finish Dependency

Harwinder

In Finish-to-finish (FF) dependency, the completion of the successor activity depends upon the completion of the predecessor activity. In simple terms, two activities can run concurrently, but one cannot finish before the other finishes.

Refer to the following blog post for detailed explanation:

https://www.deepfriedbrainproject.com/2010/01/critical-path-finish-to-finish-network.html

The attached PDF files provide the question and solution to the problem described in the blog post. Feel free to download the PDFs for your personal educational use.

Question:

https://www.deepfriedbrainproject.com/assets/files/CPM_Network_Diagram_Finish_to_Finish_Relationship_Question_v3.pdf

Solution:

https://www.deepfriedbrainproject.com/assets/files/CPM_Network_Diagram_Finish_to_Finish_Relationship_Solution_v3.pdf