Scribd
Upload
6 views

Introduction to queuing theory

Uploaded by

rvim23mba140.rvim
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

Introduction to queuing theory

Uploaded by

rvim23mba140.rvim
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

General Structure of Queuing System:

The general structure of queuing system is depicted as follows:

Arrival Queue Service Counter Exit


Process
From the above figure, it is clear that there are three elements in a queue system. They are the
Arrival Process, Service System, and Queue Structure. Here we are discussing each element in
detail as follows:

Single Service Facility:


In this model, the service system consists of only one service counter. This model is suitable when
the size of the queue is expected to be too small. The customers who are arriving for the service all
have to wait in one line in front of the counter until their turn.
Single Server, Single Queue Model

Terminologies of Queuing Theory:

1. Queue Length: It is defined as the average number of customers waiting in the queue to get
the service.
2. System Length: Average number of customers waiting in the queue to get service and
number of customers in the system who are getting the service
3. Waiting time in the Queue: Average time that the customer waits in the queue to get the
service. If the waiting time is long then it directly leads to customer dissatisfaction.
4. Total time in the System: Average time that a customer spends in the system, from the
entry of a customer in the queue to completion of service.
5. Server Idle Time: The service counter which is engaged in providing service to customers
is idle because of no customers in the queue and the system.
6. Units: It refers to a customer
7. Arrival Pattern: It refers to the pattern in which customers are arriving in a queue to get
the service.
8. Jockeying: Customers shift from one queue to another queue for getting quick service.
9. Balking: Customers refusing to enter the queue because of its long length.
10. Reneging: Customers leave the queue in mid because they lost their patience after waiting
for a long time in a queue before they are served.
11. Cycling: Returning to the queue immediately after obtaining the service
12. Combining or Dividing: At a certain queue length, they are combining or dividing queues
in a supermarket when a new counter is closed or opened.

Assumptions in Queuing Theory:


1. The arrival rate follows the Poisson distribution and it is represented by λ (average arrival
rate)
2. The service rate is by an exponential distribution and is represented by 𝓾 (average
service rate)
3. The time interval between the arrivals (or) mean inter – arrive time denoted by (1 / λ )
4. The time interval between the service (or) mean inter-service rate is represented by ( 1/ 𝓾)
5. The average rate of servicing is always greater than the average arrival rate of customers

Characteristics of a waiting line or queue:


a. Mean (or) average arrival rate = λ
b. Mean inter-arrival rate = ( 1/ λ)
c. Mean (or) average service rate = 𝓾
d. Mean inter-service rate = ( 1 / 𝓾 )
e. Utilization factor (or) traffic intensity ρ = (λ/𝓾)
f. Probability of ‘n’ customers in the system Pn = [ 1 - (λ/𝓾)][ λ/𝓾]n
g. Probability of ‘n>= k’ customers in the system Pn>=k = [ λ/𝓾]n+1
h. Probability of ‘no or zero’ customers in the system P0 = [ 1 - (λ/𝓾)]
i. The average number of customers in the waiting line (or) queue Lq = [λ2/𝓾(𝓾-λ)]
j. Average number of customers in the system Ls = [λ/(𝓾-λ)]
k. Average waiting time of a customer before being served (Wq)
Wq = [λ/ 𝓾 (𝓾-λ)] or [ Ws – (1/𝓾)]
l. Average waiting time a customer spends in the system (both waiting and being severed)
Ws = [1/(𝓾-λ)] or [Ls / λ ]

You might also like