= ( E + t or E + t ) L = L – t or L - t = + = = – = (take E + t or E + t (take L – t or L – t whichever is maximum) whichever is minimum) Here the critical path is - - - , which is denoted by double lines. Activity Duration ( t ij ) EST EFT=EST+ t ij LST=LFT– t ij LFT – – – – – – Table . The longest duration to complete this project is days. The path connected by the critical activities is the critical path (the longest path).
Critical path is - - - and project completion time is days. Example . Calculate the earliest start time, earliest finish time, latest start time and latest finish time of each activity of the project given below and determine the Critical path of the project and duration to complete the project. Activity - - - - - - - - - - Duration ( in week) Fig .
E = L = E = L = E = L = E = L = E = L = E = L = Activity Duration (in week) EST EFT LST LFT - - - - - - - - - - Table . - - Operations Research Here the critical path is – – – The project completion time is weeks Exercise . . Draw the network for the project whose activities with their relationships are given below: Activities A,D,E can start simultaneously; B,C>A; G,F>D,C; H>E,F.
. Draw the event oriented network for the following data: Events Immediate Predecessors – , , , . Construct the network for the projects consisting of