Q1, What is Queuing theory? Explain the elements of queuing system. Answer: Queuing Theory ___ Waiting for service is part of our daily life, We queve up at the payment counters in the bank, we wait to book train tickets at reservation counters, we line up for service in post offices, we wait (0 eat at restaurants, This waiting phenomenon is not free of cost. We cannot eliminate waiting without incurring inordinate expenses, ‘But, we can try to reduce the adverse impact of waiting to acceptable levels, The study of queues determines the measures ‘of performance of a queuing situation, including the average waiting time and the average queue length, among others, This information is then used to decide on an appropriate level of service for the facility. The result of queuing analysis may also be used in the context of cost optimization model, where the sum of the costs of offering the service and ‘Waiting is minimized. This means providing too much service capacity to operate the system involves excessive costs, and Not providing enough service capacity results in excessive waiting and all its consequences. ‘Queuing or Waiting line models enable finding an appropriate balance between the cost of service and the amount of waiting. Elements of a Queuing System : ‘The elements of a queuing system, (Arrival process (Gi) Service system (Gil) Queue structure () Arrival Process Classification of arivals from input population: {a) According to Size The size is the total number of customers that require service from time to time, The size may be assumed to be either infinite or finite Example % Finite Population Machines waiting for repair. Infinite Population Calls arriving at a telephone exchange. (b) According to Numbers ‘The customers may arrive for service individually or in group. Example Individually ~ Planes landing atthe airport “In groups — Families visiting hotels. (c) According to Time ‘Customers may arrive in the system at known regular times or they mij models are called deterministic and probabilistic models. (ii) Service System (a) Structure of the Service System ight arrive in a random way, The respective| um a ati caneat lilies "17 Ad soins Yauy-swoo-1suy 99 seu 90 ‘ua twaouaunuo9 ayp toy posdey> aun ayn $1 gum aotAr9g ‘pola aut 20: -1aquunu ay st a1e2 291AI9g * ‘un 39}u08 8 9 aged 914s 6 Ua4f st poplsord 2914228 240 YUN eoqnu0g jo peeds (@) ani j1 => Waiting line formed, service facility al busy, system fails eventually. ' ifA-S 4 => No waiting time, proportion of time service facility idle is 1% " a a. je Ps P Average utilization or traffic intensity. Thus, If p> 1 system would ultimately fail If SI system works and p is the proportion of time it is busy. Such deterministic nature of arrival and service is rare and may exist in highly automated plants ‘5.1.5 Probabilistic Queuing Model Q6. Givea brief account note on probabilistic queuing model, Answer : ‘The queuing model is widely used in probabilistic queuing model. The models commonly used under this classification are defined in terms of the arrival - service Process, number of servers and population type. The arrival distribution, in general follows the Poisson distribution and the service process follows the exponential distribution. There are other distributions that may be followed by the arrival and service process like erlang distribution, Types of Probabilistic Queuing Models (@) _ Poisson Exponential, single server model ~ Infinite population. (&) Poisson ~ Exponential, single server model ~ Finite population. (©) Poisson ~ Exponential, multiple server model — Infinite population, BAG Costanatysis Q7. What kind of cost analysis is done in queuing models? . Answer : The queuing model can be usefully employed in determining the appropriate level of service using the information provided by the model. Basically, two types of costs are involveg model, (a) Cost of serving (b) Cost of waiting. ided gives th These two costs when added gives the ju the queuing system. The objective of the system wine i have the least total cost. he Suppose, we have to reduce the cost of wa. Suppose, we have to re Pr. way out into increase the number of service proy dette ult in increase of cost of serving, § tc in turn, will r cost may increase. In order to reduce the total egg ft decrease the number of service providers, then thy aM becomes longer and cost of waiting increases, “8. Thus, ye find that as the service level (number of service Provides, changes, both the costs vary, thereby varying the total ey This cost behaviour is depicted in the diagram SOW beloy £ s Level of service Figure From the diagram, itis clear that as the level of sence increases, cost of waiting comes down and cost of serving increases. The total cost initially declines upto a point and then rises. The service level corresponding to the minimum Point on it is the optimal service level. 5.1.7 Queuing Model - Kend: Q8. Hows Kendall's notation used for representing queuing models? Answer : Therepresentation of queuing model, as given belo ‘was introduced by D.G Kendall and then by A.Lee. (a/c) : (de ca) Where, @ = Arrival distribution 4 = Departure distribution ¢ = Number of parallel service channels in the syst 4 = Service discipline © = Maximum number of customers allowed in system _/ = Calling source or populationLINE/COMPETITIVE STRATEGY MoDELS @ “Towing conventional codes are me Hombols a band d. and ‘b’ for gf”, = Markovian (Poisson) arrival or dep, M gistibution or departure generally used 5, =Erlangor ‘gamma arrival or service distribution 1 = General Independent arrival distribution Gs General departure distribution 1p = Deterministic inter arrival or service times for‘d’ FCFS = First come first served [cfs = Last come first served «gRO = Service in random order GD = General service discipline symbols for ‘e N =Finite number of customers in the system ze = Infinite number of customers in the system symbols for ‘f X’ Finite number of customers in the calling source. = Infinite number of customers in the calling source. Example (WE,/1) (FCFS) The above notation represents poisson arrival, elangian departure, single server, ‘first come first serve’ discipline, maximum allowable customers N in the system ‘a4 infinite population model 5.1.8 Managerial Applications of Queuing ‘ Model @®, What are the managerial applications of queuing models? Answer : _ Waiting line or queuing theory has been applied to Wide variety of business situations where customers are involved are likely to have waiting lines. _ Generally, the customer expects a certain level of Senice, whereas the firm providing service facility tries to leep costs minimum while providing the required service. Nanagerial Applications Some of the applications of queuing theory are as 1/20) '\ Manufacturing Units Tio ge termining the number of machines required etc. umber is determined in such a way that cost of waiting 60st of serving are leading to least total cost so that the SNA tates AL. Laut reduces. 5.7 2. Maintenance Determining the number of repairmen required 10 Tepair the breakdown machines which arrive randomly. The optimum number of repairmen will make the sum. of the cost of repairmen and cost of production loss from downtime, @ minimum, 3. Wage Incentive Plans ‘The efficiency to be exercised vary with’ machines and its types. The probabilities computed from queuing theory help in determining the base rate for such operations. 4. Harbour Determination of proper number of docks to be constructed (for trucks or ships) in such a way that sum of the dock cost and demurrage costs is minimised. 5. Parking Area Determining the size of the parking lot. 6. Petrol Bunk Determining the number of attendants required at a petrol station, 7. Airports Determining the number of runways at an airport 8. Hospitals Scheduling of patients who visit doctor in the hospital. 9. Supermarkets Determining the number of counters for payment by the shoppers. 10. Banks Determining the optimum number of bank tellers for bank transactions. 11. Computers Determining the requirement of CPU for handling the flow of computer programmes through a computer system. 12. Fire Fighting Determining the number of fire service equipments and fireman to handle emergency situations of occurrence of fires. 13. Theatres Determining the number of ticket counters to reduce the queue of theatre goers waiting to buy tickets. 14, Distribution Centres Determining the number of loading and unloading crews to handle the trucks that arrive to carry goods. 45. Telephone Exchange Determining the optimum number to handle telephone calls.OPERATIONS, x @ Poisson Arrival and _ Thmes with Infinite ay? Q10. State the assumptions of poisson exponential Also | P(n> ff } ‘single server model of infinite population. * Amewer : oer (4) (-*) The single server queue model is based on the H following assumptions, 5, Expected or average number Of Units in the gy, (System length). . _ {@) The arrivals follow poisson distribution, with a mean arrival rate of, say A. L, (©) The service time has exponential distribution, with aren ted or average number of units in the quay an average service rate of, say 41. 6. Expe (©) Arrivals are from infinite population waiting for service (Length of the queue). w (2) The customers are served on a First-come-first-serve es basis (FCFS basis). @ wha) (©) There is only a single service station. 7. Expected or average length of non-empty queue H ee 4 Wok The mean arrival rate is less than mean service rate. (g) The waiting space available for customer in the queue | O49 L, = Average length of all queues including empty is infinite ; The Kendall’s notation for model is, queues j (AEM) = (FCFS/a/a). L,, = Average length of non-empty queues only larkovian (Poisson) distribution. 8. Expected or average waiting time in system, Q11. State the formulae used in single server model with infinite population [(M/M/1):(FCFS/a/a)]. mien Answer : 9. Expected or average waiting time in the queue. ‘Single Channel Queuing Model (Infinite Population) a 1 Let, Wa u-h 4%, =Mean or expected number of arrivals pertime | 10, Probability that the waiting time in a queue is >t period (mean arrival rate). nt Mean or expected number of customers served Bivaiting times) = eet per time period (mean service rate). 1. Probability that the service facility is busy. SEBELEMS ON QUEUING MOREE a 1. Ina bank, eight customers arrive on an P= P= Utilization parameter average every 4 minutes, while the cashier can 2. Probability that the service facility is idle. distribution for arrival rate and exponential ; distribution for service rate. Determine, i (i) Average time a customer spends in the , ae system 3. Probability that there are ‘n’ units in the system. (li) Average time a customer keeps waiting" 2 line fee tol (iti) Average number of customers in th? 4, Probability that there are more than or equal to ‘k’ system (iv) Average queue length. units in the system i.e,, queue 2 “ SIA PUBLISHERS AND DISTRIBUTORS PVT. LTD, — _ean service rate, -25 customers per minute average Time a Customer Spends in the system = =4 minutes 0 aoe Time a Customer Keeps Waiting in ine 2.25(2.25- 2) W, =3.56 minutes Average Number of Customers in the System a i * (u-a) aaery = 8 customers Average Queue Length 2 <2 = 7.11 customers. 25(2.25-2) 2 The Taj service station has a central store where service mechanics arrive to take space parts. ‘The machines wait in queue if necessary and are served on FIFO basis. The store is mained by one attendant who can attend 8 machines in ‘an hour on an average. The arrival rate of the Mechanics averages 6 per hour. Determine Ls, Lg, Ws and Wq where the symbols carry their Usual meaning as per queuing model. (Model Paper-l, Q10(a) | July-14, Q6(a)) 9 The Taj service station hae a central tore where Service mechanics arrive to take spare parts for the Jobs they work upon, The mechanics walt Im quoue if necessary and are served on a first- Come-first served basis. The store is manned by one attendant who can attend 8 mechanics {nan hour on an average. The arrival rate of the mechanics averages 6 per hour. Assuming that the pattern of mechanic's arrival is poisson distributed and the service time is exponentially buted, Determine W,, W,, L, and L, where the symbols carry their usual meaning. Solution ; Ialy-11, 6a) Given that, Arrival rate of mechanics, 4. = 6 hour Service rate of the attendant, = 8 hour (1) Expected or average waiting time in a system (W,) * We = 0.5 hours (or) 30 minutes (i) Expected waiting time in a queue (w,) ge 44] = 0.75 [0.5] = 0.375 hours (or) 22.5 minutes (iil) Expected number of mechanics in a system (L,) 3 customers oR ath awa ba SSA PUBLISHERS AND DISTRIBUTORS PVT.LTD. a5.10 (0) Expected amber of mechanics ma queve (,) we vustomers (0) Average waiting time in system, w i) (aii) 30 minutes % “A Gepartmental store has a singie castier the rush hours, customers arrive at the fate of 20 customers per hour. The average fumber of customers that can be processed by the cashier is 24 per hour. What is the, (0) Probability that the cashier is idle? (i) Average number of customers in the queuing system? (ili) Average time a ‘customer spends in the system? (7) Average number of customers in the queues? (Average time a customers spends in the queue waiting for service? Solution : (Model Paper-IIl, 010(a)| Dec.-13, 96(a)) Given that, 20, 4 = 24 — Customers per hour (i) Probability that the Cashier is Idle 20 ~ 4 P, = 0,167 « 100 =I = 16.7% idle time of cashier, (il) Average ‘Number of Customers in the Queui System ie dise 2, bs H-A ~ 24-20 LS: =5~ Customers per hour. A PUBLISHERS AND DISTRIBUTORS pyr. inp, Solution ; "34-20 = t 2025 hrs 4 W, =0.25 «60 = 15: minutes (iv) Average Number of Customers in MeO Hh 4 Wu) 20° _ 400 ~ 2424-20) 96 L, = 4.167 ~ Customers per hour, (v) Average Time a Customer Spend in ty Queue Waiting for Service a ~ (ha) 20 20 © 2424-20) ~ 96 =0.208 hrs, =0.208 « 60 In a bank, cheques are cashed ingle ‘teller’ counter, customers arrive at the counte, in a Poisson manner at an average rate of 30 customers per hour. The teller takes on an average a minute and a half to cash the cheque. The service time has been foundtote exponentially distributed, ()) Calculate the percentage of time the tele is busy, (ii) Calculate the average time a customeris expected to wait, Aug /Sept.-13, Q6a) Given that, Mean arrival rate, 4 = 30 customers/hour 1 éle ” Bye- wo WAITING LINEICOMPETITIVE STRATEGY MoDets 5.11 pe probity hat the tellers busy fs given = @ 1-P A P=1- Which means that 75% ofthe time teller is busy a Theaverage time a customer is expected to wait 7p * ! hour oF 60 minutes. 1 (9 * 60 minutes W, = 6 minutes. 5 repairman is to be hired to repair machines which breakdown at an average rate of 6 per hour. The breakdowns follow Poisson distribution. The non-production time of a machine is considered to cost % 20 per hour. Two repairmen, Mr. X and Mr. Y have been interviewed for this purpose. Mr. X charges 7 10 per hour and he services breakdown machines at the rate of 8 per hour, Mr. Y demands & 14 Per hour and he services at an average of 12 per hour. Which repairman should be hired? (Assume 8 hours shift per day). Solution : Dec.-12/Jan-13, Q6(a) Case 1 For Mr-X Given that, ihe 4, = 8hhr Repair charges = 210/hr * Charges of Mr. X for 8 hrs is, 810-880, Cost of non-productive machines i given as, = Average number of machines in the system * Cost ‘of non-productive machine per hour * Number of hours 1,» Cost * Numbers of hours 3 a6 1, =3*20%8=€ 480 Total cost of Mr. X “ost of non-productive machine + Repair charges 180 + (10 = 8) = 480 + 80 = [ %560 Case 2 For Mr. ¥ Given that, 2 = 6h b= 12h Repair charges = & 14/hr charges of Mr. ¥ for 8 hours is, 8 14=8 112 Cost of non-productive machine is given as, = Average number of machines * Cost of non productive machiné x Number of hours =, « Cost * Number of hours We have, a 6 —?_ =6/6=1 je ee WA 12-6 L x 20 « 8 =2160 hours, Total cost of Mr. Y = Cost of non-productive machine + Repair charges 160 + (14 * 8) = 160 + 112 2 Since, the total cost of Mr. Yi less hence he should be hired for servicing. 6 A mechanic services four machines. For each machine the mean time between service requirements is 10 hours and is assume ' to form an exponential distribution, The repair time tends to follow the same distribution with mean of two hours. When a machine is down for repairs, the time lost has a value of € 20 per hour. The mechanic cost % 50 per day. (a) Whatis the expected number of machines in operation? {b) Would it be desirable to provide two mechanics each to service only two machines. ——______________ SIA PUBLISHERS AND DISTRIBUTORS PVT. LTD. |