Please boost your Plan to download papers
Finance and Accounting Essay: Business Enivronemnts
Finance & Accounting
Pages 10 (2510 words)
Business and Law Task 1: 1) Network Diagram - Activity on node. Note the introduction of a dummy activity R with duration of zero to represent the end of the project. 2) Determination of Timing of Activities and Total Float: “Let Ei represent the earliest start time for activity i such that all its preceding activities have been finished…
EA = 0 (assuming we start at time zero) EB = EA + TA = 0 + 4 = 4 EC = EA + TA = 0 + 4 = 4 ED = EA + TA = 0 + 4 = 4 EE = EA + TA = 0 + 4 = 4 EF = EA + TA = 0 + 4 = 4 EG = max [EB + TB, EC + TC, ED + TD, EE + TE, EF + TF] = max [9,8,12,10,13] = 13 EH = EG + TG =26 EI = EH+ TH =34 EJ = EH+ TH =34 EK= max [EI + TI, EJ+ TJ] = max [41,40] =41 EL= EK+ TK =49 EM= EL+ TL =62 EN= EM+ TM =71 EO= EN+ TN =75 EP= EO+ TO =79 EQ= EP+ TP =88 ER= EQ+ TQ =93 Hence, the minimum possible completion time for the entire project is 93days, i.e. 93 days are the minimum time needed to complete all the activities. We now need to calculate the latest times for each activity. Let Li represent the latest start time; we can start activity i and still complete the project in the minimum overall completion time. (Beasley n.d.). We calculate the values of the Li (i=A,B,...,I) by going backward, from right to left, in the network diagram. ...
Not exactly what you need?