Is there a good book on this topic? (cliff notes version?)
Here is my problem:
I have 20 cash registers. There is 1 line to the cash registers (like
BestBuy). One cashier is working and the rest are on break.
Each cashier can ring up a person in 20 seconds.
The manager looks and sees 10 people in line and 1 person arriving
every 1 minute.
How many cashiers should the manager call off break to service the 10+
people at an average total wait time of 30 seconds.
Is there a standard set of formulas for this?
Paul A. Rubin - 20 Jul 2006 17:01 GMT
> Is there a good book on this topic? (cliff notes version?)
Schaum's Outline of Operations Research would be the analog to a Cliff
Notes for OR. You can find it listed on Amazon.
For more detail, snag any introductory OR text (Hillier & Liebermann,
Taha, ...) and look for the chapter(s) on queueing theory.
You need more detail to finish your problem (distribution of
interarrival times, distribution of service times, whether the cashiers
have mustard/ketchup on their fingers when they return, ...).
/Paul
> Here is my problem:
>
[quoted text clipped - 8 lines]
>
> Is there a standard set of formulas for this?
ananth.krishnamoorthy@gmail.com - 21 Jul 2006 14:52 GMT
The specific Queueing models that you are looking for are called G/G/k
models. While you will find M/M/k models in some of the introductory
text, the G/G/k model is more complicated. However, the M/M/k models do
provide great insight into the system with minimal data. I think
Hillier & Liebermann has some of the curves you may be looking for.
If you really do need the G/G/k models, one of the seminal papers in
approximations for this case is available at
http://www.columbia.edu/~ww2040/ApproxGIGm1993.pdf.
If you would not like to look at the math but just want the numbers,
you can download software free from http://www.okstate.edu/cocim/raqs/.
Here are some of my thoughts.....
The question you have posed seems to deal with a sudden change in
operation for the queue (not a steady state). Most queueing analysis
however assumes steady state. So, Instead of trying to use queueing,
you can use discrete event simulation.
Typically most customer service situations are analyzed on max waiting
times (or more accurately, 95% percentile of the waiting times). A
simulation can help you build a policy table that reads
something like ..if number of people in queue is X, then you need Y
active cashiers to keep the max waiting time under 30 (or 40 or 50..)
seconds.
> Is there a good book on this topic? (cliff notes version?)
>
[quoted text clipped - 10 lines]
>
> Is there a standard set of formulas for this?