Scribd
Upload
7 views9 pages

Little's Law and Queue Performance Analysis

This document provides an overview of key concepts in queuing theory and Little's Law. It defines common queuing terminology like flow rate, cycle time, and bottleneck. Little's Law relates inventory, flow rate, and flow time. The document also summarizes formulas for performance measures like average queue length, waiting time, and system time. It presents equations for these measures in single-server queues under different assumptions about service time distribution.

Uploaded by

Sanjeev Ranjan
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
7 views9 pages

Little's Law and Queue Performance Analysis

This document provides an overview of key concepts in queuing theory and Little's Law. It defines common queuing terminology like flow rate, cycle time, and bottleneck. Little's Law relates inventory, flow rate, and flow time. The document also summarizes formulas for performance measures like average queue length, waiting time, and system time. It presents equations for these measures in single-server queues under different assumptions about service time distribution.

Uploaded by

Sanjeev Ranjan
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

Tutorial-1

Haritha Saranga

Littles law: Its more powerful than you think...


Littles Law:

Inventory (I) = Flow Rate (R) * Flow Time (T)

Implications:
Out of the three fundamental performance measures (I,R,T), two can
be chosen by management, the other is GIVEN by nature
Hold throughput (flow rate) constant: Reducing inventory = reducing
flow time

Given two of the three measures, you can solve for the third

10/8/2015

Prof. Haritha Saranga

Basic Process Vocabulary

Processing times: how long does the worker spend on the task?

Capacity = 1/processing time (how many units can the worker make per unit
of time)
If there are m workers at the activity: Capacity=m/processing time

Bottleneck: process step with the lowest capacity

Process capacity: capacity of the bottleneck

Cycle Time = time between successive units as they output from the process
= 1/process capacity

Flow rate =Minimum{Demand rate, Process Capacity)

Utilization =Flow Rate / Capacity

10/8/2015

Prof. Haritha Saranga

X a is the M ean Inter - Arrival Time (IAT)


X s is the M ean Service Time (ST)
Sa is the standard deviation of IAT
Ss is the standard deviation of ST
Sa
Xa
S
Cs is the Coefficien t of Variation of ST s
Xs
1
is the M ean Arrival Rate
Xa
1
is the M ean Service Rate
Xs
C a is the Coefficien t of Variation of IAT

(with a single server)

(with ' S' servers)


S

Capacity utilization

Length of a queue
Lq

2( S 1)

(1 )

Utilization effect

Ca2 C s2
*

Variability effect

Where Ca & Cs are the Coefficients of Variation of inter-arrival & service times

Queue Performance Measures


Ls

Average number of customers in the system


(waiting to be served and being served)

Lq

Average number of customers in the waiting line

Ws

Average time a customer spends in the system


(waiting and being served)

Wq

Average time a customer spends waiting in line


mean arrival rate (Interarrival times are
exponentially distributed)
mean service rate

Single server Queue Length


(Exponential service time)

Lq =

Queue Performance Measures


Server utilisation

In the case of single server:

In the case of multiple servers:

(general assumption: <1)

Waiting Time using Littles Law


Average time customer
spends in queue

Lq

Wq =

Average number of
customers in system

Ls = L q +

Average time customer


spends in system

Ws =

Ls

Wq +

Probability
Probability of at most m customers in the
system is given by
m

P
n 0

where Pn (1 )

Formulae For Lq

Three types of Queuing systems*


1.

Single server Queue


Exponential service time

2.

Single server Queue


General service time

3.

Single server Queue


Deterministic service time

Lq =

Lq =

Lq =
=

1

1

* Arrivals are assumed to follow Poisson distribution in all three cases

You might also like