A. Steps in Queuing Analysis
A. Steps in Queuing Analysis
A. Steps in Queuing Analysis
Queue Structure is the crucial element of a queuing system, as it shows the queue
discipline, which means the order in which the customers are picked from the queue
for the service. Simply, the way the customer is selected from the waiting line for
service is shown by the queue structure.
ii. The key difference between an “infinite” and “finite” population model
is how the arrival process is defined.
iii. An infinite calling population assumes a large number of potential
customers and there is always room for one more potential customer to
be served. Usually, the system is viewed as an “open system”. (Ex.
grocery stores, banks and malls). In this system, arrival rate is not
affected by the number of customers in the system. Most queuing
systems assume that the population is infinite.
Arrivals can be measured as Me arrival rate or the interarrival time (time between
arrivals).
Arrivals may also come in batches of multiple customers, which is called batch or
bulk arrivals. The batch size may be either deterministic or stochastic.
Pattern of arrivals at the System:
Passengers either arrive at a service facility according to some known schedule (in our
case, 13.361 regular passengers every 95 minutes or 0.140
Passenger every one minute) or else they arrive randomly. Arrivals are considered
random when they are independent of one another and their occurrence cannot be predicted
exactly. Frequently in queuing problems, the number of arrivals per unit of time can be
estimated by a probability distribution known as the Poisson distribution .For any given
arrival rate, such as two passengers per hour, or four airplanes per minute , a discrete Poisson
distribution can be established by using the formula
Cµ Priority Rule
Triage Procedure
Expedited Screening
it gives the probabilities for the number of events taking place in the given time
period
The Poisson process has the following properties:
2. It is a stochastic process. Each time you run the Poisson process, it will produce a
different sequence of random outcomes as per some probability distribution which we will
soon see.
4. It has independent increments. What this is means is that the number of events that
the process predicts will occur in any given interval, is independent of the number in any
other disjoint interval. For e.g. the number of people walking into the ER from time zero
(start of the observation) up through 10am, is independent of the number walking in from
3:33pm to 8:26pm, or from 11:00pm to 11:05pm and so on.
For any given arrival time (such as 2 customers per hour or 4 trucks per minute), a discrete
Poisson distribution can be established by using the formula:
Illustrates the Poisson distribution for λ = 2 and λ = 4. This means that if the average arrival
rate is λ = 2 customers per hour, the probability of 0 customers arriving in any random hour is
about 13%, probability of 1 customer is about 27%, 2 customers about 27%, 3 customers
about 18%, 4 customers about 9%, and so on. The chances that 9 or more will arrive are
virtually nil. Arrivals, of course, are not always Poisson distributed (they may follow some
other distribution). Patterns, therefore, should be examined to make certain that they are well
approximated by Poisson before that distribution is applied.