Queuing Theory

2,881 views

Published on

Published in: Education, Technology, Business
0 Comments
3 Likes
Statistics
Notes
  • Be the first to comment

No Downloads
Views
Total views
2,881
On SlideShare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
97
Comments
0
Likes
3
Embeds 0
No embeds

No notes for slide

Queuing Theory

  1. 1. Queuing Theory –Study of Congestion Operations Research
  2. 2. What is a queue?• People waiting for service – Customers at a supermarket (IVR, railway counter) – Letters in a post office (Emails, SMS) – Cars at a traffic signal• In ordered fashion (who defines order?) – Bank provides token numbers – Customers themselves ensure FIFO at Railway ticket counters
  3. 3. Where do we find queues?
  4. 4. A thought experiment• When does a queue form?• When will it not form?• When will you not join a queue?• When will you leave a queue?• What is the worst case scenario?
  5. 5. What do you observe near a queue?• Conflict• Congestion• Idle counters• Overworked counters• Smart people trying to circumvent the queue
  6. 6. What do we want to know?• How much time will it take?• How many counters should be there?• How to manage peak hour traffic?
  7. 7. Origins• Queuing Theory had its beginning in the research work of a Danish engineer named A. K. Erlang.• In 1909 Erlang experimented with fluctuating demand in telephone traffic.• Eight years later he published a report addressing the delays in automatic dialing equipment.• At the end of World War II, Erlang’s early work was extended to more general problems and to business applications of waiting lines.
  8. 8. Queuing System
  9. 9. Kendall Notation (a/b/c : d/e/f) (a/b/c : d/e/f) Arrival Size ofDistribution source Infinite/ M/D Service Time Maximum finite Distribution number of M/D customers in Number of Service system concurrent Discipline n servers FIFO/LIFO n / Priority/ Random
  10. 10. Identify the queuing systemRailway ticket counter (M/D/3:FIFO/200/∞)Bank Service CounterATMAirport – Check InAirport - SecurityTraffic SignalBus StopTrain Platform (Boarding)Paper Correction
  11. 11. Arrival modeled using Poisson Distribution
  12. 12. Some parametersArrival Rate λService Rate μNumber of customers in system LsNumber of customers in queue LqWaiting time in system WsWaiting time in queue WqUtilization ρ
  13. 13. Types of queuing systems
  14. 14. M/M/1
  15. 15. T1=3T2=7 Arrival Rate = N/Tt=6/19=.31T3=10 Mean Time in system = J/N = 38/6=6.3T4=6 Mean number in system = J/Tt=38/19=2T5=6 = (J/N)*(N/Tt)=6.3*.31=2T6=6 =λTqJ=38

×