Queuing Theory or Waiting line Theory

Address the problem to Schedule arrivals of customers or provide facilities or both.

Customers arriving Queue or waiting line Service facility

Customers leaving

System

Characteristics of Queuing Models

1. Arrival distribution : (dam cs3) Inter arrival or time between two consecutive arrivals of customers. It may be equal interval, unequal interval or random arrivals . Most of the arrival rate ( )business operation follow poissons distribution 2. Service (Departure) Distribution : Pattern in which the number of customer leave the system. Time between two consecutive service or departure of customers, service rate (). This distribution is best described by Exponential probability distribution.

Characteristics of Queuing Models

3. Service channel : Single service or multiple service channel. Series or parallel. 4. Service Discipline : FCFS, LCFS, random or priority. 5. Discipline : FCFS, LCFS, random or priority. 6. Maximum no. of customers allowed in the system. : Finite or infinite 7. Calling source or Population : Finite When the arrival rate affect the future arriving customers, Infinite when it doesn't affect .

Waiting time cost and Idle time cost

Total Expected cost Cost of providing service Total expected cost of operating facility Waiting time cost

Increased Service

= +- SQRT(*Cw/Cf)
Cw = expected waiting cost /unit/time, Cf = Cost of serving one unit

Steady State system - When arrival rate < service rate , system attains steady state i.e its behavior becomes independent of time. Explosive State system - When arrival rate > service rate , queue builds up and soon queue length becomes infinity. Transient system - In early stages of operation, system behaviour vary with time, it depends upon the initial condition.

Illustration
Obs. No. 1 2 3 4 5 6 Queue Waiting Service Service Length time facility time of queue 0 10 0 45 9 31 None * * * * * 0 5 6 5 4 3 0 2 0 5 2 3 Avg. Waiting = 105/4 Of an arrival = 26.5 In non empty queue

None ** None ***** ** ***

Avg. Waiting = 105/6 Of an arrival = 17.5

Avg. Queue = 12/6 Length 2

= 17/6

Avg. no of customers in the system = ( (0+0)+(2+1)+(0+1)+(5+1)+(2+1)+(3+1)) / 6

Avg. time customer Spends in system = (0+0) + (10+5) + (0+6) +(45+5) + / 6

Avg Length of non empty queue = (2+5+2+3 ) / 4 =3

Kendalls Notation for representing Queuing Models

(a / b / c) : (d / e / f)
a = Arrival distribution b = Departure distribution c = No. of parallel service channel in the system d = Service discipline e = Maximum no. customers allowed in the system finite or infinite f = Calling source or population.

M Markovian(Poissons) arrival or exponential service/departure distribution Ek - Erlangian or gamma arrival or service distribution. GI, G, D e FCFS first come first served, LCFS Last come first served SIRO service in random order, GD etc

N or

e.g. (M/Er/1) : (FCFS/ / )

Model I (M/M/1):(FCFS//)
n = number of customers in the system ( Waiting line + service facility) = Arrival rate (no. of customers arrivals per unit of time) = service rate (no. of customers served per unit of time) t = probability of one arrival in time interval t. t = probability of one service completion in time interval t. P(n) = Probability of exactly n number of customers in the system. Lq = expected no. of customers in the queue/ length of queue. Ls = expected no. of customers in the system(waiting + being served) Wq = Expected waiting time per customer in the queue. Ws = Expected waiting/spending time per customer in the system. Ln = expected no. of customers waiting in a non empty queue. Wn = Expected waiting time per customer in the non-empty queue.

Utilization / Traffic intensity = /

P(0) = 1 / Probability of Zero no. of customers in the queue. P(n) = (/)n P(0), Probability of n no. of customers in the queue. Ls = / ( - ) , length of customers in system Lq = Ls - / , length of customers in Queue Ws = 1 / ( - ) , Expected Waiting time per customer in system

Wq = Ws - 1 / , Expected Waiting time per cutomer in queue

Ln = / ( - ) , Average length of customers of non empty queue

Wn = 1 / ( - ) , Avg waiting time a customer in non empty queue

Ex.1 A self service stores employs one cashier at its counter. 9 customers arrive on an average every 5 minutes while the cashier can serve 10 customers in 5 minutes. Assuming poissons distribution for arrival rate and exponential for service rate, find 1. Average no of customers in the system. 2. Average queue length. 3. Average time a customer spends in the system. 4. Average time a customer waits before being served. 5. Idle time for cashier in 8 working hours Arrival rate = 9/5 = 1.8 Service rate = 10/5= 2

1. Ls = / ( - ) = 1.8/ (2-1.8) = 9 2. Lq = Ls - / = 9 1.8/2 = 8.1 3. Ws = 1 / ( - ) = 5 4. Wq = Ws - 1 / = 4.5 Busy period / Utlization = 8 * / = 8*1.8/2 = 7.2 5. Idle time = 8 - 7.2 = 0.8 min.

Ex 2 . Worker come to tool store room to receive special tools to do their work. The avg. time between two arrival is 60 sec and the arrivals are assumed to be in poissons distribution. The avg. service time by tool room attendant is assumed to be 40 sec. Determine 1. Avg Queue length 2. Avg length of non empty queue 3. Avg no. of workers in system including the worker being attended. 4. Mean waiting time of an arrival. 5. Assume the charge required of a skilled worker Rs 4 per hr. and the tool room attendant Rs. .75 per hr. Justify whether to go for additional attendant