Sequencing

Queuing theory
• Queuing theory deals with waiting line (or queuing) problems. Throughout our daily
life, instances of queue occur very frequently.
• A flow of customers from finite or infinite population towards the service facility forms
a queue (waiting line) an account of lack of capability to serve them all at a time.
• Queue is formed because of the absence of a perfect balance between the service
facilities and the customers.
• Example
 Waiting at railway station for tickets
Waiting at doctor’s clinic
Waiting at Grocery store
Waiting at ATM Machine
Waiting at the Temple
Application of Queuing theory
• Healthcare
• Traffic management (at Bus stand, Railway station, Metro, Airport)
• Telecommunications
• Assembly Line
• Delivery
• Determining sequence of computer operation
Component of Queuing System
• A queuing system can be described by four components
(1) The input (arrival pattern)
(2) The service mechanism (service pattern)
(3) The queue discipline and
(4) Customer’s behavior
Basic Structure of A Queuing System
The input (arrival pattern)
•  The way in which the customers arrive and join the system.
• Customers arrive in a more or less random manner which is not
possible for prediction.
• Customer arrival pattern can be described in terms of probabilities.
• The time difference between the arrival of two successive customer is
called inter-arrival times.
• In Queuing system the customers arrive follows Poisson Distribution.
• The mean arrival rate is denoted by
Poisson Distribution
•P(N
  = n) = (n = 0, 1, 2, . . .)

A discrete random variable N has a Poisson distribution with parameter

if, for n = 0, 1, 2, . . . ,
 The Service Mechanism
•  The arrangement of service facility to serve customers.
• If there is infinite number of servers, then all the customers are
served instantaneously or arrival and there will be no queue.
• If the number of servers is finite then the customers are served
according to a specific order with service time a constant or a random
variable.
• Distribution of service time follows ‘Exponential distribution’ defined
by f(t) = 𝜆 , t > 0
• The mean Service rate is E(t) = 1/𝜆
Queuing Discipline
• The rule which the customers are selected for service when a queue
has been formed.
• Some of the most common disciplines are
1. First in first out – (FIFO)
2. Last in first out – (LIFO)
3. Selection for service in random order (SIRO)
Queuing Discipline
• (FIFO): Customer who in first should be out first
• (LIFO): Customer who in last should be out first
• (SIRO): Customer will be severed in any random order.
 Customer’s behavior
1. Bulk arrival: When customer arrive into system in bulk, it called bulk
arrival.
2. Jockeying: If there is more than one queue, the customers from one
queue may be tempted to join another queue because of its smaller size.
This behavior of customers is known as jockeying.
3. Balking: If the queue length appears very large to a customer, he/she
may not join the queue. This property is known as Balking of customers.
4. Reneging: A customer who is already in a queue will leave the queue in
anticipation of longer waiting line. This kind of departure is known as
reneging.
Notations used in queuing system

• n  – Number of customer in the system (including both waiting and in service).

• λ – Mean arrival rate of customers in per unit of time
• µ – Mean service time (Average number of customer served per unit of time)
• Ls – Average number of customers in the system.
• Lq – Average number of customers in the queue.
• Ws – Average waiting time of a customer in the system.
• Wq – Average waiting time of customers in the queue.
• – Utilization factor for the service system.
• c – Number of service Channels (in parallel).
• Pn (t = probability that there are n customer in the queue)