Theory of Queuing

For the queuing task I explored an everyday life problem. While dancing in a club you get thirsty and you want to get a drink. There are 2 bars, one with 10 people standing in a row and one with 10 people creating a crowd and are “fighting” to get a drink. Which bar should I choose?

Regarding to a SPIEGEL article scientist Refael Hassin (iniversity of Tel Aviv) says the crowded bar is the better one. While you know in a sorted queue you will be the eleventh one, in the crowded bar you have a good chance to get your drink earlier.

The hardest thing to calculate is in every situation the influence of the luck/chance, which makes every case complex. Regarding to our students perspective this can be a damage of an airplane you wanted to use or if in the queue of your supermarket someone wants to return a product.

A solution of the supermarket queue already exists. According to the scientist Alexander Herzog (University Clausthal) only one big queue instead of many small queues (Multi-Queues) is the smartest way. The system is used  at German Post,  or at airports.



One thought on “Theory of Queuing”

  1. Now I can understand why Carrefour uses a queue for all customers and different channels of attention. (Carrefour El saler). As a benefit I can only identify the use of FIFO (first in first out) policy, which helps to respect others’ turn.

    If you know another please do not hesitate to tell me.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s