What is Queuing Analysis?

The mathematical analysis of queue (waiting line) More generally, it is concerned with mathematical modelling and analysis of systems that provide service to random demand

What is a Queuing Model?

The abstract description of queuing system Typically represents: Systems physical configuration Stochastic nature of demands

Arrival process Service process

Queuing Analysis
was born in early 1900s with the work of A.K. Erlang of the Copenhagen Telephone Company. Is now considered to be one of the standard methodologies of operation research and management science.

Parts of the Queuing System

Calling Population also called Served Population or Arriving Population. The queue waiting line Service Facility

Characteristics of a Calling Population

Size of the Population Arrival Characteristics Behavior of the Population

Size of the Calling Population

Infinite: actually a finite population, but they are very large, and for mathematical convenience is treated as infinite Finite: if the probability of an arrival is greatly changes when one of the calling population is being served.

Arrival Characteristics of the Population

Organized Pattern: with definite and constant interval.
Describes the distribution of arrivals per unit of time

Random Pattern: with varying interval. Often described by the Poisson distribution

Behavior of the Population

Regening member of the population gets into the waiting line then leaves. Balking means not joining Jockeying in case of multiple queue, member moves back and fort among queues

Waiting Line
Often describe in terms of maximum length to which it can grow:
Limited Unlimited

Service Facility
Often described in view of the ff: The physical layout of the queuing system The queue discipline The appropriate probability distribution describing the service times

Physical Layout of the Queuing System

Single Channel, Single Server Single Channel, Multiserver Multichannel, Single Server Multichannel, Multiserver

Single Channel, Single Server

Single Channel, Multiserver

Multichannel, Single Server

Multichannel, Multiserver

The Queue Discipline

Priority
Preemptive Nonpreemptive

First Come First Served

Probability Distribution Describing the Service Times

Constant each member of the queue requires the same time to be serviced Random appropriate probability distribution is required to describe behavior. (exponential probability distribution)
Describes the distribution of time between events

Elementary Queuing System

In the case in which both the arrival rate and the servicing rate constant, scenarios like following can occur: No Queue, With Idle Time No Queue, No Idle Time Queue Forms, No Idle Time

No Queue, With Idle Time

Assume that the arrival occurs at constant rate of 10 per hour, 10 arrivals each hour and every hour, occuring precisely every 6 minutes. Assume also that services can be performed at a constant rate of 12 per hour every hour.
With this situation, a queue will not form because the servicing facility can handle with ease the entire arrival workload. Idle time would be 2/12 because arrival need only 10/12 of servicing capacity

No Queue, No Idle Time

Assume now that at a constant rate of 10 per hour, occurring at 6-minute interval during an hour. Assume also that services can be and are performed at a constant rate of 10 per hour every hour
With this situation, a queue cannot form because arrivals are serviced at the time. Also, there will be no idle time in the servicing facility because it must operate at full capacity to handle the arrivals

Queue Forms, No Idle Time

Assume that arrivals occur at a constant rate of 10 per hour, occurring every 6 minutes during that hour. Assume also that services are performed at a constant rate of 8 per hour every hour.
With this situation, a queue will form and grow because the input rate is higher than the ability of the servicing facility to handle it. The queue of the unserviced arrivals builds up at the rate of 2 units per hour, the excess of arrivals over serviced items. At the end of 8 hours, for instance, we would normally expect to see 16 units in queue.

Kendall Notation
Queuing Models are classified using a system called Kendall notation. General format is A/B/S where:
A assumption made for the arrival process
M poission D - deterministic, not random G - general,

B - assumption made for the service process S number of channels or servers in the system

Simple M/M/1 Model

w = dwell time, time spent in queue plus the time spent being served. L = average number of customer in the system. q = when used as a subscript, limits the data in queue.

Simple M/M/1 Model contd

Consider a single server that can process customers at the rate of 10 per hour (m = 10), facing an arrival rate of 6 customers per hour (l = 6).

Utilization is 60%. Because the server can provide service on all arrivals (6) out of its total capacity (10)

Simple M/M/1 Model contd

The total dwell time in the system is 0.25 hours [i.e. w = 1/(10-6) = = 0.25 hrs] of which the time spent in queue is 0.15 hrs [i.e. wq = w (1/m) = .25 (1/10) = .15 hrs] Therefore, the number of customer in the system would be 1.5 [i.e. L = l w = 6 * .25 = 1.5] of which the number of customers in queue would be 0.9 [i.e. Lq = l wq = 6 * .15 = 0.9]

Rationale of M/M/1
One might expect that if there are 1.5 customers in the system on the average, then one of them is beingserved which would leave an average of 0.5 customers in the queue, instead of the 0.9 that was just calculated. However, the average number of customers being served is not 1; it is only 0.6 since the server is busy only 60% of the time. Therefore: 1.5 (1*.6) = 0.9 in queue

Service Engineering defined

The function of determining the integrity of material and services in order to measure and maintain operational reliability, approve

design changes, and assure their

conformance with established specifications and standards.

Role of Service Engineering on Queuing Analysis

Service Engineering depicts how an operation that is dealing with a queue will turn out.

Will the service be good or not?