Problem 6.4) For the hamburger counter shown below, assume the following:

People come into the hamburger store at about every 2 minutes, distributed exponentially.

One server requires 20 seconds distributed normally, with a 5 second sigma to take an order. She then takes 60 seconds to fill the order, distributed normally, with a sigma of 10 seconds. She then takes a mean of 5 seconds, distributed exponentially to take the money and give change. The second person takes the following times for the same operations: 40, 6, 80, 12, 10. Assume that new customers will always go to the shortest line, and that the queue lengths are unlimited.

After people get their hamburgers and fries, 20% of them leave, and the rest go to the seating area. It takes between 10 and 20 seconds to get to the seating area, distributed continuous uniformly. After they are seated they eat for a mean of 5 minutes with a sigma of 1 minute. After eating, 95% of them leave, but 5% go back and order another hamburger and either go back to the seating area or go home to eat it, just like first-time buyers. Ummmm, good.

Simulate this system using BOSS, and find out if any of the resources need to be expanded to maximize our throughput. Do not change the model, just tell me where the bottlenecks are. No hand solution required.

Photo of MacDondald’s Store (to scale):