a Ul “constwCTION ENGNEEEING AND MANAGEMENT 56 sect) Resource wisation i optimised Se pega te otk actual plan sete ean be abn © ‘tual key delay, proper remedial es tveid euch delays ctivites at diffrent stages, 6 (oi Interreatonship of various Intersenna? fl be ale to Hx tem aecering © ‘helt pron. vin Tota duration ofthe complete Pr OMT oe CLASSIFICATION OF SCHEDULING 25. Suns an be cased ito alferen TT according t0 the Sean for wie it i done, 5 Poateial scheduling, ENT rchedubing, equipment * Scheduling and other Pe je, METHODS OF SCHEDULING 72, METHODS © ne by ferent methods depending °° the size Sehedprret. The methods wed aT = Bar charts or Gantt Charts Milestone Chasts {hip Network Analysis 76a. Bar Charts “These type of chats were introduced XY AD. A bar chart inate mesane representing {ie jor activities to the jeetped. Each bar represeat pletion of that job of sity. ‘The following 4. divide the project into ma 2st out the activities 3: find the inter relationship 4 azeange the activities J fealelate the quantity of fe. daawe it according 10 8 fig 7. shows a bar chat for activites viz; Av B, CD, Ee act ad sceessfl completion Ts & is Feo niin are 1, 61h 8°69 0 6 units time respectively tops are involved in preparing the Bar chat: ry activities song these stivities tematic 9 "work and the time required Je as shown in Fig. 7 oven dist cir aa ace simultaneous iy SCHEDULING, J08 LAYOUT AND LINE OF 1 | Pod or Actives os 0s ~—trine Wnt Day? Fig. 72. Bar Chart From the above bar chart, we conclude th Independent y ferent of ec oe since they are start only when activity B is completed completes i) Acti ity D is independent ‘Atty Ds independent of Ct tarts eater than € and is ‘Activity E starts a Ae, Fas carb Dates ‘etivty Gis the la aD. activity and is de spendent onthe completion fotal duration of the project is 28 days le 72. For the, constuction of + Fhe petformed which arene gives bein rs actos Activity Ne. [Duration Gi in weeks)——o=o™~rs=“‘OéFCOtwww”w”;~COCOCC © [CONSTRUCTION ENGINEERING AND MANAGEMENT EEE eee ee ot Activity 2 and 3 can be performed s fren activity 1 is completed. ot begin the total time taken for the completion of the project? Figure 72 Shows the bar chart of the projet mod pret Compan ie = 4 wes " chart shown in) Fig. 23. The ty oF J A vided i 4 fy events of mkstnes Job co tnlestoncs and so on. Each milestone can be considered 0 be specific event along the Job and is represented by 3 =quate a time in Weeks Fig. 72: Bar Chart for Ex. 7. om the bar chart we conclude that the total time taken for etion of the project is 14 weeks, mnt of Bar Charis the inferdependencies between the milestones is not cross of the work in the project cannot be monitoredll SCHEDULING, JO8 LAYOUT AND LINE OF BALANCE. a inc AND MANAGEMENT consrRUCTION ENGINEER start only silane a4 A ene can atte ale but the financial aspect involved is not known; ie; whether the project cost is within the estimated one or exceeded is) Barchatt cannot be used as a controlling device by the project ‘manager to take any timely action ven though the bar chart shaving several disadvantages, tl it ean be sorcesflly employed in he fae of small projects, where the numberof activites are lined, However when the projet tomer comples, itis very dic odo the scheduling using Ns sethod, Moreover, montring ofthe project becomes dficul 1162, Milestone Chars {The milestone chart is a modieation ovr the orignal bar chat. In very ach ere art cena key events which ae toe cared ofthe acy Such Key sven aalled besos and tby-ane represented ty a equate or cle, These ‘rene re hove which can be sully Mantfied over the main bar ‘presenting the activity. I hasbeen ootced that when a parce wily represented by «Bar is very long the detals wl be lacking ii however, the acy te broken ito & umber of sub-ectivites or ey event, each ne of which an be ecognized during the progress ‘the projec, controling can be done eel andl some iter ‘nat between the stviis exablihed Let us consider the clesione cht shown in Fig. 73. The sctvity or Job A is divided into hey evens or mlestones, JB into3 miletencr and so on Each eso canbe considered 1 be ‘tpecie event along the Job and is represented by a agua. ry only a 3 Fa ind this can. commer cy pe an ay ae te sete of 7 et for he proc Gy Pepe vs fm iy What is the total Sotuton. Figure 72 shows te Bs ro te completion of te proest 7 vr eat of the PIES complain tine = 14 weeks Projet Complei 46 O 0 De wiesone eso Oo st . 8 rime in Weeks “ oo a pe Chart for Be 72 wa ie a he new = coon othe pst 1 4 wee. Fig 73, Milestone Chest Foitatons of Bar Chae linions of milestone chart — er ioc mall POF we vi Oe jinterdependencies betwe Ai) eds sot sow the ais liniation of He effete Ph The in the project eannot be moni (ii) The progress of Seely ae OF ork cannot He baets ey ete en ei ai 8 ee tan aboot he psn Pe sgh controling canbe better achieved. with the help of he Mlvntone char, silt penseses the some deficiency as the bat Lethe interdependences between the muestones isnot work i : the in an sctvity, the relationship between two specific i ceesled by the lestone cae DOT IoNShpEES SS SSS CONSTRUCTION ENGINEERING AND MANAGEMENT a ee SCHEDULING: J08 LAYOUT AND UNE OF BALANCE sere ei ang mites os indifferent activ a . 163. Contal 1, se sentry complimentary to planning, Once the projet as Dest cea Eedaed and arte, the progress ofthe WORN Me planned, otefueonginal one, The proces of controling noes comparing the proaress soar eval and then taking crectve action to gt the ‘igrec, i is lagging bebind the schedule vreneoling needs updating information trough some system, Tee eran ts analysed and. the project plan i brought Upto The infgrine necessary changes requied to keep the project AF Pet schedule. 716A, Life Cycle Carves Ten US conmally vos after the overal ie schedule has Pe Ty a rete et chart technique. 1n oder to use the life ee decided BY tne ear pe of job the empirical relationship betveen coe ge progress are time has fo be exablabed By Sud © 10 Percents Doe aving identical sequence and constraints, Whe amb an constraints remain te same, the time durtion anges =| so m0 2 + Percentage progress a eee quay of work, Hence, the ime daraion aa depen nea common denominator, andthe average life cle 6 802M 182 Mt cre veelre developed for use in scheduling } rea 30 rample 72, Consider » project that sequires detailed engineers Time (in months) Perms hvoling 25000 man hours tobe completed n 22 monte ain for Pn ee fe cycle curve is dean as shown is Fig 4 The Be Description Feary Mogren: and man hours can be worked out 24 Shown % ‘Senedale in fe cycle curve in Fig. 74 In this curve ther as 0 Finaiisation of Fi Progress below by oti fasoumed that the man hour nequlrement i ie ipe Line Specification 7 ively proportional to progress Finalisation of Plot Plan -..=—rs—eOSSsSsaserseh 1B | Pept oft Meat Tae 3 rym < 10% 30% 4 5% 6% TOK AH HK 1H ‘Completion of piping study 2 ee a Preparation of 5 a cam sem eparation of 2nd matetial take off . Freezing 2 sro 02500 Stns - a — Taste of fist Io of lnometic || Fitalisation of Ge 2 jeneral Architectural Tae of let tt of isomewic ee | i = material take off | 100 Fig. 74. Life Cyele CurvenerRUCTION ENGINEERING AND MANAGEMENT i. 2 | beg yo ‘ i | # comet ander Vb ems SCHEDULING, JOB LAYOUT AND LINE OF BALANCE 7.8. WORK BREAKDOWN STRUCTURE In any construction projec, the various activ project have to be clearly identified. The process off Drolet into easy ientiable iscete activities Is called ¢ (vide Fg 7 Subsystems, then thet Sub Sytem] [Sib Sytem [Emmpone ing the network for the project but planning and scheduling the activites eg the concreting the ot sa of resident bling can be spit vp nt lements at follows ending | [Remorse | Cnc vetsCCoNSERUCTION ENGINEERING 2 2 g sp MANAGEMENT scanty ios cont ander Vet ite Compt cist ig. 74 job Layout fora Mt toepe Balin SCHEDULING, 108 LAYOUT AND LINE OF BALANCE 178, WORK BREAKDOWN STRUCTURE In-any construction project, the various activities that project have to be clearly identified. The lst into easy enifable major systems ‘scree wctfiesincalled the work_brenkdown, structs ‘naj pret frat ented in tera of tend em, then spt into-syatens, sub-systems then theit-componenis and elements ‘Project Objectives Specified in Term of end lems | System Fig. 77. Work Breakdown Structure of 2 Project nce, wotk breakdown structure i a device that identifies the planning and scheduling the activites eg: the concreting the roo sla of residential bulding canbe api up inte ements a8 follows CConeretng forthe root slab|onstHUCTION ENGINEERING AND MANAGEMENT 6 SCHEDULING, Jos LAYOUT 4 sip, LINE OF BALANCE (LOB) TECHNTOVE, i IND LINE OF BALANCE 73, LINE OF BAT ealane i plannig oNS sepatitive operations and to obtain reso 7 ene opemons and ree balanced schedules, to guard Introduction ee gue the EGU ees we ea te ee SOE Sperone eek and a ol be sei ae ot cane aed Te ee gh weve, Te wh ab mau ouing vt ER ‘ings, eaels . ie tntion of contin PO een “eames loca by prvi Hn Sg te ence nak can A ay the fo eet eran wih cone ‘ok res ih ch Nore con ra PNT ents, mace en Taboo end re ed fe abling, selecting, eo 18 ean te ed rane, rte se Len to a wren ee nat wae ery irk tng et eT ae curate eats ene oY Son. LOB in Construction 733, LOR i ee sed a he nt or an he erm ig ae pecs ascer, aESey ond on rojas arate that they, O0240 Fig 88, Newwork Lape ‘A dummy is silar to an activity but it does not ny eu te eyo etd by wh nerd eof activites or evens can be clsny shown. A dumm) ted bya daked cow ot thom few <> . (oF NETWORK TECHNIQUES 83. OBJECTIVES OF Merges fr 0 te mae of 29 The term Neto in) a eotling the FOS seg ar pc SEI comgoneni ct eo ponres a te os in of projets, determines Pro. con sire oF events i it event. An event which marks the beginni 1a @) Called a tall event. O4 Fig 84, Types of Bris tn ig 84 event i sid be lls he ping ft iy cnet 2 od 1 B62 10d BN, Gate he begining OF a eee ute ta vent which mas te comple "activity. a eC cmpltion of end of acy sly, events 3, ch Cie Dc Me gevnt an event a athe tev or same ct 23 Dual ol en ver for some other actly oF act Sed sda le event (nig event 20 i Sas tne ta event for ace B, SUI CS aaa ae ove Merge events. In aw lag rt Merge event © a far ace cones sown Se munbero ote aes tom i ere ete conver Sete seme a 83 des fom which a number pn eat Bunt nodes i. 85 0 [ON ENGINEERING AND MANAGEMENT ing, of an activity #8 it event to activity A as c ‘ail event to activities B, art of the respective tion of an 2 in said to be a head event to aclivity A 5 and 4 are said:to be head events to some activity is vent for activity A but act a pheeree ‘Cand D, so event ams, there are some nodes td thre may be oes may diverge 7 called as Merge nodes of activites emerge ae called PROJECT MANAGEMENT THROUGH NETWORKS 2) © © © © @ Burst Event Merge Event Fig. 85 (a. Burst Events Fig. 85 (0). Merge Events 85, INTERRELATIONSHIP OF EVENTS 1. Succestor events. The event that follows particular event inthe sequence of thelr completion is called a successor event t0 that In fig 84, Event 2 is a successor event to event 1 —rt——_C—sSCri ret ite Suri mp ee paces a tng 4 Bee bid bo podem’ Sih ek sina vet Tiss prtcoses Erne ere ess 6 InveRneuarionsinr oF acriviiss "oases or onset sev: Palsy ae ‘Sits when eel at nunca od ape ‘dent of each other. ae In ig 84, activites B, Cand D can be started simultaneously once the activity A is completed whichis indicated by event 2 ere activities B, Cand Dare said to be parallel activities, Serial activities. These are activities which can be performed only In succession Le. one after the other sequent Oo—O—0 Fig. 86, Serial Activities nFig 86, activities A and B occur seriall Vo. to say activity B can start only afer act not any eater. DUMMY ACTIVITIES AND THER USES mony is an activity with “zero time’ consumed. A dummy is nted by a dashed arzow and identified by the event number ets. The main objective of the use of «dummy Iso show the | Interrelationship between the different activites, one after the othee nly Ai completedconta 0 Dummy ris inne ig 87 acts Pand ean se tS, Band ae pall ate nat acity 3 one f. Usts OF DUMMIES ‘Rims ave wed fo ser 1. Grammatical purpose 2 fogia Purpose 1. Grammatical Pp vies have tytn ead tT of Hn the activities are computations. tn the above figure, the Ps tummy, vo activin ee hove change in the above dummies connecting 35 8 and Qeanbe cart the same beginning 2 ost. This res {cro ENGINEERING AND MANAGEME Activity sry fed out simultaneous 1S damony lnk 23 citer event 1 has been wits. fared only after event toro purpoves Convenience as the lacorrect Representation Fig. 88 (0 ot mae stating and end oblem < have the 58 is given in fig 88 ( “eB give a correc Ing in errors during network fo) We see that grammatical [ROIECT MANAGEMENT THROUGH NETWORKS Fig £8 (b, Corrected Network using dummies 2 Logical Purpose. Dummies are also used to clearly represent the logic ofthe network, where an activity is common to two sets of operations running parallel to each other. Fig. 89 (1) shows two activities M and N having common end nodes. I the predecessor activites of Maze sda that of N tue K and it is changed to serve the logical purpose as shown in Fig 89 (0) Fig. 8910) : Fig. 89 0) “Here, two activities have the same name I which is against the fork rules. This situation can be overcome by the ute of ]OVISION OF DUMMIES dummies at the correct positions during the development ork i a difficult job. If redundant dumnies are provided ork, it may create confusion. The best method fo adopt conditions Is to provide dummies liberally in the devas ge to fulfil all the cequitements of inter-telaionshipe Various activities. This might invariably result in the of some unnecessary dummies which my be removed dary stage of development.i oe Phan op Ar (Se a BAe Baened networks PERT SPS) a present the 1 i ee ites and it the events. rmbol and the time dura activity name oF 4 togleal diagram, th method [ be the most popular method sem to pe mod JP ie int mated te be modus developed and at td i ao eit fo sect wih Sine ow, of Sere ao ay te om dagranng te dummy city Leama Ooo cumbersome to diy a a HE a cate “st 2. MON. NETWORKS or PRECEDENCE DIAGRAMS etwas, the nodes epee he ace and ar ei intercependencies of precedence relationship crag bet vero yee . a et apy se ciniy seated ‘written within es ae ‘number and description are sete tee = Length and direction of the arrows have indent i he Sopeneney of ne ae allows recedence dngraming a satonsipa than AO-A networks ait fon anothe CHOICE OF NETWORK TYTE tere repetitive tal ea oe ier ted wher vera major feature ofthe projet considered biter for the sept wesnce etott ave ore wi Freeda they ate aso ater bt senna oat ity vent etwas nif Zomplex Pres where chav woe in BASIC ASSUMPTIONS MADE ees toa grup of actives 1 THe aR abe ten down int Ze enietey canbe den 3. Lapel elatnshipe among ates ‘network chains. there Is not a high degree FOR CREATING A NI significance as they ity in modeling ef ciate dummy ace PROTECT MANAGEMENT THROUGH NETWORKS 8 814. RULES FOR DRAWING A NETWORK 1. A network wll have only one initial node. Initial node will have nly out going arrows 2. A network can have only one final node. Final node will have ‘only incoming arrows, 3 No activity can start until ts tll event has occurred 4: Anevent cannot oceur until all the ates Tending upto it ae , 2) S.No event can occur twice, Hence network oping not OY &) Peemited (ig. 83 6 An arow shld erent oO Singular stanton ean ly and separate nt ech Fg 830. Nomen Lo ‘ivy sould be measet spe 7. The network shocld be dafted such that Completed to eich ihe end a 6 Allens nd intrdependeris sould be shown proper Gn the network using sepa a 2. Network logic shoul sys be maintained 10: in wi aly shown a ig iS, FULKERSON'S RULE FOR NUMBERING THE EVENTS Ar thities are generally identified by node numbers Le; the nec ber {if events on either end of the activi ty arrow. Hence, itis essential, [timber etens or nodes, The numbering should be crea he Je at te lopcal sequence is maintained ulkenone's eae yee o this stent. * ‘The numbering can be done in the following steps _() There will be a single initial event in am ‘Aisin, neglect all the arrows coming out ofthese numbered ens. few more inital events will be crested, These esis “Numbered simile. [is operation is continued until the lst event i reached and umbered. WANTAGES OF NETWORK TECHNIQUES OVER CON. JINTIONAL TECHNIQUES ig evo ein he neta fan prt ay ese feetotipza. CONSTRUCTION ENGINEERING 0 this and consequently the rndencies between vaRioUS this becomes AND MANAGEMENT “ “The normal bar chart doesnt d planes requitesto remember the depe Péatons" and. in the ease of IaRge projets, } hiremely cumbersome (4) When delays occur, while usin prions callout for extra stent Ect unnecessary crashing of operatic becomes impossible for the planner to sencies iy Plnaing, analyzing and scheduling are separated when using Planning, aoa atgws a greater concentration on the planning spect. ug network techniques, the ritical fons while, bar charts are me need tobe done, a9 it remember inte-depen- | 8.17. ILLUSTRATIVE EXAMPLES: SECRETS ie eae ate te ov “olution. The step by step numbering of the events using Fulkerson’s fue are a6 follows: the initial event P which has only outgoing aerows is numbered 1 12 Now we delete all the outgoing arrows from node 1. This makes TNR ae intl events. Now Q is numbered as event 2 and K {S numbered as event 3. 4 Delote all outgoing arrows from event 2 and 3. This makes nodes Date Mita events Node § i» numbered as 4 and node U is numbered as 5 4, Delete all outgoing are nodes T and V as initial events 2, respectively. 5, Finally, delete all the outgoing a faking node W as an initial event 2 cows from events 3, 4 and 5. This makes od these ae numbered as 6 and snd this is numbered 8 rows from events 5, 6 and), PROTECT MANAGEMENT THROUGH NETW 5 Net i dea meena cei he neork for le projects, may becom IESGHEY fo caryout modifications to the ial nto e cig ee in nvr. may se ay eon, mma my bed wise Winvete and allot them to events ee eee ee 7 89517, 18, tivities Efi cna Sh pm Eh metees ft oral ma tong mast fated bug fea cannot start me fb una 1s comple ae 1s dependent upon the competent ou Draw and number the setwork, Solstion fetwlon Th sp ep develops ene eee in elow. Note that a dummy raion fee s(t fall the requirements mented a sentoned in Ta art i i nn he Se eee ene sccording tolll ON ENGINEERING AND MANAGEMENT ity. ran with the expected time of each acti a “The netwatk is re slated using the tabular form. ane Tan Tf eh vent i wing ES) Sep ‘earliest time at which an event can i Tyo an event deine meat which can Be alowed 1 i oc eg ihe If there is difference betwot Seuss | diecees Bene event al reer te revi eer ‘Tabulating the Ty T, Err indi Tee thot changing the roe du pected GENe 3 he slack of that event sd slack of ach event rd ltest allow PROGRAM EVALUATION ANE REVIEW TECHMOUE (PERF ns tent | i ‘Slack 1 ° o ° 2 5 a 6 3 6 6 ° 4 5 6 1 5 5 5 ° é 5 6 ° le 8 » ° 8 2m 4 ° 9 % 2% ° We find that only events 2 and 4 have any slack assoiated with ie I meane tat event Zea coeur upto 6 nits of time late Without alfecting the scheduled” prof utton. Event 4-can. be “In without affecting. the project chedile “Finding out the slack of each event brings to our notice the relative urgency of each event. lack means that time is there 10 pare for that paticular event. Events with slack are les gent. Tt fas excess resources atached to it oehich can be traded off in case of an exigency. Events without slack denotes potential touble pots Slack can be postive, zero or negative Positive Slack. Positive Slack is obtained when T, is more than T, It indicates an ahead of schedule condition, ‘Ze Slack. Zero Sc is cblaned when 7, egal © Ty This pce on schedule condo Negative Slick Neyative Slack curs when 7, ess han Te. Thi ce when sched tne of cpio Tes tan Te Ts ac fend te scheduled eonditon CRITICAL PaTHt Iestoned cai the valu of dak of an event determines Row ha evet eth eet tote jet dart Atel pl rh that connects Ue evens Tavig fe sack oe maar ih network Al the events in cel path ae conaired al and any daly ere cere wil oul irs el nh led comple the progr Aco te ciel path Whe ong {sie wie) ie rjc network. Area path dey ih the network! ural by thik ne——————— “CONSTRUCTION ENGINEERING AND MANAGE ve eritcal path for the network v= 1913, Determine oh 3 “To find the tel path, we have #8 a the slack of each event rtf thee can be found out using the tabular Loren rst determine the TT, 98 86 anne eee | qe ae sappy yg PROGRAM EVALUATION AND REVIEW TECHNIQUE (PERT) a7 ‘he Ty T; and slack of each event is tabulated below. Event Te 7 | Sack 1 ° ° 0 2 2 2 ° 3 6 3 2 4 6 8 2 5 7 7 0 6 5 1 2 ? n 2 1 4 B 3 ° 9 7 v7 0 We can see that events 1, 2, 5, 8 and 9 have aero slack values sociated with i Tht forms 'the Cia Path network i eon wth the Ty T, ard 8 vl ech event ‘events 1,2, 5,8 and 9 have slack values as zero. They are joined ‘yy 2 thick line which indicates the critical path. 92. If the scheduled date of competion ofthe project is 36 find the slack of each event as well asthe eetial path ofthe jk shown below10 CRITICAL PATH METHOD 103, INTRODUCTION ‘The CPM or Critical P 2h Remungon Rand Univec Senso esto edo the ine Se rerun antnacon work. Ses then, CPM ound tc ororucion st wih appa he tobe oft suc ke dams, bigs une, Nie ange Cea rus sed or repettve ype of ty where sins meats cn be mae ote cis te 2 ere of nee pj are ater abject © Pret he sneunt of venation. Fence CPM is ot suitable fo eee an development pe of prs DIPFERENCES BETWEEN CPM AND EXT : a OTTER yond nework whe PERT i ve! ote cP th ne estates ar of ne degen of ary, while Fc mse ota cet an tee an ocean aoe eee Pa tes te determinate approach and PERT ‘Sines the probable approach tn CPM, cn isthe governing factor whe in PERT, cme ise CPN nso In CPM the projet curation zo ned that he ot Fee ee PERT, tis asm hat costs ect proportional ti reduced fo he mma pose 20 1 CY teat co “he cael path nthe CPM that path which Toile wht in PERT reat pth i the path Sal event 105, THE FROCESS aa eect CEM networks ae activi oid eth ‘Fence tis the activites that are planned and monitored. Activites aw {tine st operations, which requie time tobe cxeied out and which sth Mothod was dscovered jointly by Dupent In 1057 The zeae tam was trying to equised to perform routine plant joins the cee ‘which Joins the 130 ‘ceTicaL Pari MrHoD 131 ‘equi resources fort competion, Events are mlestones representing the bepinning or completion of sme activity or poup of ceria ae CPM als, activites are represented by anos abd cents by cacy nodes In CPM, it i the activities tht ate labeled numbered for In eimating te tine durations of he varios ates, CPM and ERT follow diferent approche ERT fos the pens rose n which hee tine estimates remade foreach ste bs te Spit te (the most hal tine (and he poss ane {fe epee tie ale ro he ee Hers is expected in draton hs the same dee of ect sin the range ofthe thie time estimates meet CoM tallowsthe deterministic approach which tunes iormatin i aval onthe atte and Rene ely ase ee stimate sufent No uncerinies te ken ns consaeaen svi dart eee 184, EARLIEST EVENT TIME The cates event tie o the eit occurence tine the eu a which an event can occur. Ii the tie by which all the acts lchargig ito te event under cositerton te comple te arf the alt expected ine aed n PERT ma ee eertainty is not presen the Word ‘expected eee ‘ee cates event tne of any event canbe eal cle Adding wp the durations of he sci lending wpe or ane For example th T, ofall Pe the T; of al the evens inthe simple newer given ‘can be calculated as: ce A Co? vent 1 the fist event, hence the Ty can be ak ence the Ty can be taken as 0. Event Hiatt compo fact A Hane Tra vet 9 e002 = et 3 cecu atthe completion of acty B Hence fof eg 8 Siisly Tgof 454 9 and 7; ofS=9+3018 ingore 4 tnd Ty ofSe9 0328 Ip fan format the equation for, & : We Tgs0 7 102) Ty isthe catist event time ofthe head event Ty is the entest event time ofthe tail event 6 js the activity considered, 1s the duation ofthe activity i ls formula canbe used o fn the easiest event tne ofthe events igser and complicated networksara nani ” {STRUCTION ENGINEERING AND MANAGEMENT ‘These ' owe s og. Soycis an activity onented network method + COM times, acy mes are also wseful or ® vty tes ae sate Cie and J Latess ish time anal Start Time. The east start time of an activity the net yc an activity can stat This is therefore eA caries toe OY Pe of the ti vert ofthe activity. This 6 denoted SIT st = Fares event time ofthe tal even if the activity atest event time of tall event = Ty. wst= Ty (003) Eavlcot Finish Time. The easiest fnsh tne of an activity is the eae Ts hich it ean be complete, An early fnsh is std to cae me ivi tarts at ts EST and takes the estimated duration for completion, ERr=EST+ 8 ie BTeTY +8 aoe) Lafet Start Time. Is the latest ne by which an activity can stat fj then i at the completion ofthe project as 8 whole, For this the st the Latest finish time less the Ueswity should mart by a time equ setity duration ist = Ut -# “Latest Finish Time, Is the latest time by whic an activity can coma witout delaying the project Ths wil be therefore egal Sele lowsble time of the head event of the activity. LET = Latest event time ofthe activity ie) UT* TY (a rom the definitions of the four activity ties, we ean te that he Fear atviy times can be derived from the earliest oocurrenc ae Fever andthe atest oxeuzrence time ofthe head event kn the activity durations. setiviy name snd tation. 8 for the activity 1-2 ln the above network: 007) There are 4 type of ots. They ae 1 Tota Got U2 Fre don 5. Independent da A: Interfering float. het ctxt anamico ‘This can von se. T be td by malig he sae mtv Sore For the activity 12, Est Ty =0 ERTS 142 urs e3 ists til Ww 3-20, ‘Those values are gen rally writton on the activity arrow along with Teno Tr; Teo agsterm 724 Duration (LST, LFT) tal Float, Total Moat isthe GME Tae st he ine pen by whch he stig elayed without affecting the ovezallltt 0 CONSTRUCTION ENGINEERING AND MANAGEMENT completion time of the project Serie have a diference between ‘hmpeton and their actual duration. fost ‘Consider an activity fj, The time available for this activity is ea to Oo tse boven seats tart Sane ofthe tal event TY and {he latest finish time of the head event Ty: ‘Mal. avaable ne = Ty ~ Te ile the activity duration = "Tra fat Fy! = (T!~ Te) ie; Fre Te = Te 4 8 alo Fr = (1) )-Te fat 1) 8 = 0ST | 1 is sometimes found that certain “ne maximum time available {OF “Fis iference i termed as tla ana Ty = BST. Fre tst — EST 003) Siniaty: Fy = LET ~ EFT: Free Float Free float i that duration by whi layed without delaying any ober Settlon ofthe teal lot. Ths concept [it activities start at thei earliest times ‘Consider two activities and is su for stity Hj = Ty ad foe f= TP. Let {Sf htefove the activity wil be completed by Te mevity pecan start oly by TZ. ‘Be a gap betveen the completion ‘Suction is clled free float. Pree float « Fe!» TY = e+ 9) tut Ty + isthe EFT of activity Hy F, of acivity bj = Ty ~ EFT. “Teefore, ts the diference between the eatiest start time of following activity andthe earest finish time ofthat activity. ‘Ako Fp=T/-(e+ ®) Sbsttuting inthe equation Fy = T!~ (72 +) Fp= T- s-F)= Fr Te TO = Fr-§) “Therefoee fee float is the difference between, bead event sack Independent Fos. Tt the exces time avaiable ifthe ps wy at an posable and the succvding activity tt 9 (ay the total float and ich an atvity can be Tocceeding activity. Tree float sa ip based on the assumption that Example 104. Calculate th the network given below. sesor jr. Erist start tie Pi be the duration of activ 5H The succeeding 0 Tis greater than T+ 8 there wil ‘S aetity 1) and activity je Thi CC EEIESS'’'S'S ~~ 1 Predecesrativity # 1 hes by the at eb the eas tne Te ther He the the TY. Therefore independent Hat = possible, Consider activity 4 = j with successor sctvty =k astviy 1 ay ca tty nm fine sae 7 = This independent fo 50 pst ofthe ce ost Te 8 (Subst ating for Ty =H © Fy + Te Fp Fe Te Tis Be thle To) rr TA Therefore indepen: pe Interfering Float. nt 1 Float. Interfering otis the ference between the total fot and free float. This Potent down aes tl 1 the head event slack. Ths isthe ne F=f Fr-@-9) Te RF 1 activi a tet Hale ii[CONSTRUCTION FNCINEBRING AND MANAGEMENT Caen eee ak ofa the Ty and, values ofall events are computed for the network and wrifen down adjacent to the nodes. Tn the tabular format, the fret column contains the activity and the ec ee contune the duration. The next two cons contain the SF.SRI Tatu ofthe tall event ofthe activity. The net two cole aan ead T, values ofthe head event The next four columns Seetin Soei mes' The fst among these columns is for EST which eer he 7 ofthe tall event. The next is for EFT which calculated ByMmine the cet duration to the EST value. The fourth clue of Oa for LET which s sme as 7, ofthe head event. The column {his Ero at calumn of this group) is for LST, which isarived 3 by edcing tao these I for total oat which is equal to LFT-EFE er eP EST The second column i for fee flat which is obtained by Segara the Reed event slack from the tal lat The thitd column EMSRS Stiene at whichis arved at by reducing tll event ll {oe reese The IV columa -inertering float equal to (Toto ee flo! 4309. CRITICALITY AND CRITICAL ACTIVITY iS Hots, totl font is the most important one The degree of eat povides information eegardng the eicaly ofthe activity ince total lat the difference betizen the maximum avaible food nevity dation, there ae thee possiblis 4. The aifference is +ve. ka; excess time Is avalale forthe activi 1 The difference is zero Le no excess sme i available 5 Te ference is-ve i; the tie availability sles than te rel ‘These three sates lead tothe following classification of etl ‘There line ee ccrmicat pare MarHoD 143 Subertical activities, When float is wve-the activity needs normal ical acti is eve the activi nee tention but has sonne fexbilty, Critical Activity. When attentions Ths fas No freon ay seer?” SY needs extra wosee veel ai fats Sh The critical path of ane I ital path of network in he ion of his path gives the those activities that are ita. ‘shies ne na THES le ea the tt a ath EZ fn valve eae Lt de te The floats for the activites 1 2, 25, 58, $10 and 10-11 are zero, fore the critic path = 1-25-1011 Ths pth smal ae thick