Improving Service Quality of Dhaba With The Help of Queuing Theory
Improving Service Quality of Dhaba With The Help of Queuing Theory
3, pp 082-086
ABSTRACT
Queuing theory is the mathematics of waiting lines. It is beneficial in predicting and
evaluating system performance. Queuing theory has been used for operations research, manufacturing
and systems analysis. The common problem in almost every famous Dhaba is that they lose their
customers due to a long wait in the line. Some dhaba provide an extra chair for the customer to wait.
But after waiting too long, they leave. However, waiting chairs alone would not solve a problem when
customers withdraw and go to the next dhaba. This causes a lot of loss to our dhaba. This shows a
need of a numerical model for the restaurant management to understand the situation better. This
paper aims to show that queuing theory satisfies the model when tested with a real-case scenario. The
authors obtained the data from a “Gulshan Dhaba” in Hodal, Haryana. To derive the arrival rate,
service rate, utilization rate, waiting time in queue, and potential customers' probability to balk. The
collected data is analysed by using Little’s Theorem and M/M/1 queuing model. The arrival rate at
“Gulshan Dhaba”, Hodal during its busiest period of the day is two customers per minute (cpm),
while the service rate is 2.02 cpm during our study period. The average number of customers in the
restaurant is 100, and the utilization period is 0.99.
.
Keywords: Queuing theory; Little’s Theorem; Kendall’s notation; Waiting Lines and Dhaba
1. Introduction
offer. A low level of service may be inexpensive, at
With the growth of population and living least in the short run, but may incur high costs of
standards, people are keen to take food in customer dissatisfaction, such as lost future business
dhaba/restaurant. Visitors, tourists, office goers take and actual processing costs of complaints [3]. The
regular food in a restaurant within their budget. Dhaba arrangement of at least 60 persons at a time is
services by providing food, breakfast, tiffin, lunch, considered in the scheme. If the service and quality of
dinner, and cold drinks and snacks are top-rated. food are correctly maintained, then we can take most
Nowadays, visitors, customers, tourists, floating people profit in business. Waiting lines are the most frequently
prefer to sit in the restaurant for a while and take encountered problems in everyday life [4]. A long
necessary appetizers and go away [1]. Thus, dhaba can waiting line may result in loss of customers to an
be planned to set up in outer of town/city of thick organization. Waiting time can be reduced by providing
population, on the high way side. The more option for additional service facilities, but it may increase the idle
food is kept to serve, the more the dhaba will be famous. time of the service mechanism.
There are several determining factors for a dhaba to be Queuing theory is the study of a queue or
considered a good or a bad one. waiting lines. Some of the analyses that can be derived
Taste, cleanliness, the restaurant layout and using queuing theory include the expected waiting time
settings are some of the most critical factors. These in the queue, the average time in the system, the
factors, when managed carefully, will be able to attract expected queue length, the expected number of
plenty of customers. However, another factor needs to customers served at one time, the probability of balking
be considered, especially when the restaurant has customers, as well as the probability of the system to be
already succeeded in attracting customers. This factor is in certain states, such as empty or full [5]. Hence,
the customers queuing time [2]. In a waiting line queuing theory is suitable to be applied in a dhaba
system, managers must decide what level of service to
www.smenec.org 82 © SME
Journal of Manufacturing Engineering, September 2021, Vol. 16, Issue. 3, pp 082-086
setting since it has an associated queue or waiting line and the service is described by the service time per
where customers who cannot be served immediately customer. Customers may jockey from one queue to
have to queue for service. This paper uses queuing another in the hope of reducing waiting time. They may
theory to study the waiting lines in “Gulshan Dhaba” at also balk from joining a queue altogether because of
Hodal, Haryana, India, and the dhaba provides 50 tables long delay, or they may renege from a queue because
out of which some have four chairs, and some have six they have been waiting too long [6].
chairs. Twenty waiters are working at any one time. On
a daily basis, it serves over 700 customers during Queue: A group of items waiting to receive service,
weekdays and over 1200 customers during the weekend. including those receiving the service, is known as a
This paper seeks to illustrate the usefulness of applying queue.
queuing theory in a real case situation.
Arrival rate: Arrival is the number of arrivals per unit of
time.
2. Background Of Queuing Theory
Service rate: It is the rate at which the customer is
The first paper on queuing theory, “The Theory
served in the system.
of Probabilities and Telephone Conversations”, was
published in 1909 by A.K. Erlang, now considered the
Service time: The time taken by the server to complete
father of the field. His work with the Copenhagen
service is known as service time.
Telephone Company is what prompted his initial foray
into the field. He pondered the problem of determining
Server: It is a mechanism through which service is
how many telephone circuits were necessary to provide
offered. The queuing calculations change depends on
phone service that would prevent customers from
whether there is a single server or multiple servers for
waiting too long for an available circuit. In developing a
the queue [7].
solution to this problem, he realised that minimizing
waiting time was applicable to many fields and further
Queue Lengths: The queue in a system can be modelled
developed the theory. He identified that the number of
as having infinite or finite queue length. This includes
telephone conversations and telephone holding time fit
the customers waiting in the queue.
into Poisson distribution and exponentially distributed.
Queue Discipline: It is the order in which the members
of the queue are offered service. There are several
possibilities in terms of the sequence of customers to be
served such as FIFO (First in First Out), random order,
LIFO (Last in First Out), SIRO (Service in Random
Order) [8].
It is a suitable model used to represent a In this section, we will discuss two common concepts in
service-oriented problem, where customers arrive queuing theorem.
randomly to receive some service, the service time
being also a random variable. The principal actors in a
queuing situation are the customer and the server. On 4. Little’s Theorem
arrival at a service facility, they can start service quickly
or wait in a queue if the server is busy. From the It describes the relationship between average
analysing queues, the arrival of customers is represented queueing length, average arrival rate and average
by the inter-arrival time between successive customers, waiting time in a queue. The significant part of this
theorem is that it is valid for any queueing system with a
www.smenec.org 83 © SME
Journal of Manufacturing Engineering, September 2021, Vol. 16, Issue. 3, pp 082-086
steady state condition. Massachusetts Institute of the operation of Gulshan dhaba is M/M/1. This is a
Technology (MIT) professor John Little developed queuing model in which the arrival is Marcovian, and
Little’s law in 1954. departure distribution is also Marcovian, number of
The theorem states that the expected number of servers is one. In our observation, the dhaba has several
customers (N) for a system in steady state can be waitresses, but they only have one chef to serve all of
determined using the following equation: the customers in the actual waiting queue.
L = λt. For the analysis of the Gulshan dhaba M/M/1
The average number in the system = Arrival queuing model, the following variables will be
rate × Average system time. Here, λ is the average investigated: -
customer arrival rate, and T is the average service time
for a customer. Consider the example of a Dhaba, where Probability of zero customers in the dhaba: P0 = 1 – ρ
the customer’s arrival rate (λ) doubles, but the
customers still spend the same time in the dhaba(T). Pn: The probability of having n customers in the dhaba
These facts will double the number of customers in the Pn = (1 – ρ) ρn
dhaba (L). Little’s theorem is helpful in quantifying the
maximum achievable operational improvements and Ls: average number of customers dining in the dhaba
estimating the performance change when the system is λ/(µ-λ)
modified.
Lq: average number in the queue.
5. Kendall’s Notation λ2/(µ-λ)
Kendall’s Notation is a system of notation Ws: average time spent in Gulshan dhaba, including the
according to which the various characteristics of a waiting time.
queuing model are identified. Kendall (Kendall, 1951) 1/(µ-λ)
has introduced a set of notations that have become
standard in the literature of queuing models. Wq: average waiting time in the queue.
A general queuing system is denoted by λ/µ (µ-λ)=Lq/λ
(A/B/C): (D/E) Here, λ: Arrival rate
Where A is the probability distribution of µ: Service rate
interarrival time, B is the probability distribution of ρ: λ/µ utilization rate
service time, C is number of servers in the system, D is
the maximum number of customers allowed in the 7. Result And Duscussion
system, E is queue discipline.
It can be understood from the table 1 that the
6. Gulshan Dhaba Queuing Model number of customers on Saturdays and Sundays are
Queuing models are also called waiting line double the number of customers during weekdays. The
models. We are quite familiar with queues in our day-to- busiest period for the dhaba is on the weekend during
day life. Common examples of queuing models that we dinner time. Hence, we will focus our analysis in this
encounter are going to a doctor or going to a time window.
barbershop. Queuing models can be of several types.
Table 1 Number of customer visited
The first category is called a single server queuing
model, where there is only one server. We also have
multiple server queuing models where there are multiple Day/Week Mon Tue Wed Thu Fri Sat Sun
servers for the same job. The data were obtained from 1st week 450 495 420 476 495 920 1020
Gulshan dhaba through interviews with the dhaba 2nd week 415 470 460 419 510 905 990
manager as well as data collections through 3rd week 490 450 415 438 530 950 960
observations at the dhaba. The daily number of visitors 4th week 500 520 490 498 560 980 1000
was obtained from the dhaba itself. The dhaba has been
recording the data as part of its end of day routine. We Our teams conducted the research at dinner
also interviewed the dhaba manager to find out about time. On average, 360 people are coming to the dhaba in
the capacity of the dhaba, the number of waiters and 3 hours’ time window of dinner time.
waitresses, and the number of chefs in the dhaba. Based From this we can derive the arrival rate as:
on the interview with the restaurant manager, we λ=360/180
concluded that the queuing model that best illustrates λ=2 customer/hour
www.smenec.org 84 © SME
Journal of Manufacturing Engineering, September 2021, Vol. 16, Issue. 3, pp 082-086
www.smenec.org 85 © SME
Journal of Manufacturing Engineering, September 2021, Vol. 16, Issue. 3, pp 082-086
www.smenec.org 86 © SME