QUEUING THEORY

-MADE BY
-CHIRAYU OLKAR (42)
-SHIVANI BHAT (8 )
INTRODUCTION

 The study of waiting lines, called queuing theory, is one of the

oldest and most widely used quantitative analysis techniques.
 Waiting lines are an everyday occurrence, affecting people
shopping for groceries, buying gasoline, making a bank deposit.
 Machines waiting to be repaired, trucks in line to be unloaded, or
airplanes lined up on a runway waiting for permission to take off.
 One of the goals of queuing analysis is finding the best
level of service for an organization.
 Managers must deal with the trade-off between the cost of
providing good service and the cost of customer waiting
time.
 BASIC COMPONENTS OF QUEING
 Arrivals
 Service facilities
 Actual waiting line.
Queuing Problem arises because of
Queuing Cost and Service level Cost
Service disciplines

 First in First out

 Last in first out
 Priority
 Random
Customer’s behavior of waiting

 Balking: customers deciding not to join the queue if it is too long

 Jockeying: customers switch between queues if they think they will get
served faster by doing so

 Reneging: customers leave the queue if they have waited too long for
service
Four Basic Queuing System Configurations
TYPES OF QUEUING MODEL

 Single-Channel Queuing Model

 Multichannel Queuing Model
 Constant Service Time Model
 Finite Population Model
Single-Channel Queuing Model
Assumptions of the Model

 1. Arrivals are served on a FIFO basis.

 2. Every arrival waits to be served regardless of the length of the
line; that is, there is no balking or reneging.
 3. Arrivals are independent of preceding arrivals, but the average
number of arrivals (the arrival rate) does not change over time.
 4. Arrivals are described by a Poisson probability distribution and
come from an infinite or very large population.
 5. Service times also vary from one customer to the next and are
independent of one another, but their average rate is known.
 6. Service times occur according to the negative exponential
probability distribution.
 7. The average service rate is greater than the average arrival rate.
FORMULA
Arnold’s Muffler Shop Case

 Arnold’s mechanic, Reid Blank, is able to install new mufflers at

an average rate of 3 per hour, or about 1 every 20 minutes.
Customers needing this service arrive at the shop on the
average of 2 per hour. Solve and find all the necessary details
based on the formula .
Solution
Multichannel Queuing Model
FORMULA
Case – Multi – Channel

 Arnold finds that at minimal after-tax cost he can open a Second

garage bay in which mufflers can be installed. Instead of firing
his first mechanic, Blank, he would hire a second worker. The
new mechanic would be expected to install mufflers at the same
rate as Blank . Customers, who would still arrive at the same
rate , would wait in a single line until one of the two mechanics is
free.
Solution