February 2017 (Port in a Storm)
December 2016 (Galaxy on Fire)
October 2016 (Shelter in Place)
August 2016 (Matchup)
June 2016 (Elevators)
April 2016 (Cell Towers)
February 2016 (Toy builder)
December 2015 (Crazy Cake)
October 2015 (Racecar design)
August 2015 (Moon Rover)
June 2015 (Campsite)
April 2015 (Desert Island)
February 2015 (Coins)
December 2014 (Electrifying)
October 2014 (Fighters)
August 2014 (Good Burger)
June 2014 (Frog and Fly)
April 2014 (Spy Catcher)
February 2014 (Pizza Delivery)
December 2013 (Golf Queuing)
October 2013 (Chutes and Ladders)
August 2013 (Urban Planning)
June 2013 (Self Driving Cars)
April 2013 (Subs vs. Battleships)
February 2013 (Chandelier Balancing)
December 2012 (Cookie Bake Off)
October 2012 (FarmOR)
August 2012 (Combination Locks)
June 2012 (Lost at Sea)
April 2012 (McEverywhere)
February 2012 (Popsicle Scheduling)
December 2011 (Dice Game)
October 2011 (Movie Stars)
August 2011 (Logical Hospital)
June 2011 (Matchmaker)
April 2011 (Choose Your Crew)
February 2011 (Best Host)
December 2010 (Miniopoly)
October 2010 (Home Improvement)
August 2010 (Relief Mission)
June 2010 (SurvivOR)
April 2010 (Patient 21)
February 2010 (Planet Colonization)
December 2009 (Fish Finder)
October 2009 (Connected & Infected)
August 2009 (Bridges)
June 2009 (Grocery Queuing)
April 2009 (Dance Scheduling)
February 2009 (Supply & Demand)
December 2008 (5x5 Poker)
October 2008 (3DPP)
August 2008 (Markov's Prison)
June 2008 (TSP)
April 2008 (Scheduling)
February 2008 (Decision Trees)
About the PuzzlOR
Analytics Treasure Hunt 2012
The PuzzlOR
Decision Support Puzzles for Applied Mathematicians
June 2009 - Grocery Queuing

Grocery stores are one of the last commercial entities that continue to use the multiple-queue, multiple-server method for providing service to their customers. Banks and post offices have adopted a single-queue, multiple-server method that not only services customers faster but is a fairer system for providing service.

Let's compare these two queueing methods to see how much extra time a customer spends in a traditional queue versus the proposed queue.

Traditional queueing: On a typically busy day at the local grocery store, customers enter one of three queues in order to check out and pay for their groceries. They arrive at the checkout lanes with an inter-arrival time of two minutes, exponentially distributed. A cashier can scan a customer's groceries and finish on average in five minutes, also exponentially distributed. When selecting a queue, the customer will always choose the line with the fewest people waiting. For simplicity, let's assume that once a customer chooses a lane for checkout, he cannot move to another line.

Proposed queueing: The newly proposed queueing system (Figure 1) has the same arrival and checkout times as the traditional queueing model. But now there is only a single queue where customers wait until a checkout station is empty. Once a checkout station is empty, the customer proceeds immediately to that open station.

Question: How much less time on average (in seconds) will a customer have to wait in line if the grocery store switches from the traditional to the proposed queueing system?
Copyright 2017 - All Rights Reserved