Ex. 12: For the following project: (1) Draw network diagram. (2) Find critical path and project completion time. (3) Identify critical and non-critical activities. Activity Preceding Activity | Time (days) A - 6 B A 5 c A 2 D B 4 E Cc 2 F D 1 G D&E 5 H F&G 3 Solution: (1) Network Diagram: Fig. 7.29 (2) Paths in the network: (3) (a) A-B-D-F-H: Duration = 19 days (b) A-B-D-X,-G-H: Duration = [23 days] () A-C-E-G-H: Duration = 18 days «Critical path =A-B-D-X,:-G-H Project completion time _= 23 days Critical activities: Activities A, B, D, X1,G and H Non critical activities: Activities C, E and F erPy \ | i etwork Analysis - 1 VU0 30s fx. 13: For the following project: () Draw network diagram. ( Find critical path and project completion time. ()_Identify critical and non-critical activities. Activity Preceding Activity’ Time (days) A - 4 B A 3 ) C A 5 D B 1 E B&C 2 | F D&E 2 G E 3 Solution: () Network Diagram: Fig. 7.30 Q) Paths in the network: (@) A-B-D-F: Duration = 10 days (2) A-B-X;-E-X2-F: Duration = 11 days (3) A-B-X;-E-G: Duration = 12 days (4) A-C-E-X2-F: Duration = 13 days () A-C-E-G: Duration = [14 days| ~.Critical path =A-C-E-G Project completion time = 14 days (3) Critical activities : Activities A.C, E, and G Non critical activities : Activities B,D, F, X; and X2 Ex. 14: For the following project: (1) Draw network diagram. Q) Find critical path and project completion time. () Identify critical and non-critical activities.iv Vipul’s Operations Research (BMS) (NK) a 306 Activity Time (days) 1-2 4 1-3 5 2-4 3 3-5 2 4-6 2 5-6 4 Solution: In this example, the activities are given in the form of ‘Node relationship’. (2) Network Diagram: (2) Paths in the network: Fig. 7.31 (a) 1-2-4-6: Duration =9 days (b) 1-3-5-6: Duration = 11 days Critical path =1-3-5-6 Project completion time = 11 days (3) Critical activities: Non critical activities: (1) Draw network diagram. (2) Find critical path and project completion time. _ Activities 1-3,3-5,5-6 Activities 1-2, 2-4,4-6. Ex. 15: For the following project: (3) Identify critical and non-critical activities. Activity Time (days) 1-2 3 1-3 1 2-3 zero 2-4 2 2-5 5 3-5 7 4-6 4 5-6 3 if ye| network Analysis - | u a a Solution: Node relationship is given Activity 2-3 takes zero days, it means it is a dummy activity () Network Diagram: _ Q) Paths in the network: | (a) 1-2-4-6: Duration =9 days | (b) 1-2-3-5-6: Duration = 13 days () 1-2-5-6: Duration =11 days (a) 1-3-5-6: Duration =11 days Critical path Project completion tim (3). Critical activities: Activities 1-2,2-3,3-5,5-6 Non critical activities: Activities 1—3,2-4,2-5,4-6. 3077.10 SOLVED PROBLEMS: eee Ex. 17: For the following project: (1) Draw network diagram. (2) Find critical path and project completion time. (3) Find earliest and latest starting and finishing times of all activities. (4) Find floats and slacks for all activities. Preceding Activity Time (days)316 ua Vipul’s Operations Research (BMS) (Nk) Solution: (1) Network Diagram: @ (2) Paths in the network: () A-B-E-G: Duration = 14 days (2) A-B-D-F-H: Duration = [22 days] — (3) A-C-F-H: Duration = 12 days <.Critical path =A-B-D-F-H Project completion time = 22 days (3) Time estimates: Note: When we do forward pass and backward pass, ForEs : Activity 10+6=16 Activity C+ 4+2=6 ° 16 Forl; : ActivityE>21-3=18 Activity D> 16-6 = 10 cL3= 10 ForL2 : ActivityB>10-6=4 Activity C > 16-2 = 14 va=4 Table 7.6 Earliest and Latest Starting and Finishing Times Activity | EST=E& | EFT= st +u | LST=LFT-ty | LFT=1j A E=0 4-420 la=4 B Ep=4 Ly= 10 iG Ep=4 Ly=16 D E3=10 Ly= 16 E E3=10 Ls=21 Ee a> =B\ \ eTVi gietinanse's [cE G H Activity Head Slack = L;- E A 4-4=0 B 10-10=0 i 16-16=0 D 16-16=0 E 21-13=8 F 20-20=0 c 2-22=0 H 2-2=0 Table 7.8: Floats Activit | “Total Float = | Free Float= | Independent | Interfering y LST-EST | TF-Head | Float=FF- | Float=Head Slack Tail Slack Slack A o- 0 B - 4 0 ¢€ G -4=10 0 D 10-10=0 0 E 18-10=8 8 F 16-16=0 0 G 21-13=8 0 H 20-20=0 9 Ex. 18: A small assembly plant assembles PC’s through 9 interlinked activities. The time duration for which is given below: Activity T72]13] 14] 25] 36| 37 | 46 | 58] 6973] 89 Duration(hrs) | 2 1211141815 [3][1/5 [413 (1) Draw a network diagram for it. ) Calculate and tabulate for each activity: Earliest Start (ES), Earliest Finish (EF), Latest Start-(LS) and Latest Finish (LF) times. (3) Find the critical and sub critical paths. (® Calculate and tabulate Total Float, Free Float, Interfering Float and Independent Float. (MU, Oct. 2003)318 a Solution: Vipul’s Operations Research (BMS) (Nk) (1) ‘Network Diagram: (2) Paths in the network: (a) 1-2-5-8-9 : Duration = 10 hrs (b) 1-3-7-8-9 : Duration = 14 hrs -3-6-9 — : Duration =|15 hrs| @ 1 qd) 1 ~4-6-9 : Duration = 09 hrs Critical path =1-3-6-9 (15 hrs) Project completion time = 15 hrs Sub critical path =1-3-7-8-9 (14 hrs) Table 7.9: Earliest and Latest Starting and Finishing Times Activity ij | EST=E, | EFT=EST+t; | LST=LFT-t) | LFT=l 1-2 Ei=0 0+2=2 ; La=7 1-3 Ei=0 O+2=2 Ls=2 1-4 E,=0 O+1=1 Li=7 2-5 Ep=2 24+4=6 Ls=11 3-6 E3=2 2+8=10 10 3-7 E3=2 24527 8 4-6 E=1 1+3=4 10 5-8 Es=6 6+1=7 6-9 Es=10 10+5=15 7-8 Ey=7 7+4=11 8-9 Es=11 11+3=14 Table 7.10: Slacks Activity Head Slack = L;- Fj 1-2 7-2=5 1-3 2-2=0 1-4 7-1=6 ENT rs RZvv \ lysis - network Analysis -1 GUO as Table 7.11: Floats. Activity Total Float =| Free Float =| Independent Interfering LST-EST | TF-Head |Float=FF-Tail| Float = Head Slack 1-2 5 1-3 0 1-4 6 2-5 5 3-6 0 3-7 1 4-6 0 5-8 1 6-9 0 7-8 1 8-9 | 12-11=1 o Note: In this problem, students need not calculate slacks as it is not asked in the question. They can also calculate floats using formulae given in Table 7,4 (Example 11). Ex, 19: ea Following are the details of estimated times of activities for a certain Project. ‘Activity A[B|c| DIE F] Immediate Predecessor/Activity -[Aal[alpc[-[e Estimated Time (Weeks) 2:[3jiah 6 [2]8 (1) Find the critical path and expected time of the project. 2) Calculate the earliest start time and earliest finish time for each activity. Ms : : (3) Calculate the slack for each activity. (Mu, April 2004)- 200M Vipul’s Operations Research (BMS) (Nk) Solution: @)_ Network Diagram f é 4 i 1 0 if § f it i! (2) Paths in the network: (a) A-B-X;:-D : Duration = 11 weeks (b) A-C-D : Duration = 12 weeks () E-F : Duration = 10 weeks Project completion time Table 7.12: Earliest Starting and Finishing Times b Activity ij | EST=5 A Ei=0 B Ep=2 @ E; D E F X Ey=5 Table 7.13: Slacks Activity Tail Slack=L;-E; | Head Slack = Lj- 5 A 0-0=0 2-2=0 B 6-5=1 iG 6-6=0 D 12-12=0 E 4-2=2r | yawork Analysis - 1 F 4-2 | Xx AA 6-5= Ex. 20: Activities involved in a small project are given below along with relevant information. Activity 12 [13 [23 | 24 | 34 [45 DurationInDays | 20 | 25 | 10 | 12 | 6 | 10 () Construct the network and find critical path. (2) Find and tabulate Earliest Start Time, Earliest Finish Time, Latest Start Time, Latest Finish Time and Total Float. Verify the critical path found earlier. (M.U,, April, 2009) Solution: () Network Diagram 321 a aw 10 Fig. 7.39 @) Paths in the network: (a) 1-2-4-5 — : Duration = 42 days (6) 1-2-3-4-5 : Duration = [46 days] (9 1-3-4-5 _: Duration = 41 days =1-2-3-4-5 -. Critical path Project completion time = 46 days Table 7.14: Earliest and Latest Starting and Finishing Times Activity ij EFT =EST+t | LST=LFT-ty | LFT=Lj 12 0+20=20 20-20=0 12=20 1-3 04+25=25 13=30 2-3 20+10=30 La=30 2-4 20+12=32 Li=36 3-4 30 +6 =36 Ly =36 4-5 36 +10 = 46 Ledsf \ Vipul’s Operations Research (BMS) (NK) fi 322 Q SR < Table 7.15 Total Float = LST - EST From the total float calculation, we can see that activities 1-3 and fe 2-4 have 5 days and 4 days of float available respectively. Hence, these _¢ are non-critical activities. All other activities ie. 1-2,2-3,3-4and 4-5 have zero float. It means these are critical activities. Thus, the critical path 1 - 2-3-4 -5 found earlier is verified.