After the customer enters the restaurant, they randomly choose an empty seat and wait for the waiter

Scenario 1: The restaurant has enough seats and is always empty (it becomes a queue model for the cafeteria).

Changed to M ms wait-based multi-service desk model. ）

Highest efficiency: the shortest average waiting time for serving, the best number of windows.

, n = 0,1,2, L , K 1

n =0, n ≥ K

nμ ,0 ≤ n < s

n =sμ ,s ≤ n ≤ K

Change the parameters. Single-service desk model.

The single service desk waiting system model M M 1 refers to: taking a certain 2 hours as an example, the successive arrival time of customers obeys the negative exponential distribution of the parameter (is a fixed value), the number of cooks is s, the service time V obeys the negative exponential distribution of the parameter, the average service time of each customer is 1, the system space is unlimited, and unlimited queuing is allowed, which is the simplest queuing system. Try not to leave every customer behind.

The waiting time of each customer is considered as the average length of stay Ws. The profit of each dish is w, and the average salary of the chef is G.

15min to integrate the function to find the total number of arrivals X (the total number of dishes is certain) in the 2 hours, and ensure that the profit W is the largest.

There will be no consideration that the customer will leave after 15 minutes.

X=2h*μ*s

In this case, the probability that there are k people in the service system in [0,t] time is:

k=0，1，2…

The mathematical expectation for the random variable X is:

then you can push = *s

= s (it doesn't work to get it down and find it this way).

It is assumed that the total number of people is affected by the waiting time, i.e., X=p(Ws<15min)*2h

The number of people who are tired of flashing Y=p(Ws>15min)*2h, assuming that if he is just cooking his dishes when he leaves, the dishes are eaten by other people, and there will be no loss to the restaurant.

With regard to the customer's stay time T in the system, it can be explained that it obeys a complex exponential distribution with the parameter , i.e.

P = 1-e ^[t] ，t ≥ 0

In summary, that is, as far as possible under the condition of 1 ( -15min.

such that W=X*w-G*s is maximum.

Get some real data to solve , and use the relationship between the three to solve s to make W the maximum.

Don't adopt it yet, if you win a prize with my model, remember to add 50 points!

It is recommended that restaurants can go to restaurants with similar situations to investigate, provide some value-added services for customers, and retain customers. Thank you.

Nowadays, people's living standards are getting higher and higher, and the requirements are getting higher and higher, so the requirements of the service industry are the perfection of details and needs.

Huadian's bar... Get out of the library and get it yourself.

It depends on the area of your restaurant and the grade of the restaurant, like a high-end restaurant, there is a waiter at one table.

This should first be combined with the decoration design of the restaurant, and generally our dining tables are placed according to the rules. First of all, the entrance reception arranges one person according to the number of people, and the restaurant can be divided into areas, each area is in charge of several waiters. The specific number of people and chefs depends on your customer flow and dishes, you can have a trial operation in the early stage, and then constantly adjust the business model that suits you.

You can also ask customers to give some suggestions after the meal. Nowadays, mobile phone ordering is basically popular, which saves some manpower and material resources, for reference.