“~ source or Po) Joving § pulati a ‘ coll F erates them. If ey © arrival une weirs il finite. are o, Pate; fh on) S aa be is aa are a aay a few pote of the customers depends UP ihe ost ally sal infinite. There jg «°° er of tial customers, the calling source “Fist gnite source exists When an Still another <1 Potential customers (say, over 40 OF For example, a battery crriv2l aff tte 12 {0 Categorising the source as finite ives : (om uation is concerned, Tuan, the probability of arrival ial Beton’ Z'aning machine arrival of potential ep" ential custor ot yg potential METS. As soon Machi fg0 enerate another ‘call unti ‘tea Machine brea oe = ated i finite source, as far as etl er down, the calling source fm the arrival of a customer q, TViced craic, it becomes a customer and a eS not affect fePaired). An infinite source is said to Tate of arrival of potential future Ms oth gomer’s behaviour: The custome oo " ’s behaviour ; customer decides not to enter th, aviour is , . f Ue enters the queue, but after aed since it is ers ery pe (i yee ae 0 OF more pas ime loses pati ng, he is said to have balked. a Vey are said to be jockeying Queues and f a RATING CHARACTERIS ove TICS OF A QUEUING SYSTEM A , ! js of a queuing system is ysis 0 m involves a study of its dit ic Y of its different operating characteristics. 2 eng (Lg) ~th reue len} -q) — the average number - " tis excludes the customer(s) being Son Sustomers in the queue waiting to get service. 2, Sytem length (Ls) — the average number of customers in th includi ‘raiting as Well as those being served, e system including those Waiting time in the queue (W,) — the a 7 . s the queue to get service. ° 'verage time for which a customer has to wait in 4, Total ine in the acer OD) in average total time spent by a customer in the system from the mom« e ives till he leaves the system. It is sei ohh plus the service time. a is taken fo be the waiting time 5, Uilization factor (p) — it is the proportion of time a server actually spends with the customers. It is also called traffic intensity. § WAITING TIME AND IDLE TIME COSTS ln order to solve a queuing problem, service facility must be manipulated so that an yum balance is obtained between the cost of waiting time and the cost of idle time. The cost of waiting customers generally includes either the indirect cost of lost business fuse people go somewhere else, buy less than they had intended to, or do not come again in tet) or direct cost of idle equipment and persons; for example, cost of truck drivers and soeat wating to be unloaded or cost of operating an airplane or ship walthg to land or dock. ts of lost business is not easy to assess. For example, vehicle drivers wanting petrol will ‘si pumps having Iong queues. To determine how much business is lost, some type of tation ion is required. me ite, period which they Fema guipment (service facilities), waiting time and ‘tes ae ‘easing e investment in it is desirable, then, to obtain the minimum sum of hy, usociated with it can be decreased. It 15 costs due to waiting. This optimum © costs: costs of investment and operation, on its requiring service and/or providing ss eleoss can be obtained by scheduling the low © ni flow of units may be scheduled ieaanter of facilities. If the facilities are not under cone “Tow is not subject to control, that ie the sum of uasitine time and idle time costs:ye Hospauoh » cya cot gent and pre! aan a bo contratle, one s0H nie the overall cost he omployed Whicl Mini ZA yyy, ne nehodule the IPUL AG Wel g. or Incroasod Sorvico —» Fig, 102, RolaonshipboMweonf¥0l of 20"CO ard Wang tng jonship between the level of service provigy level of service is increased (as more gery ta, iy, Fig. 10.3 illustrates the relati waiting time, tis observed that as th the cost of waiting time decreases. Cost of providing servico —> Increased Service —» Fig. 10.4. Relationship ‘between level of service and cost of Providing service. _Jn Fig, 10.4 is illustrated the relationship between the level of service op te providing that service. It is observed that as the level of service increases, s0 does Providing that increased service, 12 Fis: 105 the wating time costs added to the cost of providing service 10 else the total expected cost is minimum at a service level den! a Let = os _ ©XPected waiting cost/unit/unit time, em, “i s = expected (average) number of units in the 51S ~ Cost of servicing one unit. ie net tunit time (period) = C,... Ly = Cy ae yh. s Then expected waiting cost Service cost per unit time (period)Cost of providing service Waiting time cost s Increased Servi ico —» Fig. 10.5. Total cost of Operating service facility cilty. 5 a Total cost, C= Cw Hcy d siswill be minimum if 7 (C) = 0 —* +0,=0, which of IC aie Gr Gone 7S Or which gives w= A oma, oie that a plus and moana sien appear before the square root sign. A negative value of pt jot possible answer in real life problems. » given by the above equation is called minimum gamice Fate. ure 10.5-1 Consider a situation in which the mean arrival rate is one customer every 4 minutes and iynean service time is 24 minutes. If the waiting cost is Rs. 5 per unit per minute and the sim cost of servicing one unit is Rs. 4, find the minimum cost service rate. Salution 1 Her, A= 7 = 025. HaAe a = 0.25 + [sx028 = 0.25 + Jo3i25 = 0:25 + 0.56. t = 0.81 units/minute. (-: p= — 0.32 is not a feasible solution.) \Y TRANSIENT AND STEADY STATES OF THE SYSTEM ; (ting theory analysis involves the study of system's behaviour over tine, ifthe operating ises (behaviour of the system) vary with time, it is said to be in transient state, Usually Ines tasient during the early ie Of its operation, when its behaviour still depends i titial conditions (number of customers in the system) and the claps time. However, ie 82 behaviour or the steady state condition of the system which Is Me Spee aunt to be in steady state condition if its behaviour becomes independent 0 hi ora See aoe dy state is Teta cpor al Condition for reaching a stetly Ot ally, it should tend to infinity). However, ting gftation must be sufficiently large (theoretically, 1 also affect its state e.g., number "eunet® Sufficient condition as the parameters of the SYP Tt ing. g ‘| "at the counter of a post office within 15 minutes © c that the total elapsed time since the— Jess than aver stem eVentually settles down to 2 steady state 2m of queue will be same at any time. If the rates are not constzn 2 steady State, but it could remain stable. If the arrival rate is greater than csmnot attain a steady state (regardless of the length of elapsed time); iz Jength increases steadily with time and theoretically, it could build up to system is called explosive state. Evidently, imposing 2 limit oa (so that further arrivals are not accepted) automatically ensur or es are unstable for a limited time are common in practice— rush-how SfEc is en we shall consider the steady state analysis; transient and explosive states mathematical tools for analysis and will not be touched upon. 10.7 KENDALL’S NOTATION FOR REPRESENTING guste Monzts D.G Kendall (1953) and later 4. Lee (1966) introduced useful notation for ou. The complete notation can be expressed as (able) : elf). . where @= arrival (or interarrival) distribution, jeparture (or service time) distribution, umber of parallel service channels in the system, d= service discipline, x = maximum number of customers allowed in the system, f= calling source or population. s The following conventional codes are generally used to replace the symbols a 2... Symbols for a and b . a M = Markovian (Poisson) arrival or departure distribution (or ex interarrival or service time distribution), E,=Erlangian or gamma interarrival or service time dist: ; parameter k, GI= general independent arrival distribution, G = general departure distribution, D = deterministic interarrival or service times. Symbols for d FCFS = first come, first served, LCFS = last come, first served, SIRO = service in random order, GD = general service discipline. The symbols ¢ and frepresent a finite (N) or infinite (<0) number of customers in 2952 and calling source respectively. For instance, (MWE,/1) : (FCFS/N/sx) represents Poissoa 4 (exponential interarrival), Erlangian d js - el ved? iscit maximum allowable coopera” departure, single server, ‘first come, first served’ de ae © customers N in the system and infinite population model. 10. (CLASSIFICATION OF QUEUING MODELS e Various i ‘pes of queuing models can be classified as follows : (a) eect Queuing Models . Model I (Erlang Model) : Thi. 2 7 cols). This re !): This model is symbolically represented by (MM!) : Presents Poj. j (exponential service tim, ee amival (exponential interarrival), Poisso =, | singel server, first come, first served service disciple = | DetQu son and her, jut’ Population. Since the Poiss© . r 2 symbol Onential ieee OF them are denoted by the S¥™ = t ts @ aeners cl 'stributiog 0 it is a general ques houg| Nn. . f (ah of the quencing mode in ts Model is also represented by (M/MUI) = po! the ong, thus affecting ieee Persons deg the arrival and service rates depend itis oe the queue. arrival rate hilary. € may not join eee see ath OL: This model is re + Service rate is also affected by the uit: resented Mode el L except that th Fen od by (MIMI1) « ¢« nM nel! Seer service Aiscipling ie pg SRO) It is essentially the same 1 IV = . ‘Prese, S insetad of FCES. ode! a Verret Nted bp; city of the system is Himitea ©F finite, aD : (FCFS/N/~), In this model the odel V* This model is represented by (MM ‘© the number of arrivals cannot exceed N. s Wed source model. In this model they ra #(FCFS/n/M). It is finite-population or F potential CUSTOMETS avaiable to grad ee ‘lity of au arrival depends upon the number Model VI This model is represented y eosin cept that there are ¢ service channey, /M/0) + (FCFS/cc/s0). This is same as model Parallel. a 0 and can be ignored required for completion of a service ie., it is the time jg fevion, The mean service rate is the n ‘time a sng he service to be continuous througout the ae of ‘e time 1/p is the time Tequired to serve one customer. The» .d for service times is exponential distribution. It invotves d be noted that Poisson distribution cana, ce. It shoul ad ais ‘bility of the service facility remaining idle for some tng ‘¢ interval of continuous servicing, which can never jy Service time is between beginning o' customers served per unit of unit), while the average servic common type of distribution use‘ probability of completion of a servi applied to servicing because of the poss Poisson distribution assumes fixed tim in all services. : | ae earanicd rate p is also assumed to be constant over time and independent of number of units already serviced, queue length or any other random property of the system. Thus probaily that a service is completed between ¢ and f+ dt, provided that the service is continuous fa service and its = pdt. Under the condition of continuous service, the following characteristics of exponent] distribution are written, without proof : ; ec in time p= Probability of n complete services in time t= “—"y (104) Probability density function (p.d/) of interservice time, ie., time between two consecutive services =p. e™. (105) ree, 10.) Probability that a customer shall be serviced in more than time EXAMPLE 10.9-1.1 On an average, 6 customers reach a teleph i sphone booth every hour to make calls. Determit the probability that exactly 4 cust j i i ie i . {he proabiy tha exactly 4 exsomers wil reach in 30-minute period, assuming that arr Solution Here 2.= 6 customers/hour, 0 minutes = 0.5 hour, n : te a= 6x 0.5 “+ Probability of 4 customers arriving ds wae +s, i “© appendix B.1 for derivation of the expression(i wit ae a9 customers on the aver, Ss , pot ial distribution, what i em Seed by a cash If the service “spe more than 10 mi robability thay oer in an hour. Ifthe ser mit |e Mirate more vinutes Ea Nay [yal ner shall be free within 4 rane 2 customer 9 01 ) bee (a) Here # = 20 customersmhour, Un! : Og pability tng J 500857 fant 2) | eee ge [ee ability that @ customer Will be free yay. mi cease nee 8 ° tin 4 minutes im 264 = 0.736, al , “ __ EXERCISES 194 7 the costs associated with queuing system, Aly Ped optimum = Fi sation, the arrival rate is 2 | patonk ope i customers/mit fp sverage number of arrivals during 5 minutes. ility that no arrivals will as: ‘y The probability will occur during th a fia ig the next 3 {ye probability that at least one arrival will occur during i ees anal f a Fi ip Ive probability that the time between two successive arrivals is at leare 9 naigutes. (int. (2) mn =2x5=10. Bore* °© explain the concepts of optimum servicing UGNOU MBA June, 2007; Dec, 2006) Determine the following : = 3 ql nator is withdrawn from a stock of 80 items according to Poisson distribution at the rate of 5 inas per day. Detemine the following : (The probability that 10 items are withdrawn during the first 2 days. ()The probability that no items are left at the end of 4 days. (0 The average number of items withdrawn over a 4-day period. [PU.B.E. (C.Sc.) Dec., 2004) 82 Model 1. Single-Channel Poisson Arrivals with Exponential Service, Infinite Population Model [(M/M/I) : (FCFS/=/-)] Leus consider a single-channel s ith Poisson arrivals and exponential service time ss = system wit z “on. Both the arrivals and service rates are independent of fee ae of: customers pee line, Ari ? basis. e arrival rate A is les: Ree vals are handled on ‘first come, first served’ basis. Also Ss Vice rate pi. ; di . ‘lowing mathematical notation (symbols) will be use (waiting line + service facility) at time « er unit of time). , Pe f customers served per unit of in connection with queuing & = number of customers in the systen 1.= mean arrival rate (number of arty ‘aber H= mean service rate per busy serv time).