Qa ING THEORY Introduetion Queuing theory deats with problems that involve waiting (or queuing). It is quite common that instances of quene occurs everyday in our daily life. Examples of queues or long waiting lines might be > Waiting for service in bank and at reservation counter. > Waiting for a train or bus. ng at barber saloon. >» Wait > Waiting at doctors’ cti Whenever a customer arrives at a service facility, some of them usually have to wait before they receive the desired service. This form a queue or waiting line and customer feel discomfort either mentally or physically because of long waiting queue. We infer that queues from because the service facilities are inadequate. If service facilities are increased, then the question arise how much to increase? For example, how many buses would be needed to avoid queues? How many reservation counters would be needed to reduce the queue? Increase in number of buses and reservation counters requires additional resources. At the same time, cost due to customer dissatisfaction must also be considered. n= total number of customers in the system, both waiting and in service 4 = average number of customers being serviced per unit of time. average number of customers arriving per unit of time. e channels C= number of parallel ser Lor E(n) = average mumber of customers in the system, both waiting in the servic L, or E(m) = average number of customers waiting in the queueWor E(w) = average wating time of a customer in the system both waiting and in service W, or Efw) = average waiting time ofa customer in the queue P, (t = probability that there are n customer in the queue total cost of the system cost cost of service | cost of waiting optical service level of serviceThe customers arrive at ane or more servers. A ct sevice counter (single or in a group) and attended by stomer served leaves the system after getting the In general, a queuing system comprise with two components, the queue and the service facility, The queue is where the customers are waiting to be served. The service facility is customers being served and the individual service station. The service is provided by a service fa may be a person (a bank teller, a barber, a machine (elevator, gasoline pump), or a space (airport runway, parking lot, hospital bed), to mention just a few. A service facility may include one person or several people operating as a team. There are two aspects of a service system—{a) the configuration of the service system and (b) the speed of the service, service The customers’ entry into the service system depends upon the queue conditions. If at the time of customers’ arrival, the server is idle, then the customer is served immediately. Otherwise the customer is asked to join the queue, which can have several configurations. By configuration of the service stem we mean how the service facilities exist. Service systems are usually classified in terms of their number of channels, or numbers of server: The models that involve one queue — one service station facitity are called single server models where customer waits till the service point is ready to take him for servicing, Students’ arriving at a library counter is an example of a single server facilitneue Service Fa Customers Antivals, | ABO OO 2 Teave In this type of model there is more than one server and each server provides the same type of facility, The customers wait in a single queue until one of the service channels ready to take them in for set ing , Arivals: Queue ‘ |. Service Stations al, Parallel vers = Single Queue ModelThis type of model consists of several servers where each of the servers has a different queue. Different cash counters in an electricity office where the customers can make payment in respect of their electricity bills provide an exaniple of this type of model. Amvals Quenes —0000—>L_ + + —*O0CO0— I [customers —O00O0—*___k > —0000—___ + veral, Parallel $ Queues Model servers ~ Sever In this, @ customer enters the first station and gets a portion of service and then moves on to the next station, gets some service and then again moves on to the next station. .... and so on, and finally leaves the system, having received the complete service. For example, machining of a certain steel item may consist of cutting, turning, knurling, drilling, grinding, and packaging operations, each of which is performed by a single server in a series. Service Facility. Service Customers Arrivals Queue Queoe Facility Teave O00 + F000 + >In designing a good queuing system, it is necessary ta have a good Information about the model. The characteristic listed below would Pravide sufficient information, Arrivals can be measured as the arrival rate or the interarrival time (time between arrivals), Interarrival time =1/ arrival rate These quantities may be determinis propbabitity distribution). Arrivals may also come in batches of multiple customers, which is called batch or bulk arrivals. The batch size may be either deter ministic or stochastic. ic or stochastic (given by a (@ Balking: The customer may decide nat to enter the queue upon Arrival, perhaps because it is too long. (ii) Reneging: The customer may deci Waiting a certain time in it (it) Jockeying: If there are multiple queues in parallel the customers May switch between the (iv) Drop-o®s: Customers may be dropped from the queue for rea le to leave the queue afterSons outside of their control. (This can be viewed as a general- Isation of reneging.) As with arrival patterns, stochastic service patterns may be deterministic or There may also be batched services. The service rate may be state-dependent. (This is the analoge of impatience with arrivals.) Note that there is.an important di®erence between arrivals and ser- vices. Services do not occur when the queue is empty (ie. in this case it is a no-op). 4. Quene Discipline This is the manner by which customers are selected for service. @ First in First Out (FIFO). (ii) Last in First Out (LIFO), also called (iii) Service in Random Order (SIRO). ichemes are either: (iy) Priority Schemes. Priori Preemptive: A customer of higher priority immediately displaces any customers of lower priority already in service. The displaced customer's service may be either resumed from where it was left 0®, or started a nev Non-Preemptive: Customers with higher priority wait eurrent service completes, before being served.4. Parallel Queues: —> coo00000o—- [server 1] —> — + cococc000—-+ [server 2} —> — co000000—— |server 3| —= Single Queue: server 1] —— 7 —+ eoc000000—-> [server 2] —> s, server 3] —=> Customers are served by multiple servers in series. — cc000 —= [server 1]—~ ooc00 —- [server 2|—> In general, a multistage queue may be a complex network with feed- Back Queing theory has been applied to a great variety of business situations. Here we shall discuss a few problem s where the theory may be applied1) Waiting tine theory can be applied to be determine the number of check out counters needed to secure smooth and economic operations of its stored at various time during the day of a super market or a departnrental store. 2) Waiting line theory can be used to analyze the delays at the toll booths of bridges and tunnels. 3) Waiting line theory can be used to improve the customers service at restaurants,cafeteria ,gasoline service station , airline counters, hospitals etc, 4) Waiting line theory can be used to determine the proper determine the proper nuntber docks to be constructed in the building of terminal facilities for trucks &ships. 5) Several manufacturing firms have attacked the problems of machine break down &repairs by utilizing this theory . Waiting line theory can be used to determine the aumber of personnal to be employed so that thee cost of the production loss from down time & the cost f repairman is minimized. 46) Queuing theory has been extended to study a wage incentive plan 1) Most of the quening modets are quite complex & cannot be easily understood, 2) Many times form of theoretical distribution applicable to given queuing situations is not known, 3) if the queuing discipline is not in” first in, first out”, the study of queuing problems become more difficult.Customer:> (Arrival) The arrival unie that requires some services to performed. Queue:>The number of Customer waiting to be served. Arrivat Rate (4):>The rate which customer arrive to the service station. Service rate (u) :> The rate at which the service unit can provide sevices to the customer If Utilization Ratio Or Traffic intensity ie 2 Hu 2 /u> 1 Queue is growing without end. 2 /u.K (PIs Greater Than Equal To K) 9. What Is The Probability That More Than K Customers Are In The System (PKG da 10. What Is The Probability That Adeast One Customer Is Standing In Quie, I, What Is The Probability That Atleast Two Customer In The Syston (Guesiiow 1. Peopte arrive at a cinema ticket booth in a poisson distributed arrival rate of 2Sper hour. Service rate is exponentially distributed with an average time of 2 per min.Calculate the mean number in the waiting line, the mean waiting time , the mean number in the system , the mean time in the system and the uti factor? Arrival rate 3=25/hr Service vate p= 2/min=30/hr Length of Queue (Ly=27/ n(u- a) 5(30(30-25)) 4.17 persone Expected Waiting Time In Quie (W,)=2/ a(u-4) =25/(30(30-25)) =1/6 hir= 10 min Expected Waiting Time In The System (Wy = 1/ (u- A) =1/(30-25) =I/Shr= 12 min Urilization Ratio =1. /u =25/30 =0.8334 = 83.34%3. The management is prepared to recruit another grinding operator when the utilization of the machine inereases to 80%. What should the arrival rate of hobs then be? Solution: : Let us calcutate arrival rate and service rate per shift of 8 hours. Arrival rate A=8 shift Service rate 1=8x60/30=16 /shift 1. Percemage of the time the machine is busy Py =arrival rate/service rate=8/16=0.50=50% 2. Average time for the hob to be in the grinding section. he, average time in the queue system=w, w= TA ue A= V/16-8=18 sh =1/8x8=1 hour 3. Let 4 =arrival rate for which utilization of the machine will be 80%, Therefore, Py =2./ pt ie, 2” Py). ¢=0.80x16=12.8 per shift. (a) calculate expected number of persons in the system if average waiting time pf'a customer is 45 or more than 45 minutes . b)if service rate is same, lif arrival rate is same. fa)expected no. of persons in a system(Lj=iu- 2 ASMOS-45 =W4 =3/4=1/65~ 4. 251913QUeStON. Assume that at a bank teller window the customer arrives at a average rate of 20 per hour according to poission distribution Assume also that the bank teller spends an distributed customers who arrive from an infinite population are served on a first come first services basis and there is no limit to possible queue length. J.what is the vatue of utilization factor? 2.What is the expected waiting time in the system per customer? 3.what is the probability of zero customer in the system? Solution: Arrival rate 2=20 customer per hour Service rate x= 30 customer per hour 1.Utilization Ratio =2 He = 20/30= 2/3 -xpected Waiting Time In The System (W) = I/ (1-2) =1430-20) =1/10 hour = 6 min 3. Probability of zero customers in the system P, = 1—P =1-23=18 (Question 3 : Abc company has one hob regrinding machine. The hobs needing grinding are sent from company’s tool crib to this machine which is operated one shift per day of 8 hours duration. It takes on the average half an hour to regrind a hob. The arrival of hobs is random with an average of 8 hobs per shift. 1. Catculate the present utitization of hob regrinding machine. 2. What is average time for the hob to be in the regrinding section?(b)We I/p -A=1/65-45 =1/20 x60/1=3 mins, (ow, =1/ p- 2= 16-4 =34=1/ w45 =3 p-l35=4 =3 139 46.33 GuestiONZS In a factory, the machines break down and require service according to a poission Distribuation at the average of per day. What is the probability that exactly six Machines. Solution : Given d=4,0=6,1=2p Pint) = (6,4) when d=4 We know, p (mt) =G0ne-H/ a! (6,2) = (4%2)6 e-42/ OF =86 e-8/720 0.1221 Question 6 On an average , 6 customer arrive in a coffee shop per hour. Determine the prabability that Exactly 3 customers will reach in a 30 minute period, assuming that the arrivals follow poisson Distribution. Solution: Given, 4 = 6 customers / hour 1= 30 minutes = 0.5 hour0 N a we know, p(n) = (40)n e-2t/n! 16,2) = (6%0.5)2 e-6%0.5/2! = 0.22404 CRE tr a ber customers. On an average one customer arrives 12 minutes and each customer takes 6 minutes for getting served. Make suitable assumption, find with a single sever, there are two chairs for waiting @ The probability that an arrival will get a chair to sit on, i) The probability that an arrival will have to stand, and (ii) Expected waiting time of a customer. Solution following assumption are made for solving the given queuing problem : 1. The arrival rate is randomly distributed according to poission distribution, 2. The mean value of the arrival rate is 2 3. The services time distribution approximated by an exponiential distribution and a nmean rate of services is y. 4. The rate of services is greather than the rate of arrival (u>i) cipline id FIFO. 5. The queue diArrival rate 2= T2min or 5 customer / ltr Services rate = 6 min or 10 customer/ hr Mu= SHO= 4 there are two chairs including services one. @ The probality that an arrival get a chair to seat on is given by: P, (n<=2) = I- Py(n>2) 1-ju)* 1-(1/2) (ID) The probabi 1-(Potpr+PY -(7/8)= 1/8 =” that an arrival will have to stand is given by (DExpected waiting time of a customer in the queue is given by Wa =hutu-d) =5/10(10-5) = 1/(2*5) hr = 6 min (QieSti0NB A television repairman finds that the time spent on his jobs has an expontial distribution with a mean of 30 minutes, If he repairs sets in the order in which they came in, and if the arrival of sets follow a passion distribution approximately with an average rate of 10 per 8= hour day, what is the repairman’s expected idle time each day? How many jobs are ahead of the average set just brought in? Solution from data of problem, we have JOB=5/ set per hour; and =(1/30)60= 2set per hour (i) Expected idle time of repairmen each day Number of hour for a repairman remains busy in 8 hour day( traffic intensity) is given by (8) G/j)=(8) (5/8)= 5 hour Hence , the idle time for a repairman in an 8 hour day will be : (8-5) =3 hour Gi) Expected (or average) number of TV set in the systemES = pei = S/4/2-(5/A) =5/3 =2 (APPROX) T.V sets Question T Calculate expected number of person in the system. If average waiting time of customer is 30 min or more than 30 min , then services provider starts another windows . Calculate Arrival rate if service rate is same . Cateulate serviee rate if arrival rate is same. (answer; Ws=1/5 hr, 2 =134 ® 0 (OueSHON 2 At a certain petrol pump , Customer arrive according to a passion process with a average time at 5 min between the arrivals. The service time is exponential distribution with mean 2 mins on the basic of this information. Find out:- a. Traffic intensity 4, What would be the average quieting length? &. What is the expected number of customer at petrol pump? d. What is the expected number time one spend at petrol pump? What would we expected waiting time? Jf What would be the proportion time the petrol pump is idle? Answer a. 04 b. 0.26 . 0.66 4. 0.02 0.05 ft 06 Question3. The machines in production shap breakdown at an average of 2 per hour. The non productive time of any machine costs rs.30 per hour. If the cost of repairman is Rs.50 per hour. Cateulate: a. Number of machines not working at any point of tine. b. Average time that a machine is waiting for the repairman, c. Cost of non-productive time of the machine operator.d. Expected cost of system per hour, Answer, az: 2 machines b - 2B hours Rs. 60 d: RHO GueStiONG. in @ bank cheques are cashed at a single ‘teller’ counter. Customers arrived at the counter ina Poisson manner at and average rate of 30 customers /hour. The teller takes on an average, a minute anda half to cash cheque, The service time has been shown to be exponentially distributed 4) Calculate the percentage of time the teller is bus 4) Calculate the average time a person is expected to wait. Answer ast )6 minutes Questions Telephone users arrive at a booth following a Poisson distribution with an average time of 5 minutes between one arrival and the next. The time taken for a telephone call is on a average 3 minutes and it follows an exponential distribution. What is the probability that the booth is busy? many more booths should be established to reduce the waiting time l or equat to half of the present waiting time. Answer aO.6 b)w,=3/40hrs.(QWRSHOANG Assume that goods trains are coming in a yard @ 30 trains per day and suppose that the inter arrival times follow an exponential distribution . the service time for each train is assumed to be exponential with an average of 36 minutes if the yard can admit 9 trains at a time(there being 10 lines one of which is reserved for shunting purpose).caleulate the probability that the yard iy empty and find the average queue length. Answer 4248 H=H/16 75, P,=0.28 (OUSHON At what average rate must a clerk at a supermarket in order to ensure a probability of 0.90 so that the customer will not wait longer than 12 minutes ? It is assumed that there és only one counter at which customers arrive in a Poisson fashion at an average rate of 15/hour. The length of service by the clerk has an exponential distribution Answer: 2.48 minutes /service Question 8 The beta company ‘s quality control deptt. Is managed by a single clerk, who takes an average 5 minutes in checking part of each of the machine coming for inspection, The machine arrive ance in every 10 min, an the average one hour of the machine is valued at Rs 25 and cost for the clerkis at rs Sper hour. What are the average hourly queueing associated with the quality control department, Answer Rs 30 per hour GROUPS MEMBER NAME J. Shikha 2. Dayashankar Yadav 3. Suriender Singh Prajapati 4. Gaurav Gupta 5. Himanshu Saxena 6 Gauri Shankar Mishra 7. Pankaj Gangwar 8 Sanjeev kumar 9. Amit .kr yaday 10.Amit sinha