Best Method for Queuing Athletic Courts

TomL

New member
Joined
Jul 20, 2020
Messages
4
I had no idea queuing calculations were so complex until I started trying to figure out the best way to utilize playing courts!

In my case, we have 15 pickleball courts (kind of like tennis) and we need to decide between two (2) queuing methods:

1) Form a single line and players go to the next available court, with the players that just left the court going to the back of the line.
2) Players select a court at random and wait for that particular court to become available. If no players are waiting to get on a particular court, the team that occupies the court can play another game.

Using either method, I'm assuming the courts would be occupied 100% of the time either by new players from the line or players playing another game because no one was waiting for their particular court. So court (server) utilization is 100%.

My sense tells me the first method would be more fair in that all players (customers) should get roughly equal playing time; i.e., equally distributed among all the players. Using the second method, if I happen to pick a court where the game before me was just starting or going long, and yet a court next to me became available (assume I can't switch my choice,) I could be standing around for longer than if I was in a queue waiting for the next available court. On the other hand, I might get lucky and pick a court where someone is almost finished with their game so I might get on the court quicker than if I was in the queue.

Games take an average of 20 minutes but could vary from, say, 5 minutes to 40 minutes. Each court handles 4 players so we can handle up to 60 players at one time (although it makes things simpler to think of 1 player per court for a total of 15 players.)

Which system is more fair?

The number of players varies throughout the day from, say, <60 to 120 and then back to <60. Is the choice of method influenced by the total number of players in the queue?

Thanks for your assistance.
 
I had no idea queuing calculations were so complex until I started trying to figure out the best way to utilize playing courts!

In my case, we have 15 pickleball courts (kind of like tennis) and we need to decide between two (2) queuing methods:

1) Form a single line and players go to the next available court, with the players that just left the court going to the back of the line.
2) Players select a court at random and wait for that particular court to become available. If no players are waiting to get on a particular court, the team that occupies the court can play another game.

Using either method, I'm assuming the courts would be occupied 100% of the time either by new players from the line or players playing another game because no one was waiting for their particular court. So court (server) utilization is 100%.

My sense tells me the first method would be more fair in that all players (customers) should get roughly equal playing time; i.e., equally distributed among all the players. Using the second method, if I happen to pick a court where the game before me was just starting or going long, and yet a court next to me became available (assume I can't switch my choice,) I could be standing around for longer than if I was in a queue waiting for the next available court. On the other hand, I might get lucky and pick a court where someone is almost finished with their game so I might get on the court quicker than if I was in the queue.

Games take an average of 20 minutes but could vary from, say, 5 minutes to 40 minutes. Each court handles 4 players so we can handle up to 60 players at one time (although it makes things simpler to think of 1 player per court for a total of 15 players.)

Which system is more fair?

The number of players varies throughout the day from, say, <60 to 120 and then back to <60. Is the choice of method influenced by the total number of players in the queue?

Thanks for your assistance.
How do you define "fair"?

I think the system that decreases "waiting time" would be more efficient - hence esirable.
 
I think that since the courts have 100% utilization (they are used 100% of the time by someone), the aggregate waiting time (adding everyone's waiting time together) would be the same using either queuing method. I suspect the first method (one queue) would make it more "fair" in that everyone's waiting time would be similar when averaged over time. The second method would seem to me to result in some people having longer wait times and others having shorter wait times, but perhaps the aggregate waiting times are exactly the same when averaged over time. I think there is a way to prove this mathematically, hence my question.
 
I think that since the courts have 100% utilization (they are used 100% of the time by someone), the aggregate waiting time (adding everyone's waiting time together) would be the same using either queuing method. I suspect the first method (one queue) would make it more "fair" in that everyone's waiting time would be similar when averaged over time. The second method would seem to me to result in some people having longer wait times and others having shorter wait times, but perhaps the aggregate waiting times are exactly the same when averaged over time. I think there is a way to prove this mathematically, hence my question.

Have you taken a class in "queueing theory"?

If not, start googling and let us know what you are reading and what you do not understand (with reference).

A good first starting point would be:

https://en.wikipedia.org/wiki/Queueing_theory
 
You say that The number of players varies throughout the day from, say, <60 to 120 and then back to <60. That confuses me since <60 (less than 60) means that the courts would not be in use 100% of the time as you say.

The two methods would have the same waiting time average while method 2 would have greater 'spread' then method 1 when it comes to waiting time.
 
You say that The number of players varies throughout the day from, say, <60 to 120 and then back to <60. That confuses me since <60 (less than 60) means that the courts would not be in use 100% of the time as you say.

The two methods would have the same waiting time average while method 2 would have greater 'spread' then method 1 when it comes to waiting time.
Yes, at any point where there's </=60 players none of this matters. I am only concerned about those times where there are >60 players.

Now that I've thought through it more, I don't know that I need to find a mathematical solution (and I don't have the time or inclination to become an expert on queuing theory.) I think both methods would converge to the same average waiting time at some point (although a particular player may not play long enough that day to be affected by the convergence.) I think it would be interesting to see how long that takes but I'll have to save that for another day.

Thanks.
 
Why not use the method with the smaller standard deviation for waiting time--method 1?
 
Why not use the method with the smaller standard deviation for waiting time--method 1?
That's always been my preference but there's a bit more to it. People get to visiting at the queue and don't watch for an open court. This decreases the efficiency of method 1. I was against method 2 until I realized that human nature created another variable that might make method 2 the better choice.
 
Top