Scribd
Upload
9 views3 pages

AOT - Queuing

This document introduces queuing theory, which is a mathematical study of waiting lines and optimizing processes involving waiting times and service rates. It discusses key components of queuing systems like arrival process, service process, queue discipline, and queue capacity. It also covers performance measures in queuing theory and various applications.

Uploaded by

Rutuja Sukede
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views3 pages

AOT - Queuing

This document introduces queuing theory, which is a mathematical study of waiting lines and optimizing processes involving waiting times and service rates. It discusses key components of queuing systems like arrival process, service process, queue discipline, and queue capacity. It also covers performance measures in queuing theory and various applications.

Uploaded by

Rutuja Sukede
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Introduction to Queuing Theory:

Queuing Theory isa mathematical study of waiting lines,or


optimizing processes involving waiting times and service rates.queues. It involves analyzing and
This concept finds applications
in various fields such as operations
transportation.
management, telecommunications, computer science, and

Key Components of Queuing Systems:


Arrival Process ():
Represents the rate at which customers or entities arrive at the system.
Itcould be constant or followa specific distribution (e.g.
Poisson distribution).

Service Process ():


Denotes the rate at which the service is provided to the customers.
Like arrival process, it can be constant or follow a specific distribution (e.g., exponential
distribution).

Queue Discipline:
Rules governing the order in which customers are served from the queue.
Examples include First-In-First-Out (FIF0), Last-In-First-Out (LIFO), and Priority Queuing.

Queue Capacity:
Specifies the maximum number of customers that the queue can hold.
Unlimited capacity queues are called infinite queues, while those with acapacity limit are finite
queues.

Performance Measures in Queuing Theory:

Utilization factor/ traffic intensity: 2./

Probability of customer being id<e= Probability that there is no one in the system (i.e. no
one in the queue andno one being served): 1-/p
(L):
Average Queue Length
of customers waitingin the queue.
Average number
Lq=i!/(a( -)

Systemn (L):
AverageNumber of Customers in the
queue and being served.
Includes both the customers in the
L= i/( -)

Average Waiting Time in Queue (Wq):


Average time a customer spends waiting in thequeue.
W =Lq/i =i/(u(u -))

Average Waiting Time in System (W):


Average time a customer spends in the system (including service time).
Waiting time + service tine

W= Wq+(1/)=1/(p- .)

Queuing Models:

1. Single-Server Queuing Models: Also known as M/M/I queues. Single server serves
customers from asingle queue. Arrival and service rates follow exponential
distributions.
2. Multi-Server Queuing Models: Also known as M/M/c queues. Multiple servers serve
customers from a single queue. Arrival and service rates follow exponential
distributions.
3. Finite Capacity Queuing Models: Also known us M/M/I/K queues. The system hus u
limited cupucity for customers wuiting in the queue. Arrival and service rates follow
exponentiul distributions.

Applications of Queuing Theory:


º Telecommunication networks
º Healthcare systems (e.g., hospital queues)
Customer service centers
º Manufacturing and production processes
º Transportation systems (e.g., traflic flow analysis)
Examples:
, In apublic
telephone
average takes 3 minutes.booth, the arrivals are on
average 15 per hour. A on the
If there is just one
callers in the booth at any time and (ii) phone, find the (i) the expectedcall
number of
expected to be idle. and the proportion of the time the booth is

It is an example of(M/M/1)
queuing system. Reason: Single server serves customer from
queue. Single server indicates only one telephone. single
Given customer arrival rate is (2) = 15 unit/hour
Average service rate is (u)= 60/3 = 20 unit/hour given 3minutes call)
() Expected number of callers in the booth (indicates Average Number of
in the System) Customers
L=/(4 -2)
= 15/ (20-15)
=3
(ii) the proportion of the time the booth is expected to be idle (indicates noone in the
system)
|-trafficintensity
=1-/p
=1 - 15/20
=1/4 hour = 15minute

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy