Im & or Latest class sotesnae oC 7 rae ee : Queime HERS: aecten’ oe — Mathematical behaviour of yous vas first studied by = Ww ‘ji -\ a Character 7 dy Arrival pattern : : i eo 2) Departure pattern. : of , ; at— 3) Priority rales al +H 4) Customer behaviour. \Y& Arrival pattern can be deterministic oy pro babilistie Soe . Sysgeo! + . 0) DeterminisHe > D. Cape com re exnen a ceuctroet conoed) SYREN St Sy Probabilistic 2, MeGags cack en eatoen econ cases) « * SAL Vea por E cent) Sore + Probabilistic qurival_are said to follow poison distribution =| Gandamness) . — > Neparture pattern also can be probobilistye DERodare, POAkeey ASUS Deterministic 2°53 Probabilish'c > M. or deterministic Toate Ane. CRAKTIENE ONE ee Qa, Ye axe * Departure pattern js said to follow negative exponestial j jd tofo Queue discipline / Priority mules: Probabilistic. ae swt” Tt gives how customers ore. taleen ff br sevice. Z . _sichegailly acceped fers. ( First Come First Sewe) = : LcAg) ( Last cone Fist Serve) See aac oe eco. ( Prefered Corlerer Order) Pamso for ve Peo. | aN sige | Serie. In Random order) >“How customenorbs having “i x Balking: — Customer leaves the queue because fhe queus. t's too long or fhere is__no sufficient to Reneqing : Jockeying : Shifting _ from one «gp er gs Kenpates NoTATION : foc a ape aggness + ARRIVAL PerTean / Osenaqoe | Me. of Systen case Infinite PATTERN / Seyvers / capacity finite. open ee intrf frees " coi | m / t / 2 | Fees t a peisgon™ + Negative Single Syeten Priority veto expansion server capacity we arrival depatture. » | 2 Eihial stages on formation of queue, gusue clep endont m He & queue is Satd to be fransjeat in nature. After some time quene bewwme ft ie called ete state. FES Mad conc t o acoe For mulee applied for stead y stabe system & nok applicable for independent of time ther ‘transient syshem.Gp abebentinh | oenhy Ue tanee a pellet Poisson arrival Negative. exponential departure. Single server System capacity ishnfinity. Prissity rules FPS ~ Service “rate > “arrival robe, a Je ZDepurtore vate » asreval BO Arrival rake = No.of customers arsivily fer unit time. No- of customers arriving Ch, ST 2 Yr Ae = Time taken Departure tate = No: of astomers departing by tHme tak f customer depasti gt = Norah euctomer departiy gf, Time faleen <4 wa ustornet Whenever amival occurs! a birth take “place & pure bis peissan distribution « Whenever a customer Soporte a death is seid fe be. he token plow &£ pure deadh process distibudion. (er —we qexponentia) cistribution Mean of a distribution” we seco" | per? OF Og ae Se legtn cf cytes A> * ACI %y) od be = Lge g Avg. wolting Hime In queue: Wy * aR” ao) 2 : : rhe AG j' We hitting Howe Ip system + Ws = Ay - ts Jn Peability °( Qi 2-N) = ~ ; P(@.>N) (2 ol a. a ayy —_ Probability wT. tn wow fa alto? dw Prob. W.T in syskm > w -f la- rye Lnrendiog Wueug ending > Non emphy qutuet~ A queae thet form fime to time , 24 hr | | | } | | ~(Aear) oa ! 1 operation. ete ; iAxg Unending youn Ave. lng = length eT Unencing queue. Goods are to be transported from factories to market » [Oyo violaHng supply restricHen safe violating demand /emesisy vutriction € af min cost. , suth a prob. fe called 4 =| transportation prob. L.P. Formulation: MA Rr rote,| Me ” Tay” (te F P Fo Ss = t ea po Si. Crestas Rermayd D Dd, 2% Rae CSS sey) (TL iy: = Rramsgavicdies, Cost aP 4 Tod Secret @+cRa Sx tty + U*rrQ@ae KFS, 4 . ie ere ore {Suppl veatiction * Spt tuo =s, SUPP, CONSsAMAs _ Pts = 0, an Qtt = 0, Rt = Dd, P@Ris tiv 2° wan portation problem, ; i cated tf fetal supply = total dleman \> Balanced transportation | prob OR else. 3 Unbolaneed 2 — * -Tn case of unbodanee it should be converhed fo balanced | problem — before proceeding furthor; C — TH, supply _> demand , determine excess supply over : demand poe . Equivalent to thie introduce a dummy Fectory woth Q unit trans putoHon’ cost — > TF demand > supply , debwExcess clemand over cupply. Equivalent fo this fotroduce a dummy factowy with O unit |” transportation cost so that it becomes a balanced problem. at : Sobfboprocedare. Gera potedted puters con be Sao eater wg’) AL) Roding an E868 (anita) Basic Feasible sol”) to the prob. SY sauayon on 2) Tinproving ot to optimality.ol : @ North ~ West cornet? method - | @® Leest cost sell method. — @ Vogels approximation method ( Genesally gives BFS) —_ aoe ver) ee 2 North coast corer gale + Al Set up the balanced transpertedion prob. , Mork. the hevt | direch® of matte & western dLireeth of the matrix. aJ—7 Select top left hond corner cell or north - west corner cell. awe celede al Alleccte at much 03 possible to this cell based om supph 11 & demand. uj-rDelete column or roto satis tied 7 gi frRepeat above proces Hil entire allocation ts completed, a ee he Write transportation schalule & transportation cost. ee ee ™ “ } th , Mane 5 x | 4 | sey ss t 20 Wa “T22] as. As = oy, Ae t af 65 75 14S “TrasporT ScHEDVAL © pew 25S p-x 7% a-x 74s Q cay 2 So Rey 7s T.C = SENG + Poel tae xo2 + Soxag + 20X16 =+ se Set “up the? balanced: transportation problems « + >Consider feast cost cel] in the matrix, —rIn a selected coll , allocate os ssnuch as possible based go supply & demand, cletefe column oc row satictied — > Repeat abeve procedure till etire allocction ts complefed. Write the transportation schedule & transpertaHon cost: Suppl i me wf | | eet = =} Pr eset) 75 MAX Dernand “Tran spectadion ae ~ IB. P-y = 75 q-w = 36 = TERE § SHH “Transportation cast FAOK 2A $F AOKI 1 _ Vogel's Approximate emabed > Set up the balanced transportation problem. > Compute the diffrence: bet? two least cost’ cells in matrix eblumnuise &£ rew-wise . > Select may diffrence. , if there is te seleet ory. > Tm the selected row of column consider fhe Jeest cost ell. ~r Ailocate oS much as possible -fo this cell bosed on upp ly & . : denand—> Repeaf the above proces fill Bile allocation process comp |e Wette the ransportation schedule & fransportation cost- f & = ind Prom N P Be g 66 6 Demond ~ 5 £98 eH M45 SJ fo etn . ' @ [sted min cost ce - « @ » Troospert schedule, Transpo tations cost P-y 275 , Q-Ky 2S 0 \- @ x eH Rok 2 2e Tq, soos OF Prddeds Benecally Vogel. “approximation method gives 4 better foitia basic soffvto the problem.n Tinpreverrend sel” of optimacity 1 Procedure 4. Count to the no- of allocations 2 Compute the value of (rows 4 colem — 1) 3. No: of allocations = (rows + columns - 1) | then if ts not a cose of egeneraty Tea ER one SRE ore eradR SOUKTHT 4TENo- of allecatimn < (rows + columns - 1), HHs the case of” degeneracy. To resolve clegenemey , comple the ali ffrenee Let? no ne mn troduce aq small value fn any ef thewnllocehed ex] such that no. of allocation are equal to frows + calumns~Sh & alloceHon solye tn 5 — independent pos”. ' a : 5. LF noc allocation s (reas + columns -1\, iis a case of more than, one_path per cell, 1Ms + Tt is not a cose ef degeneracy. x Modi_method | Moai fied dictribudion method for empty ce evaluation — 7 —9 Take Uj along columns & vj along Tous . = Consider only allocohed cell, aero any allecetten eel] | make either uj or Vj 2200 Det. other value such thet’ ' Ul ty Cr (cost of sthe atlocated cetl consi i Using the. remaining allocated cells det remaining valued ¢ Ui & Vj sush tha} across any allocated cell the sum of UE FVy = Cip (cost of the allecabed cell) - Consider the empty cells oy ney allecettd ceilt in ihe mafrix — for all the empty cells compabe the value of ij -Wi tv Tf empty “cell evaluation gives all tre or 0 ans. then vel is optimal er sol” ts _ suboptimal . ».| In case ef suboptimality consider the mest tuely evaluated < Storting from this cell construct a loop suth thet we come back fo the starting cell. A turn is permithed upword , downward, righeaaed ov (effuoa such that we come back. to the starting cell, Starting From the cell selected fer improvement give alternate, tue & ve signs fo the corners of the feop where q turn Is token. Consider the vvely signed cornet in the weely sign corned constaer the feast quantity allocated. | Add thie gly fo tue com cleduct thee qty from -ve comer nneihe aeP-y is most -vely evaluated cell which het -fe wale if Some unit! are transferred fo cell by leop methed the cout f transportation tyes by 10 Rs for every unit transport to this cat a a In ~vely chose valued cornet £0 & 20 , leout vel ve 20 os od ee — Ui - Surely 75 s gs e i : 7 is ee 2gQ [ | | | | Rows + columns - 1 = 5 No.of olloweationy <_ Rows + columns ~ J Cose of Degeneramy Introduce smal] value Be any of io any ye Fer unall ocetec| call compute | ip 20 “Ue signed omnes qty 20 4 $0 desst Aad thi, te tee Corned & cdecluet thie from —ve certel & write the new matrix iear (transfer he includ y/ ee 7 « “oO - 20% 0 A 3400 _ impriemea- ie _ ee - k Next Ne augeneney ! Meh evelanke Cia) iP some cats tvantfeered fo thts cell cost ef fanspertation led by | 1S reppu — for cwery ut ~ Ranghered be the call Th -vel signed corners gtp are or 4 3p 7 89 7 Vesa ei ceee oc : ge Fe SO ce add & . i i i i i NTo = 8400 (ge x138) . Sepak 351 Re Not allocation = Rt C.-d -5 No Ce) Met -rely — cvalufed Cie) 4° at. units ave hover bo THY cell by Loop m the coi} of tromsper tation Ley by 10 -ruppty forven . unt trong hes to’ they cel] i s19m corners qty are, ZS Selett min HY 28 odd it te tee corner € clackuf if fron ~ ve corne g | uy % ; Ry i 0 $4 ast WG pa Py. > Nn ou AN geen A 29 24 ee iio - Brn 4 C3 [26 ptimel caf 2) 1 Is} [te | - 2s € f\r AS NTC. B5lo - ae xo 3260 Re. No- of ollecatinns <- -Ro tC — 4 alton cy Cele. col clegeneroay. Te vesicle dlegenemey jnpeduee ‘a small value in ory cf unallocated celle such thed na. éf olfecation becom gual fo (Rte -L) & allocations ore in the incteperclanlt porto, All & ~ No physical signi Ficance Sie = 7Si¢ re « « —* ‘ pemang | te | 2° | ave T.c = SOKG + 200 4 BOO FISe FA4OE $ 700 ena 2o'sd . No. f allocation = RAC” LE j \ea Coe aaa) _ Most -v@ A-2 > C2) ; , Loe ie TP some unite peansferned fo this. cell by p method cod of trons portation dae. by 2k fev every unit brancfered ~toe sign comet's ra : $0 , 20° i i 1 1 1 Ma 5 . ; ; dust from ~vel Add £0 to mk teely chunes k de y | \ \ae , ge} c Boman “| 7 let Sb wt co | ° 4A CS yee oO) my 109 ! aR fe) co 4 sont 260 | [Sepr'y so ee a0 { Th. sol” is optimal & amy of empty cell és having ¢ evaluation & tt some units are transberred to the cell by Ane Hoop” methud the cast #4 hanspertadis remain is some bul an abtenate sel” (is cbleined TE 2 emply cel] > 2 alhenate eo]? 3 se > 8 4 For a 0 ewalabted Cell constiuet loop & test the wu by waeal *prrocedkune. ‘Too ge alieryzbe sol”LEMP Osgr Ole, QUOC IA: a tf gouts cow ref be “ronsferred “foo forlery do omekep then fer thet conblactian cf Sign & poomdad co thal alo cation wil new be made os —_ — Nes ef cllowestine D> R+c-4 2. Ten CSG ef mere thaw | path per cell mort -sely evaded Ce) ara 8 oO OTR SEi J Lovely Sed Corners Ye. 22 & BO Min = _30, \e Bo to tue corner & dedact from —re_ i | No of allowcetion < RECHL : 4 No. clegenemey 7 | A) velus toe 2. sol” @8 optimned OTC = {£00 J worm + Sexe + Bo x22 Flee = 7850 _ OO vs, 02aw [5] Eee > Loe, No. ef allecatin < Ric 4 Tis case of dlageneroay . To resolve dageneracy odd smet} value Py ery 0 of unallocated cel] surh thet allocate’ care indeperaled- position 4, Pe nena ioe ee =i Min -ve value ee\ s Bequendny 1} TH avtesea when there Ore _seyeral job & each job should pT Ness arteses in Jeb shop: (odd yet) 2 mje_A_& then o_tale & cuth prob: Bag job tor mle | Sequencing can be don done by 7 \dehnss son's TU ms rel & tls aq | spenrishic-—vost heurisite rule ge ale af thumb ie there is | 22, proof. | Procecture : \ \ List the, process met oll tocn (el toe both the mic Sdut the least process Hme , if these je He select an Th the seabed Hime ie in mle A, schedule it OF early as possible. th it is of fe Be Sm ope eee Delete the gob schedule. Repeat the. above process Aye ti entire allocation ts complete A det make spon He, and tdle Hme of cach mic. ' a Job a 3 TA _ 3 mic 4 7 ,a}] 8 les 8 s “Tabular method to de} make Span Ame:“OMe a TO To 2 = 5 20 ie 25° 18 24 = Make. spon . ee time, 27 28 Idle Hme 80-27 = 3 0-2 . 5 7. utilizaton Lavo « qo. 2x 100 = 93.337 GANT CHART © 2s 8 ge 24 me 4 [o- 2 b-? |o-1 as | 6-9 fz 2% J@- 10 JO@-8 jes 1@-4 be ° z 2 cra ay 80 i mle 2 x ee « Processing sf on fob through 8 mje In segerence [rea}-—>[oice}={mie¢ ] n job 3 m/e cose converted Fer applying Johnsones rule , Into on Jibs 2 mle ,case by oreabing 2 artiticaalentc a4Min PT nC = 40 Processing TIMED A +, Cocestiag Fm, on . Processing Hme.on G = e 8 . Processing H = Processing di P ie tnet s Tocessing Hme on 4 Tocessing dene B. + Processing time on. . | Usiag above otliical mle fine the jobs are scheduled , once the jobs are scheduled the original Hime ore, Faken to ded. mak | span time. _ | Tass artificial mic can be created if one of the Following cr ore satisfied Ate Min Prroceasiag Hme on A > max processing Hme on B bo eR : ; { = —* — Cz —_~* 8 i Tob ( Da 3 4 : A 30 ate oe to. = 8 0 80 qo 7O . : c 40 80 70 60 Order of procesting BoA eC Daf. moka span fime | Tob ) 2 3 4 so 80 40 70 Bo 40 20 to | c Ao 80 70 60 Min @&T. on B = So Map PT op A = AO| = = | | Vn lle \{8 2 WL? oe) \)° cuUecee yp o — + ce Tob m/c 8 Mic A mlo © “| Tz to | tr |. To Tr } TO) 2 oO 80 80 {20 120 200 ' 3 80 170 | 170 140 | 200 270 \ 170 220 220 260 270 | A | — i, Processes of (1° jobs through K mje in sequence. : Let ug assumed 'n’ jobs & each jor should be passes through (Ocha eo eet ‘p' jabs “Komi case can be converted foto nr job DQ mic cose if any 1 cond® . »Qo ‘ aeoe ee cn tctccai n z ? ; ~ a 3 a " Sp OMin proceuing Hime om A 2. Max. C.F on) B,¢,0 =F: ~OR- ee \® aR Me i UF any one cf The above cond” satisfy two arfificial mic can bo cveafed (x €y) for applying Joboter rule. Processing Ton X= PT. om A#Bi-- #! | i = PT on Be rem Using the mic time jobs ore scheduled , once + obs are’ scheckled time. the origno] times are used to det. make spc Tob | m, Mp —~a fie fe a (2 2 ee Min ®.T on My = 1% Here both cond” are satistied, hence ‘n' job 4 m/c cas can -be converttd fo ‘n’ Job 2mfe casealas TO Tr To I picks | eamlata To C o |i |B 16 | 16 | 24 2 36 S6 4 2S 6] 72 6o ae &. : QA refrigeration cxmpery hes 6 plants Incated in ditt pods of a city. Everye: year overhauling jg carried out in 2steyes Each stage require werkman with complete. diffrend skill seb The work on shage wil] stort only when stage A hes been completed. A plant hos ty be loved fer ontire pertod at overhauling the preserb schedule f “overhail) tas Fallows 2. we ey ETS %. — ae eel ieee oe032 o@9-@ > > Crea | 6 6 @ 6 © 8 a) w © @ « Det optimum sequence Bownkime f plont tost Rs Boe /dey | Tle Hme -ef cost foro’ Ae + 430 day Ret. cock of overhauling Fes [re] ta] fal fe Creo A Crew B tw | to | TE oeCost .of. downtime of plont.-...70¥ 800 =. £6,000 Chit idle Hme cost of cred Ao “Total cost . a " ~ “ = a 3 nl Aan a eeene Line Bal ancing a x Tt is 0 technique used Tor max produstizn oper” bosieally used for assembly unit Th this the total time seq" to assemble the iteam is divided into ame ler elements & allocahe fo werk. canker. By this method e/p can be. ineressed ona Qs ee} [wes } {on} Los]ao O' 3 yy tial balance. delay Aflwards technolegiced precision ag will drawn fer ausembly oper” wo veolating fechrolagical precision crock element ore grou into work statins auch that allefmed each & every worl center dees not exceed the oyele Hime C, Let actual no: of coorkstaNons ~ bo. ep fo P Actual Une no = rar x 100 Actual balance delay - 100 - ping fg. 44. 2. Available prod time = 7xX5x 3600 ofp = 8400 Cyde Hme. = Sarees = Is seefunit. Time to ossemble funif = 190 see Theoreheal no. of workstations = Be - B67 Theoretic A = ase vio = 96.297), Balanced delay = joo ~ Mnen «100 - 96.29 = S7IFAdual dine hu = 130 Toxics oe) Balance delay = loo- 86.67 = 13-77 Set e(7 -ty Smocthnen index ~ T- Cyele fme Ti - Allotment to higher workstation, 6.T =72000 i { i af vax 0 => -Pesfeed. balance. &+ Aine: Q iS. 1007 \S 1. i) min oycte time © Bmin ( slowxst process) ji) ghs . 8x 60min ss no.units s B50 _ 60 wits ti) pte a yaradliece ti cuseaXble, tou t at X cycle time iy) 6) comblaing GH H we cor have eyde time Nevin & roof WS reduced by 6 to5 il 6.8 4 ‘ 6 es Line te sa x 1000 = ; ees ee a hire Mom eae . Balance delay ee 7. cycle Hme C+ 7X60 . 42 min I Bo “Theo. no of WS = 38 = 8, wes elemed ee 4 1 6 2 ry 6 3 3,6 cig 4 | 8s 5 ¢ 7,10 as‘eelevance. & elemen H they ore to be pul tn 3 wy What ; is mox Line n 2 , precedance Gre of no can net be. broken N= ayy tes 83.33] fg. Ue a 2. segues = A4b00 44000 + 3000 = 1000 Remand ~ \ Demand > supply by 1000 units for looounit create. artificial foctory evtth 0 fians pectohon coup Sw that if becomes balanced prob. profit metry: sot be wide, cue Sign 4? For converttry marimizate~ to minted zatinn pT ; fo all the elements 1 . i No» of allocations = 5 e AtC-L FT No dagenereny . ‘ Aly doe 2. sol” is, optimalPinay = AX H000. 4+ 2 ¥ 2000, 4 3X 2000 F.6 ¥ 2000 = AY 000 Now New S = 4000 +4000 4 Soo D = €00046000 = J2000 Now S>D by 1000 unjks “. $0 create. artificial wore with 1000 ~3 “4 -\ = 13000 wit ep with ° pat ' 8B 1000 ~3 a $000 13 ow De 6000 | Gooo | 1000 | ,, a ~ @e e A ie evs eg eee Convert maximizoHons® to “minimizata. 2 —7e 11> No. of allecations =-5. 5 CHR - LS No olegenerany Atl tee optimal . sol” Pirag= 4O00¥H + fo0ex2 + Covo + BOo0e = $4000 M in profit = SA000 —4loee = 18000/- extra tenf = S000 Net profit = 18000 - Soee «= = Sooe/—2 5 A-| 10-1 418-4 A-3 Dp 29 47-2-9 = 16 B-1 FQ 12-4 418-1) +2-F = tO BY 9% 20-12-79 = Y Cena el eaten tal) ae) Sh cate Ca > 7 = 3. 4A. Te = oF [go4 [Gor 1200 F1f = HBS a-3 70 b-8 70 C1870 + : - ae ® @ aoe oe a ae an aAdding to ory Me 2 OF > sol” js basing, an alfecoade oh 6. Jess than @ => L ( 2 y a Sep 2 = O4 &. zalee \ Wop = Tha eve x nat 7 hem 5 n AAT -0R- m AAT - i | o>™ 3 mA AT } 8 Weiting in system = © { 4: pe toh Asi! ae 4 . | lg = a oe COR eee rei - z . XS 3 u | MP (AP) 16 (18-40) 48 : | = 1,88.a — = Ss 0 A Si 4 li) No customer >, serviee foudlity idle “TH) No customer Som customer ‘J ree, (ae RIG < es) () +) - 1-(2)* = t- 016 = 084 W As A> A Ly is Finite if A= Pp by ig infinite yo. a ie ty © or. >t {te > bs) 13 a= 1 by! Me a 3 - (2) p(asea) = GP) - \) : ), = 0-125 \s- Ly = is ae 4 pe. a alae) nf served s. No “emg, woe19% ©@Bf} =) 4s 8 be ye ov 7-5 mi0 fo 2 4 customer omine Fime TO = 7 *S edtea coed . = fon | + 28 = 12s & D> P= tobi! Alta bee Cc. sebess}- Mon pe the 1- (Prete ANS= UL “GB? a) = 0.4212 ele re 29) ii) Prob. of waiting cuticle = P (as re) ri-( omy = te Dy &) = OST 014822 i a *) Wy A(A-?) . we. = 12 *2 12 3 De 92 Jay A= 24 /dey Me eo (U zs 2 2 lelters (Ls)- ea aoe ao i Cor} of oraiting letter W xe xoL = ARS choral = AO Ra Tetal cost = 84% 4oy 5 = O78 NT ef a frurk ib ad = by r Aap 4-3 T oof tran fi fy oo { Ne of trestles acon cers an ce eg day 7) track +(Wog) (a4 xe 3) x 04 = 28.8 brs @ ne ane Me ane 2 & Poisson avrival \ssumptions service. 2 r¥e exper iad Single J 2 System = Prlevity ea > Service rake > a ian 1S min counter is, Justified fs half an have not justitied ‘ote. eovivial prresead Wei = Vy be i2 08 oyEe Bap aes er Ce ; e ta OTC fuse, = SxE00 = 3ye x 600 i: (800 360 Ry Total cort fyceg ~ SPB BO a FQZO0r1G0d » 21¢0 ~ = 3080 _ tt _— a 2! : 2 aah 4. Pe We be enemas an tar” <> Prob. [ Wy > janie’ J au - e dw. Yo be 3 5 28) yew Prob : i i)e \ cae 22) -2 . J 1x = xe Js @ Ve 7a of woiting pee. to 12min . [co PI wy >12ee)) ~ [OF = 0-4, aeD= feo 4 Soe 4 200 = 600 4 Coxs F N4o¥s x WOKD T.c = Sore + foox¥2 3 6OKS = 20g0/- No.of doch = 6 = RIC -L 2. No Cegenerouy. A-z. evadiiction of -2 £ thes coll, the cout oF unit trans pore some 2 TR 2 cunits added ap to trans portation ued by 2%. For every ty this cal th noel sige signed corner having yalur 4 j The leui ig. 50 aime & subfrost from Bie) oo rountis ore coh & is avoluaid oF 5. H some jransterre to this ch by oe mated «The ee gang porte comaing SURE bag sal” Pe a & ee 0 ag Hae gob wstteraake sol teHH two, CAS are ey liernode. sol” ave. postible ue 7 ue A\ternate. sol” can be found only afta optimality fs reached. 3. 1,066 De T2000 a a D>S by ‘Hod units hence. create an arhticgal mmerket for 1000. units . waxehoude ' 6 3-4-0? yo tees , qe -y- CYTY) mak Sey o 8 This is 4 Babdx cS profit hence, it fg oto be maxciervel A maximisation is converted to minimization by providing Bo -ve sign to all the alementy ye No A allocating = S = arent No degeneracy p om ax 4000 + = 4}, 000/- 3 ae Hood WO = 18000 Nes sopply = wypoo + 4000 4 5000 2 5 gpd0 46000 = 12000 ° LoS > by i900 wots aa ana pe eo+ Creafe an arhtical marked with 1000 wats ari © profit Seen U; -3 - Nj a Supply — “EP Et OA, 4 C00 o = 3 _ ‘ 2. (3 ] ° t Bg looo | 2600 {Doo Bee te} ES) Te “3 0 5000 x £000 tose 6 ove Go00 | Joov | yxoe™ 6 ’ 7 ! | : . 72 . 7 No. ef allocations =S = R+C-) No clegeneraay All tee empty call evaluation ~- dl F og = S4vo00/1 fin frofit = Wooo! ~ . = 13000 — £000 = 8, 000/_ 13 v4 vi OA 3.6 i tee optimal sol Extra rent incurredue CNet No deg enereey Au tee 2, sol” is optimal Te = 128 No. of cullocetion are independent 2 No dag erorobe,en Ad JO-IV4IK-q © 18 A-3 , B-| Ba4 > 20 - J $2 = Wis 4 S 20 -447-2 = 18 (2-74 2-11 +1B-4 = 16 C2 P WB FD = C-3 BP te-1Bti-247-925 ans: @ 8 OS None “No ave cell ot afl teely evolucted Gor doing WHS Komys meme Both need airycot™ vid tobe cham ed ft As Ne Tule optimal 2.473 7O b-B 50 {fp C713 70 g-7 70 TE oll vlan owe greater than 0 (the is unique bud if amply cell evaluations are ZO ther cole \ aiteencte. sof” is postible oO b-8 20 C-13 ZO A-7DRO Q-3%Aay value . lest Than 8 ell IMR Te ot a ANS: 7 @ ew Ss JAS M value is not Known & an ollecation has mada. coll to whieh it fs not possible jo allocate. to an infeasible sof” to the prob TA “is ais @ 28 4 3 3 FI Gl Loe PAS a Ic ie [el (a ian is + + hy2) | 4 i ry 1 og ye ras # fa\ [igs No degenera y il =e), (rn ; Ad 14 Ra I ser [Lent Some unite tranafeit a maa sronfenel ye comer 30 jo drewspuletl in fee | cof = @ 25K19 — 1 | | = ATS.(Stepp stent 8-1 9 wap 1D 7-5 AB l0t sein Te = SX2 = aaa woe okestorbed BANS = ‘upp! & seprl, hos become 9° gnbelanced ta co uni} Te fo make w6 NEG) 8.407 Ope on | relia Empty cell value = -2 0 ed bp tt 16 NTC. af -e90x2 2 95 Empl cell on B Cote le 2, wit ded oil be 0 "To tne in Tc = -8xID 4 Rxe “SRIo + 3>7 = "80424. B04 2] 1. A-T RT 19. fe AKT 9s Te 2 Ben2 440s PF alleeading + 2 Rfe-F 23/ Se were pre . 2destd Sta Beebe ety teers ea S | [eo hel [v7 18 ° ea | — at Tey eT To Pg(ec) (Cae fy io oTc & 200 To. j260 D = S00 + 400 +£00.=1100 S>D b 100) umntt to . . Market for 100° unite ne W, | We Vlg Soprly ae s | U Nea ci ms te Boo uw io) Ue ne & be Usp Ua Ts Soe Is] Bal Gs) Te Tea so 30] 2s [agi etc B Se aene migese 300 | «be | joo [aoe lane fo Dz 126 41BCH 14D = 4FO S ~ 100 4,160 4290 = HID S=D - Balanced W We | Wa 2 3 , | & 2) ee £ e, | LA Le) EY ico p, | 44 tet By, 12s BS Marlee wands 5S unisOe apply tt Ay by SX Bee golve for minimization Bo atre gating optical sol” ada 20% tf it to ges eptirnol fe ee loo tot o = see “Oz Bo + 120 Ese yo +a07 S!° prificiol plant y for ro el fount cae ag (le r749) eo ag-(6r8t7) =+ Te eaeHA AOR SESE IO MSA MST oe wee Rix 73 & % XZ : As a 2,709 & %, 70 I ‘ = gol” is in the 4% pada err Ra AL +e 7 4 < \4 3 D 2 Zmoy = : nimi zodi ea cs © Qe Mininisation Ze = 4K 24 6X4 “Ge Masri mizetion Ze 7 24 Zp: 18 ie ae 49 2 Zain = ag pape A a i po Converting inepuabities to jnkereph Tor i 7 “ ea ' 2 {St qpuedront — He Be 7! Ary . tot) By tte Undounded $2) alo Space 2H, 13% 90 Bounded osithtagaly me Lan’ oundkedk Uottoos= eonncdsey «©, Votereat 09 blocked up Capital a — QD Insurance cost Re ee ® Low theft & Art @ “Lertnnlogice! _obseraeenee sf items in the stores wm Let the sum of be “2 alaraege ef item 1h the stores. all above during 3 pacticaulay Ye 5 Max inventoy level = @ RA —s Mir fnventory jeve] = & Re b i - 4tb —> EB Avy inventory value, = i. <5 Ipverty comyiy cot inf Savertory carrying cost faust [yer = et cH cost [unit x = Sovestory carrying oot |. ee 7 = 7 a chowse Insurance | ~ & ace fusil | month. ta 5 . EF tee [unit [otek = 8x mi feay © ob toe ft y = jtem clemanded by Pred. dept 4 Shortage. cost: Wh an dees in the share shortage results iyve urd not ovailebletp ey © Los} “prbdudtich fimé “ele! 4s Shetsge < 5) Tdle cast ef labour & Mle. € ® Extra cost incurred fie Tush purchase... < ® Overtime expenses of (abours 7 oo : ® Lose of gocdestl cf custorners EB ® Special parking & fore oarding chorging « + bum ef ali above is éalled shertage cast OF bok order cost rf ae Fe0Q. | Nesey progres, Assumptions: ® Uniforn demord. (Time “ for coraurriag phy Ls ene 38 ® Cost junit Tec & ordering cost are const Shovtoges ane Och pesmitted. @® Ropla nishmont ig instantaneous & lead time 18'O” arle annual demand. = A units Ordered gly = @ units. Q Ne of orders = A of orde e a Foot | oderjue eae > Aug iovestory = _ Max lovestery + in invertory “3 \ ee ee = Rr Qe st = 2 ~yCost Junit = © ~plvg inventory cost = Bre P Aoventory Corrying Cost fo = © Tofal inventory carrying cost Total varioble cost / Total incremental cost = . Ordering wy + Bec T= Ayo y Mer 2 -) Tio fxn ef @ Mini mizrtion. - Exonsaie ordering vy= 2/0¢ Sec = 2 Fcc Tf Q, < E£0@ agcliaaaes cee EHH >ac > rac ¢€ Tt a, > bo@ € ¢ 2 Oc < Tee € om total a aerate For Tvartable cost “there ome 2 othe lebet af whic amin totol cost Is Same - A Gy ONE. eyuantite oF ws ¢ ealee| OS E whut, Q, > EO x G, < £08 Tote] variable cos} for any yy @ fo total variable cost at OR Se Ag, ®e a ee ee Sowing SZC Seat Tg Janses | Ogee aoe “ - 2 g Bx wae Feonomte Ordes value. (gov) = @c = Bs neTotal annual cost Purchase Cost fk GYder cosp 4 LCC Tac Total annual cost - at Eo@ eAC + forest woy w+ Seve TY the gly ordered is °@/" , the discouct of R, 2 cost If the yy is" @," , the discount of Rp is gen & whether to axcept discount er nol is a decision to be me € Fer Ibis parpose we hae fo colemlate. total amnual catt¢ fe, ODF EAB ot; 9, fet erat Me etd & By comparing A:¢_with discount osith annual cath of Et ot EK pcmcia amogry all the cos} whichever cast ts mia on thet ruth gty the order ts placed > Lead | Tt ts the the dhat elopsas bfuo initlating an order & Hme of vreetipt of materiale fo Stoves - Components 6f Lead time ove () ‘Time to alse the inden & send if to purchase dy ® “Time for proveasing the Indent & floaty af quetection receipt of quofedion preparation oF© ® = Vransid time. Time fer _inspeten io 8 0 baking info stockg. — Lead time is averiable HY Avg leod Hime © Pi) fel Pie Probability “packing & dispatd. & & savy lead time, lead time @ @ ounder the control ef management Consumption : Dofi as Consumption rate _3To account for Fluctuating used Safely (Batter stot Reorder leve| i Reorder pt: Kone “The amount ef so that by the Home awa fable. nmeiek qty consumed (he LT ~ Avg UT) x a 4) inveniows =Nen under the contre} of yt [anit Hime. Quantity consumed Lye Time taken feod time safely ctodk ie © fo consumnpli2o vaky stock, when an order is placea inventory FS consumed & Preah aeROL [ROP (ee-crcter eon foe od eaere” [Rot cr Rop Average LT X consumption | Inventory model with sofety stock NT tot yt Rol or RoP = ALT X CR +88 = ALT x eR + (mer -aLT)eR eG N Oe MULT XcR May joveatery 4 Min ventoy “Avg in 2) ¢ need Sea tenn‘Here’ tee aye’ prodlasing ad the same time. ere ave. -canum bud “precuction rape 7% censomption rate inventory ¢o build up is used later which fs called os Simul fan €6 ooh — production -consumptien model . : Dorirg Ube period when built up faventory Fs esd the mic can be usted for producing some other items tp \ Prod. yale=P Tenge ersingnos Se 1 Predation © SS" Congumnption rate —¥ Toy. build up rohe = p-v Prod. line period = tp Q = tp xP —e tp = | —+@ an woe caf Tang) = te (R-7) Nouecnonsy) = e & fp-r : € (r) 2 pee Oe ec - cont) rn = © (p-+) or © 2P .Economic , pred. —~+~— bojch -« Lot size. re berg = foacsr (ex) A Cy Ga Shortage rt fast | iyo ceva ao) Purchee cost = AS Order cosh As 7 qr { TTetd Tec = Low, oer OT Total variable Y Aravel oo cost cost ~~ Ser 2 Shertage cost = S* 2, | om GE JPye Mo ee & Te el £Oq = 4G o)'« “3 (fcc) 2 8 (akenye ait) e € “Shortages also called _ bask ordore «| RSdadive inventory ~eatiat Aeebniqgaess —_*& = eT 8 4 A-BC analysis : 7 Td is called consumption onod yaie ‘ |comsumption = yy x mt : This ts based on concept vite) few to ‘trivial many“ 1 on fee thems, compared fo muttitugle of items Le concentrate available jo the stores oot sorevscsh ¥ YO woe ~ tie @& Procedure, for AGC analysis aaeeeenrart — OCk GOS af @) Collect data pertaining footy consumed & west pec und during fhe post years. - acon’ ® Colcwoke™ consumption volue arhich rs “qty x wit? ® Rank the tems In dlecending order af consumption value. ® Rewrite the items os per the ranks ley atin cansumpbie s voulus- © Daterew Cummetfative consumption value. © -- Zof f——_ y @ aeaitt ozo, of cummulative value of A Clos items e407. a S! < G pagCoptote) 107 ims - 707% cv => A_qreup ) Cemeooy yea feria ie oot nC hv meme ile ne ees (ors) JOY Hers Jo ay => c_qroup ae ——— oe Zo fox ABC aoalysi Palicy _ AL [ B | — Noe safely Stock — Modewate safely stock] = Very high safely ‘ stock, ~ Many supplies for. | Two or three = One of ture supp! . continucas supply & fo Suppliers campetetion in_price. Weekly ov fectriglly| — Bimonthly or quosterty| — Half yearly oF yea ~ ordens ordems orders un] — Stick OK \ ~ meclaate took) 10 cowhe\ ~ Controlled by top |~ Controlled by — Controlled by fox i Management middie. management level mgt ~ Rigourour value |= Moderate value | —-No value analys analysis analysis mph ABC analysis is elt aeamate weduce the amount mon blocked up in the form 1 of inventory, oo i Theme Cons value Nos of orders RS A 40006 4 4ooe 4 © 4400 4 light of AB« Examine Fhe above ordering peligy in the Hy _cnaylsis & comment on the resubksTheme WOM VAIN NOT Me Bes gies erdecnt LIE. inven greed Meteo A 4ovoo 44 100s “ooo. 9 | MANA 2222028 : 8 4000 4 L000 a 22800 tooe so Ho loo _ ~ a s By ad opting ABC, amount of money blocica the. form of inventory is reduced, CRITVCELITY GSBYUNIS + VED (Vitel Essertial Desirable veo (Vitel Essedia “ee — Used for molintnsiiefpents ~ cabled odeo criticality analysis. thems Tf they ore not avai blab's. 7 Vite} idea ore Those will came @ heavy loss ef produstion al g.giv clutch wire & gear wire foro re fo they ame not available Exsseatios . itens are those items of ——— will cause delay or_moderafe: east /rermci los eg se Head lights fo a scooter Desirable Hiems are those items TP thy ove nol awe table. eae will conse (he[ less \ of production: /rowoge f a seo ote eg colour 6