Queueing Theory: Part 3

This entry is part 6 of 21 in the series queueing theory

This post is part of a series on Queueing Theory. The other articles can be found here:

  1. Queueing Theory: Part 1
  2. Queueing Theory: Part 2
  3. Queueing Theory: Part 3
  4. Queueing Theory: Part 4
  5. What is Waste?
  6. On Time-Traps and Waste
  7. Call Centers as Queueing Systems
  8. Travel Time & Waste
  9. Little’s Law for Product Development

I previously wrote on Queueing Theory and titled those posts as Queueing Theory: Part 1 and Queueing Theory: Part 2. Today, I’ll briefly explain how to set-up a model in Microsoft Excel to simulate a Single-Server Queue.

Queueing Theory shows the interplay between the arrival rate and the service rate, which both reveal the characteristics of the queue and, ultimately the customer experience. The items in parenthesis below are the cell/row numbers in my example image (see below).

  1. Arrival Rate: Set-up a field to accept the Customers Per Hour (B5); Followed by a field to accept the Average Minutes Between Arrivals (60/B5).
  2. Service Rate: Next, we need to set-up the Service Rate. To do this, create a field that will accept Customers Per Hour (B7). This is followed by a field to accept Average Service Time in Minutes (60/B7).
  3. Now, we can learn about the characteristics of the queue and also how the customer might experience the queue:

  4. Average Server Utilization: Create a field to calculate the Average Server Utilization (B5/B7).
  5. Average Number of Customers in the Line: Set-up a field to calculate the Average Number of Customers in the Line (B5^2/(B7*(B7-B5))).
  6. Average Number of Customers in the System: Now, create a field to calculate the Average Number of Customers in the System (B5/(B7-B5)).
  7. Average Waiting Time in the Line: Now, we can determine how long it is, on average, for a customer to Wait in the Line in hours (B5/(B7*(B7-B5)) and in minutes ((B5/(B7*(B7-B5)))*60).
  8. Average Time in the System: System here is defined the cumulative time of (Waiting in the Line + Being Served). For Hours, create a field that will calculate the following (1/(B7-B5)) and for Minutes ((1/(B7-B5)*60).

shmula.com, queueing theory

That’s it. With a few simple calculations we can determine the the load of a system the how long it is on average for a customer to wait for service. Queueing Theory is very pragmatic, applicable, and fairly easy to do. There’s a lot of quant-jock mystique around it, but it’s really not difficult to understand and it can really impact how companies conduct business. Where can you apply this?

Any business process where lines are a matter of fact — this means:

Queueing Theory isn’t used enough, in my experience. More businesses could stand to benefit from its use and application. At the end of the day, simply learning about how long a customer might wait in line will help a business better design their service to provide more value-add to the customer experience.

Series Navigation«queueing theory: part 2+«Staring at Acoustic Ceiling TilesLittle’s Law for Product Development»

Short URL: http://bit.ly/cosx

Share This Post:



  • Digg
  • Twitter
  • Facebook
  • Google Bookmarks
  • del.icio.us
  • StumbleUpon
  • LinkedIn
  • MySpace
  • HackerNews
  • Reddit
  • Live
  • email

2-pizza teams (10)
3 C's (3)
37signals (1)
5S (38)
A3 Report (9)
adoption (7)
agile/software (59)
ajax (4)
amazon (53)
apple (3)
apple iphone (7)
axiom (3)
Aza Raskin (9)
backcountry.com (2)
berlin (1)
bill gates (1)
bill marriott (1)
blog tag (1)
book reviews (4)
bullwhip effect (5)
business (397)
business plans (3)
busm361 (13)
BzzAgent (12)
call center and queueing (11)
car buying (2)
Carbonite (1)
change management (5)
chicago (1)
click fraud (1)
click-to-ship (21)
clocky (2)
colin powell (2)
community (2)
company interviews (18)
company interviews (6)
complexity (32)
costs (8)
culture (7)
customer experience (10)
customer obsession (52)
customer recovery function (1)
customer segmentation (8)
customer service (17)
design thinking (14)
digg (4)
drum-buffer-rope (38)
dublin (1)
dynamic systems (24)
eBay (6)
economics (3)
efficiency (4)
ethnography (29)
family (18)
featuritis (15)
flexibility (1)
forecasting (2)
four performance dimensions (2)
Fun With The 2×2 Matrix (1)
game theory (7)
Gemba (67)
genchi genbutsu (68)
general (135)
germany (1)
google (15)
Gretchen Rubin (1)
heijunka (65)
holidays (1)
hoshin kanri (1)
how to be a human (1)
IDEO (2)
image uploading (1)
interviews (4)
iphone (5)
ishikawa (69)
IT at Toyota (67)
jason fried (1)
just-in-time (4)
kaizen (4)
kanban (46)
law of instinct (1)
Leadership (46)
lean (167)
Lean Consumption Maps (98)
learning curve (1)
licketyship (1)
mark cuban (1)
martin luther king (1)
mary poppendieck (1)
metrics (73)
microsoft (6)
milton friedman (1)
moving average (1)
muda (68)
nba fines (1)
net promoter score (nps) (1)
obeya (39)
Off-Topic (1)
onstar (1)
operations (108)
pageviews (3)
pareto principle (39)
patent (1)
peanut butter manifesto (2)
philosophy (3)
Poka-Yoke (6)
poppendieck (3)
powerpoint sucks (2)
private equity (4)
process measures (6)
product development (20)
productivity (4)
quality (41)
quasimodal design (1)
queueing theory (41)
Raffle (1)
rational choice (2)
regression analysis (18)
respect for people (6)
root cause analysis (60)
sarah+palin (2)
seth godin (1)
simplicity principle (10)
six sigma (128)
snowboarding (2)
social media (3)
spam (1)
statistical process control (46)
strategy (46)
suburban (1)
supply chain (24)
takt time (8)
teaching (2)
team size (9)
technology (104)
the beer distribution game (1)
The Happiness Project (1)
the profit tree (7)
The Visual Factory (11)
theory of constraints (41)
time (2)
timeline (3)
tony+hsieh (11)
toyota (75)
travel (1)
trump bankruptcy (1)
turnaround (5)
twitter (8)
uspto (1)
utah deal flow (2)
variation (69)
venture capital (1)
Visual Management (11)
waste (59)
website traffic (2)
Wing Chun (2)
wisdom of crowds (1)
wisdom teeth (1)
word-of-mouth marketing (18)
yahoo (2)
zappos.com (12)
zero defects (3)

WP Cumulus Flash tag cloud by Roy Tanck and Luke Morton requires Flash Player 9 or better.


If you enjoyed this post, please consider to leave a comment or subscribe to the feed and get future articles delivered to your feed reader.

Comments

[...] Queueing Theory: Part 3 [...]

[...] Queueing Theory: Part 3 [...]

[...] Queueing Theory: Part 3 [...]

[...] Queueing Theory: Part 3 [...]

What happens if my service rate is lower than my arrival rate? How do I deal with the negative values?

[...] Queueing Theory: Part 3 [...]

[...] Queueing Theory: Part 3 [...]

Hallo,

I am trying to discover if there is a reasonably simple way to predict the probability of a Queue Wait time exceeding a certain length for a multi-server queueing system with a poisson arrival rate and a constant service rate. For example, for a call centre with a call arrival rate of 50 / Hour, and a service time of 5 minutes, how can I calculate how many servers I will need in order that 80% of calls have a wait time of > 20 seconds.

I would be very grateful if you could let me know whether this calculation is possible, and if so, what the equation is. Many thanks

James Nutting

Leave a comment

(required)

(required)


Additional comments powered by BackType