February 3, 2014 in Thinking Analytically:

Golf queueing

SHARE: PRINT ARTICLE:print this page https://doi.org/10.1287/LYTX.2014.01.16

Golfing can be an enjoyable and rewarding way to spend your time. Despite the attraction and fun of the game, there can be many challenges. One of the more common challenges for experienced players is waiting for slower players to finish a hole before the experienced player can start.

As the owner of a nine-hole golf course, you currently have a first-in-first-out policy. In other words, faster players are not allowed to jump ahead of slower players.

You are considering changing this first-in-first-out policy to a priority queueing policy to allow faster players to jump ahead of slower players in between holes.

Players arrive at your golf course at an inter-arrival time of 10 minutes, exponentially distributed. The players on your golf course have three different skill levels. Fast players complete holes at an average of five minutes. Medium players complete holes at an average of seven minutes. Slow players complete holes at an average of 10 minutes. All distributions are normal and have a standard deviation of one minute. Player skill level is randomly distributed (one-third fast, one-third medium, one-third slow).

Assume players start golfing as soon as they arrive on the course and that the system has achieved steady state. Each player is golfing individually (not in a group), and players must go in sequential order from hole 1 to hole 9. Players can only jump the queue if a slower player has not yet started the hole.

Question: How much time on average (in minutes) will a player save if you convert to the priority queueing from first-in-first-out queueing?

Send your answer to [email protected] by March 15, 2014. The winner, chosen randomly from correct answers, will receive a $25 Amazon Gift Card. Past questions can be found at puzzlor.com.

John Toczek

SHARE:

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.