Queuing Theory

Single channel queuing Theory

Results from Arrvial Time & Random service time at a single service station. Random arrival time can be described mathematically with Probability distribution Possion Distribution : used for random arrivals where the service time exponentially distributed.

Models for arrivals & service time

A poisson Distribution is a discrete probability distribution which predicts number of arrivals in a given time. The mean arrival time is assumed to be constant over time and is independent of number of units already serviced, queue length or any other random property of queue.

Kendall s Notations
n: number of customers in the system ( waiting line + service facility ) at time t - mean arrival rate (no. of arrivals per unit of time) : mean service rate per busy server ( number of customers served per unit of time) dt: probability that an arrival enters the system in time dt

notations
1- dt: probability that no arrival enters the system within dt + higher order terms in dt : mean service rate per channel * dt : probability of one service completion between time t and t +dt time interval i.e within time interval dt. Pn: steady state probability of exactly n customers in the system

 Lq: expected ( average) number of customers in the queue. Ls: expected number of customers in the system( waiting +being served) Wq: expected waiting time per customer in the queue ( expected time a customer keeps waiting in the line)

notations
Ws: expected time a customers spends in the systems Ln: expected number of customers waiting in the line excluding those times when the line is empty. i.e expected number of customers in a queue that is formed from time to time

 Wn : expected time a customer waits in line if he has to wait at all. i.e expected time in the queue for non empty queue.

Formulae
Ls= /( - ) Lq= ( * )/ ( - ) Ln= /( - ) Ws=1/( - ) Wq= / ( - ) Pb= / Pi=1- / Pn={1-( / )}( / )n

Problem
Workers come to tool store room to receive special tool for completing a particular project assigned to them. The average time between two arrivals is 60 sec. And the arrivals are assumed to in poisson distribution. The average service time is 40 sec. Determine

problem
Average number of workers in the system including the workers being attended Average number of workers in the sysytem Average queue length Mean waiting time of an arrival The type of policy to be established. Determine whether to go in for an additional tool store room attendant which will minimize the combined cost of attendants idle time and the cost of workers waiting time. Assume charges of a skilled worker is Rs 4/hr.and tool room attendant is 75 paise/hr.

 = 1/60 per sec. = 1 per min. = 1/40 per sec = 1.5 per min. Expected number of customers in the queue: Lq = ( * )/ ( - ) = 1.33 Ln= /( - )= 1.5/1.5-1 = 3 workers Ls = /( - ) = 1/1.5-1=2 workers Wq= / ( - ) = 1/1.5 *.5= 1.33 min. Pi= 1- / = 1/3

 Ideal time cost of one allotment = 1/3* 8 *.75= Rs. 2/day. Waiting time cost of workers = Wq* number of workers/day*cost (4/3* 1/60) (8*60)* 4 = Rs 42.64/ day Waiting time cost is more than idle time cost so additional tool room attendant can be employed.

Problem2
Ships arrive at a port at an average rate of 8 ships per week and their arrival pattern follow poisson distribution. On an average 12 ships are loaded and unloaded with exponential distribution per week Find the chance that ship will straight way be berthed for loading and unloading and the proportion of time the berthing facility being used.

 The average queue length and the number of ships in the system The average time spent by the ships waiting in the queue and in the system The probability that there are two ships in the queue

= 8 ships / week = 12 ships/week Pb= / =0.66 Pi= 1- / = 1-0.66= 0.33 Lq= ( * )/ ( - ) = 64/48=1.33 Ls= /( - )= 2 Wq= / ( - ) = 1/6 Ws=1/( - ) = Pn={1-( / )}( / )n = 0.148