$\backslash$table$[[$Activity$,\backslash$table$[[$Predecessor$],[$Activity$]],\backslash$table$[[$Normal$],[$Time$],[($Weeks$)]],\backslash$table$[[$Crash$],[$Time$],[($Weeks$)]],\backslash$table$[[$Normal$],[$Cost$],[($Rs$.)]],\backslash$table$[[$Crash$],[$Cost$],[($Rs$.)]]],[$A$,-,4,3,8,000,9,000],[$B$,$A$,5,3,16,000,20,000],[$C$,$A$,4,3,12,000,13,000],[$D$,$B$,6,5,34,000,35,000],[$E$,$C$,6,4,42,000,44,000],[$F$,$D$,5,4,16,000,16,500],[$G$,$E$,7,4,66,000,72,000],[$H$,$G$,4,3,2,000,5,000]]$

Project crashing to solve Time$-$Cost Trade$-$Off with fixed indirect cost

Problem: The following table gives data on normal time and cost and crash time and cost for a project. Indirect cost is Rs $60$ per day.

A$)$ Draw the network for the project

B$)$ Find critical path

C$)$ Crash the relevant activities symmetrically and determine the optimum project time and cost

$\backslash$table$[[$Activity$,\backslash$table$[[$Normal$],[$Time$],[($Days$)]],\backslash$table$[[$Crash$],[$Time$],[($Days$)]],\backslash$table$[[$Normal$],[$Cost$],[($Rs$)]],\backslash$table$[[$Crash$],[$Cost$],[($Rs$)]]],[1-2,9,6,640,700],[1-3,8,5,500,575],[1-4,15,10,400,550],[2-4,5,3,100,120],[3-4,10,6,200,260],[4-5,2,1,100,140]]$

Find the ideal number of iterations based on the total cost of the project $($Normal Cost vs$.$ Crashed Cost$)$