UNIT -IV QUEUEING MODELS Introduction: Waiting for service is part of our daily life. We wait at hotels, we queue up at the railway reservation counter and line-up for service in banks and the waiting phenomenon is not an experience limited to human beings alone jobs wait to be processed ona machine Aeroplanes circle in air before given permission to land at an airport. Cars wait atthe traffic signals and so on. Queues are formed, ifthe demand for service is more than the capacity to provide the service Queueing system: A Queueing system can be described as customers arriving for service, waiting if service is not available immediately and leaving the system after having been served. Characteristics of a queueing system: 1, Arrival (or) input pattem of customers 2. Service pattem (or) service mechanism of server. 3. Queue discipline 4, System capacity. 1. Arrival pattern: Since the customers arrive in a random fashion, therefore their arrival refers or inter-arrival time can be described intenms of probabilities ‘Mean antival rate > Poisson distribution, Mean= 2 ‘Mean inter-arrival rate > Exponential distribution, mean = Y 2. Service Pattern: ‘The pattem according to which the customers are served i.e , Distribution of the time to service a customer, Service time > Poisson distribution, Mean= Inter service time > Exponential distribution mean(@ Single Server Input Service Output (i) Multi servers Ss a Input Service a Output Input Service — Input Service Output 3. Queue Discipline: Itis the rule according to which customers are selected for service when a queue has been formed ‘The common queue disciplines are @ FIFO - First In First Out (Or) FCFS — First Come First Served. (@) LIFO —Last In First Out (Or) LCFS —Last Come First Served. (ii) SIRO ~ Service In Random Order (Or) Selected In Random Order. (iv) GD - General Service DisciplineThere are also priority schemes for selection 4, System Capaci In some queueing process, there is limited waiting space, So that when the queue reaches a certain length, further customers are not allowed to join the queue, until the space becomes available after service completion. Thus there isa finite limit to the maximum system size. Ifany number of customers are allowed to join the queue, we may say that the capacity is infinite. Customers Behaviour: ‘A customer generally behaves in four ways. (@ Balking—A customer may leave the queue, if there is no waiting space (i) Reneging - This occurs when the waiting customers leave the queue due to inpatients. (Gii) Priorities — In certain applications some customers are served before others, regardless of their order of arrival (iv) Jockeying — The customer may jump one waiting line to another Transcient state: A systemis said to be transcient state then its operating characteristics are dependent on time. Steady State: ‘The system is said to be steady state when the behaviour of the system is independent of time Let P,(t) denotes the probability that there are n units in the system at time t. Then the steady sateis limR, (=0 Kendall's Notation: ‘The assumptions made for the simples queueing model is (aoc) (dle) where a=Probability distribution of the inter-arrival time b=Probability distribution of the service time. c=Number of services in the system. d= Maximum number of customers allowed in the system. = Queue discipline Notations and Symbols: ‘The following notations and symbols will be used in connection with the queueing systems.‘n= Total number of customers in the system, both waiting and in service A= Average mumber of customers arriving per unit time = Average number of customers being served per unit time C =Number of parallel service channels (servers) L, (or) En) = Expected or average number of customers in the system, both waiting and in service [Z,=£@,)] Z, (or) E(M) = Average or expected number of customer in the queue (excluding those who are receiving service) [Z, = Z0V,)] W, (Or) E.(IW,) = Average or expected waiting time ofa customer in the system both waiting and in service (Including the service time). WW, (Or) E.(IV,) = Average or expected waiting time of a customer in the queue, (Excluding service time) P(t) =Probability that there aren customers in the system at any time t (both waiting and in service) assuming that the system has started its operation at time zero, p = Traffic intensity or utilization factor, which represents the proportion of time the servers are busy a H P, = Steady state probability of having n customers in the system. MARKOVIAN MODELS: Birth and Death Queueing Models: @ (MIMD: ( | FIFO) @) (MIMIC): (© | FIFO) Gd) (MIMD: KFIFO) Gv) (MIMS): (KFIFO) ‘Where M stands for Markovian Model MODEL -I Single Server Poisson Queue Model - I:(MIMI : [9 | FIFO} Let 2 and , be the values of the steady state probabilities for Poisson queue systems. a aa (3) u Where A, is the probability of system being idle. (ie). No customers in the queue. ay Ae () Po He @ Average number L, of customers in the system: Let N denotes the number of customers in the queueing system Then the values of Nare 0,1,2,3, L,=8(N)= aAu a HU-A BHA HHA (i) The average number Z, of customers in the queue or average length of the queue: Let N denotes the number of customers in the queueing system. Then the number of customers in the queue is (N-1) 4-20-=Fo-Dry =So-n(4) (2 EDD (Bsr(ii) Average number Z,, of customers in the non-empty queues Since the queue is non-empty, the number of customer in the system must be atleast 2, one in the queue and one being served. Ly=E (WD P@-1)>0) E(N-1) _ B(W-1) “PLGV=1)> 0] P[w>i] _ Lg _ a 1 “P(N>1) uu-A) Z 2A 2 1-_?_# HERD (iv) The probability that the number of customers in the system exceeds K: mre bead aoe" sea JO | Ma P(NDK)= (2) zu Little's formula for (MIM|D;:[ | FIFO) Model: = ABW) [-Es)= 25] # re = (FO) ze tM) be 80) = 2) ip BO) = BON) += ww) BQ¥,) = Br) +=FORMULAS 71 = Mean anrival rate ‘Average number of customers arrivals per unit time D_| j= Mean service rate per channel I = AIT] 3 |p = Traffic intensity or utilization factor 4 ‘Expected number of customers in the system 3 Sxpected number of customer in the queue 1 * H(H=A) 6 Expected time a customer spends in the system 1 1 uaa T_| i, = Expected waiting time per customerin the queue a He A) 8 | P, = Probability of having zero customers in the system R=l-p 9 | P = Steady state probability of havingn customers in the A= (1-p)e%.n=0,1,2,...0 system * Re (3) R H 10 | NeMaximum number of customer pemnitted inthe system | N-I=Number of customer in the queue IT] @ P{WEn] = Probability of queue length being greater - PINSn|=—" than or equal ton (i) PIN >n]=Probability of queue length being greater PIN >n]=o"" than n. 12 | P(w) = The probability density function of the waiting ime in the system. PU) =(u- Der™ 13] POW, >t) = The probability that the waiting time ofa customer in the system exceeds t PU, >1)= 14| 1, = Average length of the non-empty queue. Queue formed from time to time 15 ‘POW, >t) = The probability that the waiting time ofa customer in the queue exceeds t Total number of customer in the system both waiting and serviceProblems based on (M/M/1): (c0/ FIFO) Model 1. Customers arrive at one-man barber shop according to a Poisson process with a mean inter arrival of 12 min. Customers spend an average of 10 min. in the Barber's chair @ Whats the expected number of customers in the barber shop and in the queue? (i) Calculate the percentage (%) of time an arrival can walk straight into the barber's chair without having to wait (ii) Howmch time can customer expect to spend in the barbers shop? (iv) Management will provide another chair and here another barber, when a customer's vaiting time in the shop exceeds 1.25h How much must the average rate of arrivals increase to warrant a second barber. (¥) Whatare the average time customers spends in the queue? (vi) Whatis the probability that the waiting time in the system is greater than 30 min? (vii) Calculate the percentage (%) of customers who have to wait prior to getting into the barber's chair (viii) What is the Probability that more than 3 customers are in the system? Solution: Given: One man barber shop > Single server. Customers + infinite capacity. The given problem is (MIM/)° (9 FIFO) Model Given: Mean 2 minutes => Anival rate= 2 minutes, 12 1 And service rate= 41 = 7 minutes (O@) To find the expected number of customers in the barber shopL, = 5 Customers (b) To find the expected number of customers in the queue (i) To Find P[A customer straightly go to the barber's chair} P [No customer in the systent] = R 1 AG 1 The Percentage of time an amival need not wait = =*100=16.67 (ii)To finda customer expected time to spend in the barber's shopW,=60Min (or) thr (iv) To find a customer's waiting time in the shop exceeds 1.25 hrs: W, >1.25hrs >I, > 75 Min [1.25 s=75 min) Hence to warrant a second barber, the average arrival rate must increase by BLD ermin 150 12 300 (v) To find the average time customers spend in the queue 7 A "TD (a)4 t w(t) W, =50minutes (vi) To find the probability that the waiting time in the system is greater than 30 minutes Pi,>t] WKT P[W,>the™ P[Ww,>30]-e1* =e") P[t, >30] = 0.6065 (wii) To Find P[a customer has to wait) P[w >0]=1-P[Ww=0] P[W >0}- 2 ‘The Percentage of customers who have to wait = —*100=83.33 (vii) To find P [More than 3 customers in the system] ie. P[W’>3 } ma WKT PLN>7] 3 iz wr) God P[N>3] = 0.4823Automatic car wash facility operates with only one bay cars arrive according to a Poisson process, with mean of 4 cars per hour and may wait in the facility's parking lot ifthe bay is busy. Ifthe service time forall cars is contact and equal to 10 minutes Determine Z,, L,,W, and, Solution: Given: one bay — Single server Cars — infinite capacity. The given problem is (M/M/1): (c0/ FIFO) Model. Given: Mean arrival rate= =4 cars per hour. ‘Mean service rate= {1 = 6 cars per hour 10Min= +*60=6>rs 10 (@To find Z, res 2 cars (i) To find Z, L, =1.333 cars (ii) To find 7,66-4) 6*2 Hence, @L,= 2 cars @) L, =1.333 cars caw, —Lhows 3. Customers arrive at the first class ticket counter ofa theatre ata rate of 12 per hour. Thereis one clerk servicing the customer's at the rate of 30 per hour (@® What is the probability that there is no customer at the counter? (i) What is the probability that there are more than 2 customers at the counter? (ii) What is the probability that there is no customer waiting to be served? iv) What is the probability that a customer is being served and nobody is waiting? (v) Probability that a customer has to wait for at most 4 minutes in the queue? Solution: Given: one clerk — Single server Customers > infinite capacity. The given problem is (MIMI): (¢0/ FIFO) ModelGiven, Mean arrival rate= = 12 per hour. ‘Mean service rate= 41 = 30 per hour. (To find P [There is no customer at the counter]: 18 R=06 (i) To find P[There are more than 2 customers at the counter]: P[V>2] ~ WKT P[LN>n] (3 iz = 0.064 P[N>2]= 0.064 (ii) To find P (There is no customer waiting to be served] (There is at the most one customer in the counter] = P[”<1] =P) + Rael) [a - a(3)] H, -2(} -a(4f [2-06] - Lb = 0.) +0 o(¥) =06+024 P[nsi]=0.84 Gv) PIA customer is being served and nobody is waiting] P[Thereis exactly one customer in the system who is being served):-4(2) (ZJee)-0(00) R=0.24 (v) To find P[n customer has to wait for at most 4 minutes in the queue}: P{W, <4Min |= alm si] A sir, A Ae 30 eS =1-@4)e# = 0.1205 P[IW, <4Min |= 0.8795 4. Customers arriving at a watch repair shop according to Poisson process ata rate of one per every 10 minutes and the service time is an exponential random variable with mean 8 minutes. (@® Find the average number of customers Z, in the shop. (i) Find the average timea customer spends in the shop 17, (ii) Find the average number of customer in the queue Z, iv) What is the probability that the server is idle? Solution: Given: Watch repair shop — Single server Customer = Infinite Capacity. ‘The given problem is (MIM|1) :(co| FIFO) ModelGiven: Mean = 10 min i a > Anival mte= 2= ‘And service rate= unk (To Find the average number of customersin the shop L, W,=40 minutes ii) To find the average number of customer in the queue L,(iv) To Find the Probability that the serveris idle: P, dxse 10 1 5, 1 t 5. Amival ata telephone both are considered to be Poisson with an average time of 12 min between one arrival and the next. The length of a Phone call is assumed to be distributed exponentially with Mean 4 min. (® Find the average number of Persons waiting in the system (i) What is the Probability that a person arriving at the booth will have to wait ii) What is the Probability that it will tale him more than 10 min altogether to wait for the Phone and complete his call? (iv) Estimate the faction of the day when the Phone will be in use (v)The telephone department will install a second booth, when convinced that an arrival has to vait on the average for atleast 3 min for Phone By how much the flow of arrivals should increase in order to justify a second booth? (vi) What is the average length of the Non-empty queue that Forms from time to time? Solution: Given: Telephone booth —> Single server. Customer s = Infinite Capacity ‘The given problem is (MIMI1) :(o| FIFO) Model Given: Mean 2:min 1 a = Amal te= 2= 7 And service mte= j= F (To Find the average number of Persons in the system Ls(i) To Find P[The Person arriving in the booth has to wait]: P[N > 0] PIN > 0]=1-P[n=0} —P[no customer in the system] (ii) To Find A Person tales more than 10 min to wait and complete his call ie, P[w > 10} WKT. Plw>t]=e"" Plw>10]=e FP = Plw >10]=0.1889 (iv) To Find P [The Phone will be in use} P[Phone in use] =P[Phone in busy) = 1-P[Phone inidle] a-n=rf-4) Hw, P[Phone in use] = ; BIS (v) To Find the second Phone will be installed, ifan arrival has to wait on the average for at least 3 min for Phone [ W, >3]W,>3 a >—_>3 Mu A) SA>3(uu-D) A>3pe-3pa A+ 3pa>3ye 2 as3{L)asaft 4 4 a(3)a(Z) 4 16, A> 28 Hence the arrival rate should increase by,6. Ina railway Marshalling yard, goods trains arrive at a rate of 30 trains per day. Assuming that the inter —arrival time follows an exponential distribution and the service time distribution is also exponential with an average 36 minutes. Calculate the following @) The Mean size queue. i) The Probability that the queue size exceeds 10 ii) If the input of trains increases to an average of 33 Per day what will be change in the above quantities? Solution: Given: A railway Marshalling yard —> Single server good trains = Infinite Capacity The given problem is (MIMI1) (00 | FIFO) Mode! Given: Mean arrival rate= 2 = 30 trains per day ‘Mean service time = 36 minutes. Mean service ate= po= £ 69) - somains per day (To find the Mean queue size. L, R "WT Mu A) (30)? 900 900 40(40-30) 40x10 400 25 = 2 trains (H) To Find P[The queue size exceeds 10] (or) P[N=10] WET P[W2n]= (Joye Piw>i0]-(32) (2 a0) “3 P[v=10]=0.056 (di) To Find if the input of trains increases to an average of 33 per day. Here, 1-33, u=40 @To Find Mean queue size: 2 uu A) (33° 1089 900 40(40-33) ~ 40x7 ~ 280 = 3.889 1,=4 trains. Change in queue size = 3.889 - 2,25=1.64 = 2 trains (b) To Find P[The queue size exceeds 10] ie, P(N=10) P(N>10)= @y P(N210) =0.146 Change in Probability = 0.146 - 0.056 =0.09. MODEL - II ‘Multi server Poisson Queue Model - II [M/M[J]:[<0| FIFO] (@The value of % and P,The Probability of zero customers in the system F, Where 2 isidle The Probability of Poisson Queue system Fis, 1 43) R If0snse H a=(3) R Ifnze cei (i) The average number of customers in the queue: 2, waa clea. ay cH, ‘Where C is Multi server or Number of server (ii) The Average number of customers in the system Lgea 1i(a 1 a w,-++{4) + 2.4 . 44) 2 OE H (v) The average timea customer has to spend in the queuel7, 1-4 cH yo y, 4) 1 Acie ( a ) (vi) The Probability that an arrival has to wait (or) The Probability that there are C or more customers in the system. PW? (a) Yt Rf PO, >0)= Pw20)] 3 (vii) ) The Probability that an arrival has to get the service without waiting P(Getting the service without waiting) = P(System is idle) —P(Amival has to wait) (i) i war c (: - 4) ou (viii) The Probability that someone will be waiting: ce cle PW >< (Ed The Mean waiting time in the queue for those who actually wait (17, | IV, > 0)1 27 IF, >0)= (@) The Average number of customers (in non-empty queues) who have to actually wait: (ai) Traffic intensity (or) utilization factor = p= oa Problem based on (M[M|C) :(c0| FIFO) Model: 1. There are 3 typists in an office. Each typist can type an average of 6 letters per hour. If etters arrive for being typed at the rate of 15 letters per hour @) What fraction of the time all the typists will be busy? Gi) What is the average number of letters waiting to be typed? iii) What is the average time a letter has to spend for waiting and for being typed? iv) What is the Probability that a letter wall tale longer than 20 min waiting to be typed and being Typed? Solution: Given: 3 Typists = Multi server Number of letters => Infinite Capacity ‘The given problem is (MIMIC) :(0|FIFO) Model: Given Amrival rate= A = 15 per hour Service rate= 1 = 6 per hour Number of server=C =3 ToFind 2 £994)(To Find P[AII typists are busy] ie, P[V23]3 PIV23)= () (0.0499) (0.0499) 18, P[N=3]=0.7016 (i) The average mumber of letters waiting to be typed: 1aay" 4 | clea, ray wa Lis 1 =| —— 0.0499) (3) By : a 2, =3.5078 (ii) To find the average time a letter has to spend for waiting 7,WKT Lg= lt (6.0078) =0.4005 hours = 0.4005x60minates W, = 24.03 = 24 minutes. iv) To find the probability that a Letter wall tale Longer than 20 min. waiting to be typed: WKT (2) cerns ) Ali) 4% 2. A Supermarket has two girls attending to sales at the counters. Ifthe service time for each customer is exponential with Mean 4 minutes and if people arrive in a Poisson fashion at the rate of 10 per hour @_—_ Whatis the probability of having to wait for service? (i) Whats the expected percentage of idle time for each girl? (ii) Find the average queue Length and the average number of units in the system?Gv) Ifa customer has to wait, what is the expected length of his waiting time? Solution: Given: Two girls — multi server Customer —> Infinite capacity ‘The given problem is (MIMIC): (co |FIFO) mode: Given: Arrival rate = 2 = 10 perhour = =4 minutes Service time Servicerate = = =15 perhour ‘Number of server=C ToFind 7 Sala) alt) ( +a[4 cia 2x15 205)=10. “Enls) 209) Go 15 2 201 613 4% @ To Rnd PTA customer having to wait) PIN> 2}: WKT PINZC] P[N=c]= (i) To find expected percentage of idle time for each gil: Fraction of time that a gitl is busy Fraction of time when a git! isidle =a Percentage of idle time for each gitl = —x100 = 67% 3 Gi) (@) To find average queue length in the system: 135 15” 12x15 12x15 1-3 7 (iv) To find the expected length of his waiting time (17, | IV, > 0)BOY, |r, >0)-— Chuva —t ed hour 2x15-10 20 x 60.Minutes 20 EW, |W, > 0)=3 minutes 3. A petrol pump station has 4 pumps. The service time follows the exponential distribution with a mean of 6 min and cars amrive for service in a Poisson process at the rate of 30 cars per hour. @ — Whatis the probability that an arrival would have to wait inline? (i) Find the average waiting time in the queue, average time spends in the system and the average number of cars in the system. (ii) For what percentage of time would a pump be, idle on an average? Solution: Arrival rate = 2 =30 per hour Service time =— =6 minutes Servicerate =. = © =10perhour Number of server = To find Rago te 1f(a cy wa a chu Cu-A 1 1 (2) 1 @)( 4x10 ) Senilio) “aU0) \axao—@ 7 AE BL (3 10x4. (972 oa( 10) 53 40 _& 53 = 0.5094. (i) @ To find the average waiting time in the queue” 17, W, att ' clack eal 1a (3) 13 1-4 " ue.“14 2" 4130x400 1 11 as min? W, = 0.0509 hours W,= OSminutes (b) To find average time spends in the system: I, Lay ciel ( ° La). 30 4140, 1 24@) BS ( 05 Minutes| =0.1509 hours W,= ) To find the average number of cars in the system: L, veay"_1 na ciel 7° 4) # ChLys 30 a@?) es a = 4.5283 cars 2, = 45283 cars (it) __ To find the percentage of time a pump isidle 30 P(A pump is idle) i a CH 1 a 3 a Percentage of time a pump is idle =A x10 = 25% a ‘Model-IIT server, Finite c Poisson ‘Model-I: JF IFO) @ ~~ Thevalue of Rand P, ‘The probability of Zero customer inthe system 'F, is) 12 Hu a Of A A 1-]=— ° @) a Ifh=u kei Where 2 isidle The probability of Poisson queue system P, isIfleu — Ifl=u (i) The effective arrival rate: 2 wou-R) (i) PA customer tumed away}: Py t Re () z z (iv) The Average number of customers in the system L, 8 eof? -|—““-} faeu ' ( ) z Ifa=u (¥) The Average number of customers inthe queue: L, (vi) Theaverage time a customer has to spend in the system: 17, (vii) Theaverage time a customer has to spend in the queue: 17, L, 4 Was (viii) Traffic intensity (or) Utilization factor: a p= zuProblems based on (M[M[I) : (K|FIFO) Model: 1. Patients arrive at a clinic according to Poisson distribution at arate of 30 patients per hour. The vwaiting room does not accommodate more than 14 patients. Examination time per patient is exponential with mean rate of 20 per hour. @ Find the effective arrival rate atthe clinic. (a) Whatis the probability that an arriving patient will not wait? (ii) Whats the expected waiting time until a patient is discharged from the clinic? Solution: Given: A clinic + Single server Patient finite capacity ‘The given problem is (MIMI) : K[FIFO) Model Given Amival rate = 2 = 30 perhour [- A+ 41] Service rate 20 per hour Finite capacity =ke= capacity of the system = [14 waiting patients + Ipatient in service] =14+1 a5 To find F 1-2 7 Ren [ee] ( (3) } 1-(4 # 30 32 30)" er 1-(— 1-{2 20. 2, -—25_- 0.00075 655.84‘P,=0.00076 @ To find the effective arrival rate at the clinic The effective arrival rate = 2'= u(1-) = 20(1-0.00076) =20(0.99924) =19.98 20 Per hour (i) To find PCA patient will not wait): 2=0.00076 (Gi) To find the expected waiting time until a patient is discharged: [W7, ] To find L, WKT T,=1302 Expected waiting time =_ 13.02 20 = 0.651 hours = 0.651 x 60 minutes 39.06 Minutes W, = 39 Minutes 2. “Ata railway station only one train is handled at a time. The railway yard is sufficient only for 2 trains to wait, while the other is given signal to leave the station. Trains arrive at the station at an average rate of 6 per hour and the railway station can handle them on an average of 6 per hour. Assuming Poisson arrivals and Exponential service distribution find the probabilities for the ‘mumbers of trains in the system. Also find the average waiting time of new train coming into the yard. If the handling rate is doubled, how wall the above results are modified? Solution: Given: A railway station — Single server Train + Finite capacity The given problem is (MIMI) : (K|FIFO) model Given: Amival rate= = 6 perhour[~ Service rate= 4 = 6 per hour Finite capacity =k=3(-> trains + 1 train = 3 trains) To find 2 z 1 Be phim 123 1 Kel @ To find P [The numbers of trains in the system] L,(i) To find the average waiting time in the station ofa new train coming in to the yard: W, = 20minutes (ii) To find if the handling rate is doubled: ie, Service rateis doubled =/= 2x6=12 To find Fy@ To find 2, el (aj) _ (K+1)(A/us) Gin) 1 (aj el 1 (3+1)(6/12) STE) ae (6/12) 1-(6/12) 1, =0.7333rain (b) To find 17, w-% a Tofind 2" A= ull-2) -(-3) 15, 5.6 per hour 7, = 2 = 2 B33 sthow a 56 =0.131260 minutes =7.86 minutesW, =7.9minutes MODEL-IV Multiserver, Finite capacity Poisson queue model-IV (MIMIC): (K|FIFO) @ — Thevalues of % andP, ‘The probability of zero customers in the system is —___ 1 Gia a) se uc, ‘The Probability of Poisson Queue system P,, is (4) B fornsC nig L. 0 porn>K 1 (ay . Be 4 Cens 2 a=(4)2 forc(C-n)R] a (Wii) Traffic intensity (or) Utilization factor ue Problems based on (M|M|C) : (K|FIFO) model: 1 A 2person barber shop has 5 chairs to accommodate waiting customers. Potential customers, who arrive when all 5 chairs are full leave without entering barber shop. Customers arrive at the average rate of 4 per hour and spend on average of 12min in the barber's chair compute BBP, Land W, Solution: Given: Two person barber shop—> Multiserver Five chair > finite capacity The given problem is (MIMIC): (K|FIFO) model: Given: Arrival rate= 1=4 per hour 1 Inter-service rate=— =12 min H dept et nS Service rate=/ =5 per hour Finite capacity -K=Capacity of the system =>K=542c=2 @ — Tofind % Q-Se 65984) 5)" 35 “3827872 R=0429 @) Tofind R wxt p= 1{4) pgrnse n\nGy ww 14y Putn=1, Re o{=] 429) f-1<2] 4 =(2) 429 (ew R =03432 To find P, wet a= —he(4) a ercense ~ cieee) ~ , 14 Putn-7, B= 5 (3) (0.429) [2-06-96] = onl) teas (oe = (0.429X(0.64)(0.5556)[1-0.0102-0.030)o =0.1463 LE, =0.1Scustomer To find 17, = 52= (2(0.429) + (0.3432)] A = 3.994 To find L, z L=L+e dy tT = 0.154994 =~ osa8 L, = 0.95customer —o95 3.994 2376 hours =0.2376x60minutes W, =14.256minutesA car servicing station has 2 bays where service can be offered simultaneously. B ecause of space limitations. Only 4 cars are accepted for servicing The amival pattem is Poisson with 12 cars per day. The service time in both the bays is exponentially distributed with {1 = 8 cars per day. Find the average number of cars in the service station, the average number of cars-waiting for service and the average time a car spends in the system Solution: Given: Two bays—> Multiserver Four cars —> finite capacity The given problem is (MIMIC): (K|FIFO) model: Given: Arrival rate= 2= 12 per day Service rate=/ =8 per day Finite capacity -K=Capacity of the system. aK Number of servers=C=2 ™)@ aii) 1 1 2.54+1.125(2.3125) 5.10156 R= 0.1960 To find the average number of cars waiting for service in the queue L, af eof-S] Jo] -ove() 24}-(9 -o(99)] -ovo(J 7-3-3] “UE = (0.1960) (2.25\(6)[1-0.5625-0.28125] = 2.646x 0.15625 =04134 E,= 0.4134 To find the average number of cars in the service station: L,@) z L,=1,+5 oe To find 2 co A=ulc- ze mA) a =82-DC-z] a 1 =82-Ee-mal 820K +1. AY) 82-(2x0.1960+0.294)] (1.314) a =10.512 a Late Eu = 041342 OP oaiseet 314 L, 14 21.73 To find the average time a car spend in the system 17, W, 1 a Lin “10512 0.1643day =0.1643%24 hours W, = 3.94 hours