queueing theory: part 1
- queueing theory: part 1
- On Queueing, Oil Change, and Customer Experience
- Queueing Theory: Part 4
- On Time-Traps and Waste
- queueing theory: part 2+
- Queueing Theory: Part 3
- Little’s Law for Product Development
- Psychology of Queueing & Build-A-Bear Workshop
- Travel Time & Waste
- Call Centers as Queueing Systems
- What is Waste?
- YouTube’s Queueing Properties
- Queueing Theory and Terrorism
- Queueing, Disneyland, and FastPass
- Psychology of Queueing & Disneyland
- Multi-Tasking Leads to Lower Productivity
- Queueing Psychology at the Gas Pump
- On Queueing and Elevator Mirrors
- The Variability Tree
- Attitude and the Pyschology of Queueing
- Emergency Room (ER) Wait Times
- Staring at Acoustic Ceiling Tiles
This post is part of a series on Queueing Theory. The other articles can be found here:
- Queueing Theory: Part 1
- Queueing Theory: Part 2
- Queueing Theory: Part 3
- Queueing Theory: Part 4
- What is Waste?
- On Time-Traps and Waste
- Call Centers as Queueing Systems
- Travel Time & Waste
- Little’s Law for Product Development
a queueing system is a model with the following structure: customers arrive and join a queue to wait for service given by n servers. after receiving service, the customer exits the system. a fundamental result of queueing theory is little’s law.
theorem: for a queueing system in steady state, the average length of the queue is equivalent to the average arrival rate multiplied by the average waiting time. in other words,
L = λW
at amazon, i used little’s law all the time. in dynamic systems with n+ dependencies, it is very helpful to know where the bottlenecks of the system are and how to increase efficiencies, reduce time traps, and eliminate waste in order to increase material flow. in other words, we want product to flow as fast as possible: click-to-ship.
here’s an example:
say there’s a warehouse with 4000 pallets of product that turns ~4 times per year. do we have enough labor to support these transactions? using little’s law, we get
4,000 = λ(.25year)
so,
λ = 16,000 pallets/year
assuming a 10 hour shift per day of about 250 working days per year, there is roughly 2,000 working hours. this means, then,
λ = 8 pallets/hour
the analysis above is critically important to estimate the labor force required to move pallets, receive product, move product, and get work done, in general.
there are many more applications of queueing theory that i will explicate and share in the next while. queueing theory is a critical, underused, but very valuable principle in business.
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
[...] June 15, 2006 at 6:03 am · Filed under business Earlier, we discussed Queueing Theory and Little’s Law. [...]
Little’s Law is an incredbly helpful tool for operations. I highly recommend the Hopp and Spearman book “Factory Physics”, which spends a lot of time on Little’s Law.
Another way of thinking about this is:
Throughput = WIP / CT
WIP = Work in Process
You have to be careful with Little’s Law and resist the temptation to think “all I have to do to increase Throughput is to increase WIP”. It doesn’t work that way, not that Peter was implying that. I’m just saying that’s a common mis-application of Little’s Law.
When you start with zero WIP, you will have zero throughput. Makes sense, right? At first, as WIP increases, your throughput will increase somewhat linearly. But, as capacity utilization reaches 80% or so, throughput levels out and Cycle Time explodes. That’s why really busy systems (factories, emergency rooms, etc.) have very long waiting times. The Cycle Time explosion is made worse with variation. The more variation you have in customer demand and service time, the worse the Cycle Time explosion is. That’s why leveling (heijunka) is key…. on to Peter’s second post, I’m looking forward to reading it.
This Industrial Engineer is just happy to see anyone discussing Little’s Law.
One problem with your analysis there is that you’re assuming demand (and labor needs) are constant throughout the year. I’m certain that wouldn’t be the case for Amazon or any retailer.
[...] 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. [...]
[...] shmula queueing theory: part 1a queueing system is a model with the following structure: customers arrive and join a queue to wait for service given by n servers. after receiving service, the customer exits the system. a [...]
[...] An Ajax-y Google The Pareto Principle “The Long Tail” Ad Naseaum Lean for Software On Time-traps and Waste All Articles on Operations Agile & Team Size Featuritis & The Customer Click-to-Ship Optimization On Game Theory & Digg Queueing Theory, #1 Amazon.com Insider Stories Totalitarian Powerpoint Rejecting Google’s Job Offer Disruptive Company Interviews The State of the Craposphere M&A Mashup: Google, Yahoo, Microsoft Theory of Constraints & Drum, Buffer, Rope Root Cause Analysis [...]
[...] Company Interviews The State of the Craposphere M&A Mashup: Google, Yahoo, Microsoft Theory of Constraints & Drum, Buffer, Rope Root CauseAnalysis [...]
“assuming a 10 hour shift per day of about 250 working days per year, there is roughly 2,000 working hours.”
This works only if the 10 is in octal notation.
“…as capacity utilization reaches 80% or so, throughput levels out and Cycle Time explodes. That’s why really busy systems (factories, emergency rooms, etc.) have very long waiting times…”
No, that’s not the reason. The reason that ERs, restaraunts, and Post Offices have long wait times is that utilization (or demand) has gone over 100% throughput capacity. The service can no longer serve in the rate as people arrive. Since the service provider has not planned for or reacted to the higher demand, the length of the line grows.
Leave a comment
Additional comments powered by BackType
If you found this article interesting, please digg it at: http://digg.com/technology/queueing_theory so more people will find it.