Waiting Situations

Service Centers Waiting Person Services

Clinic

Patients

Treatment

College

Student

Admission

Hotel

Tourist

Lodging and fooding

Waiting Line Theory

A queue (or a waiting line) is a line or list of customers who remain waiting for getting certain goods or services from service centre. A queuing theory deals with the analysis of queues and queuing behavior for finding solution to the problems relating to the optimization of the effectiveness of the defined functions with random times of arrival and servicing Objectives:
Minimizing the waiting time cost of the customers, Minimizing the service idle cost of the service centers

Types of Queuing System

Single channel system Multi-channel system Single queue with many service counter system Many queues with single service counter system Multi stage system

Assumptions of Single-channel System

Arrivals are served on a first-in-first-out (FIFO) basis Arrivals follow a Poisson probability distribution The service times follow a negative exponential probability distribution The mean service time is greater than the mean arrival time There is one channel The population is infinite The waiting space available for customers in the queue is infinite

Exponential Distribution
Exponential Distribution: We can analyze the time between successive arrivals to see if the times follow some statistical distribution. Usually we assume that the time between arrivals is exponentially distributed. When arrivals at a service facility occur in a purely random fashion, a plot of the inter-arrival times yield an exponential distribution = . Where e = 2.71828 Where to use (continuous random problem) are: height, weight, customer servicing times, time between arrival of planes landing on a runway and between customers arriving at a bank

Poisson Distribution
We can set some time length (T) and try to determine how many arrivals might enter the system within T. It is a discrete probability distribution. This distribution deals with the evaluation of probability of rare events such as number of accidents in a busy road, number of printing mistakes in a book, customers arrival at bus station etc. in these cases probability is not certain and is very small and number of trials are too high. = , = , , , !

Formulae
1. Utilization factor = The probability that the service facility is busy = =

2. The probability that the service facility is idle ( ) = 3. The probability of exactly n units in the system = 4. The mean number of customers in the system = 5. The mean number of customers in the queue = 6. The mean waiting time in the system = 7. The mean waiting time in the queue =

Example
At a certain saloon, customers arrive in a Poisson distribution fashion with an average time of 20 minutes between arrivals. The interval between services at the saloon follows exponential pattern and the mean time for the purpose comes to 15 minutes. In the light of this information, determine: a) The average length of the queue b) The average length of the system c) The time spent by a customer in the queue d) The total time spent by a customer in the saloon

Solution
= = = =

= =

a) The average length of the queue = =

= . customers =

b) The average length of the saloon system = =

= Customers

c) The time spent by a customer in the queue = = = =

d) The total time spent by a customer in the saloon = =