Desenhado para expandir os pontos de ensino desenvolvidos no caso best-seller

Benihana, esta simulação online utiliza modelos de eventos discretos para simular o
fluxo de clientes através de um restaurante Benihana. Os estudantes exploram
princípios de aprendizagem em gestão de operações e serviços, incluindo o impacto de
uma estratégia de lotes, optimizando a utilização da capacidade, gestão do tempo de
ciclo, e estratégias para a demanda de nivelamento e de variabilidade do processo.
Estudantes percorrem uma série de desafios, cada um projectado para apresentar os
objectivos específicos de aprendizagem. Desafios individuais exigem que os alunos a
tomar decisões sobre como adicionar / alterar a capacidade de barras, gestão de
variabilidade do processo, a execução das iniciativas de marketing para impulsionar a
procura, aumentando ou diminuindo tempo de experiência de jantar, adicionando
uma opção de reservas, mudança de layout das mesa do restaurante e, finalmente,
elaborar uma estratégia, a melhor combinatória operações de abordagem para
maximizar a rentabilidade do restaurante. Completando todos os desafios, a simulação
é possível em 1,5 horas de tempo de banco. Um detalhado Facilitador Guia contém
uma visão geral das telas de simulação / elementos, bem como uma nota global de
Ensino.

About Your Benihana Restaurant

Each Benihana restaurant is organized with a sizable bar and dining room, shown in the idealized
diagram to the right. Customers enter at the bar, wait until a table is ready, and then are escorted into
the dining room in "batches" of 8. If customers wait too long, or if the bar is full when they arrive, they
will leave before dinner.

Customers are seated from 6:00PM to 9:00PM, though the restaurant remains open until 10:30PM.

Some specific details about your original restaurant:

1. The cocktail lounge has a 55-person seating capacity.

2. Customers are "batched" from the bar in groups of 8 to the dining area.
3. The dining area has a 112-person seating capacity.
4. There is no reserved seating.

Some Specific details about your customers:

1. Customers arrive in party sizes ranging from 2 to 12.

2. Party size is set by a probability distribution (customized to case data) with a mean of 4.
3. Party inter-arrival times are generated by an exponential probability distribution.
4. Mean inter-arrival times are: 4 minutes for the first and third hour, 1 minute for the "dinner rush."
5. When sitting at the bar, customers consume one drink every 12 minutes.
6. Customers require an average of 60 minutes to complete a meal. (standard deviation of 7 minutes). If
customers have had 3 or more drinks, the average goes up to 75 minutes.

How To Play the Simulation

The Benihana Simulation is a discrete simulation with a stochastic demand function. This means that in
order to draw any conclusions from the results, you must run the same decisions at least 10 times and
look at the distribution of results.
Before using the simulation, you will need to choose a challenge at the top of the screen. We
recommend you work from left to right, although your professor may have specific instructions as to
which ones to try.

Second, set your decisions. A group of runs with the same set of decisions is called a scenario. If you
change your decisions you will be prompted asking if you want to clear your old runs or if you want to
create a new scenario.

Third, run the simulation. The simulation can be run in two different modes.

1. Run with Animation. This will simulate the model while animating the clock, bar, and dining room to
the right of the dashboard. This is a good way to visually see what is happening during the evening.
2. Generate 20 Runs. This simulates twenty runs at once allowing you to easily see the potential range of
results caused by the same decisions.

Finally, analyze your results. Look at the graphs and tables. You can examine the average for your group
of runs by clicking the bottom row of results in the run table. Or drill down into the results for specific
runs by clicking that particular run.

After you have gone through all the challenges, you may design your best strategy. Combine the best
elements of each individual challenge and see what is the most profitable strategy for your Benihana
restaurant.

How does batching strategy affect throughput?

You may choose 'Use Batching' which will send customers from the bar to the dining room in groups of
eight, replicating Benihana's standard operating policy. If you choose 'No Batching', customers are
seated in the dining area based on the size of their party. This means (for example), if a group arrives as
a party of five, they will be seated as a party of five and completely occupy an eight-place table.

How many additional customers can Benihana service with batching? What is the impact of batching
during peak and non-peak periods?

http://forio.com/simulation/harvard-business-school-benihana-operations-management-sim/main.html
http://www.bharatbook.com/upload/Operations_Benihana.pdf
http://home.business.utah.edu/mgtgs/Benihana_Project/simulation_site.htm
http://www.extendsim.com/downloads/demos/prods_demo_dl.html

Little's law
From Wikipedia, the free encyclopedia
Jump to: navigation, search

In the mathematical theory of queues, Little's result, theorem, lemma, law or

formula[1] says:

The long-term average number of customers in a stable system L is equal to the

long-term average arrival rate, λ, multiplied by the long-term average time a
customer spends in the system, W; or expressed algebraically: L = λW.

Although it looks intuitively reasonable, it's a quite remarkable result, as it implies that
this behavior is entirely independent of any of the detailed probability distributions
involved, and hence requires no assumptions about the schedule according to which
customers arrive or are serviced.

It is also a comparatively recent result; the first proof was published in 1961 by John
Little, then at Case Western Reserve University. Handily his result applies to any
system, and particularly, it applies to systems within systems. So in a bank, the
customer line might be one subsystem, and each of the tellers another subsystem, and
Little's result could be applied to each one, as well as the whole thing. The only
requirements are that the system is stable and non-preemptive; this rules out transition
states such as initial startup or shutdown.

In some cases, it is possible to mathematically relate not only the average number in the
system to the average wait but relate the entire probability distribution (and moments)
of the number in the system to the wait.[2]

Imagine a small shop with a single counter and an area for browsing, where only one
person can be at the counter at a time, and no one leaves without buying something. So
the system is roughly:

Entrance → Browsing → Counter → Exit

This is a stable system, so the rate at which people enter the store is the rate at which
they arrive at the counter and the rate at which they exit as well. We call this the arrival
rate. By contrast, an arrival rate exceeding an exit rate would represent an unstable
system, and cause the store to overflow eventually.

Little's Law tells us that the average number of customers in the store, L, is the arrival
rate, λ, times the average time that a customer spends in the store, W, or simply:

Assume customers arrive at the rate of 10 per hour and stay an average of 0.5 hour. This
means we should find the average number of customers in the store at any time to be 5.

Now suppose the store is considering doing more advertising to raise the arrival rate to
20 per hour. The store must either be prepared to host an average of 10 occupants or
must reduce the time each customer spends in the store to 0.25 hour. The store might
achieve the latter by ringing up the bill faster or by walking up to customers who seem
to be taking their time browsing and saying, "Can I help you?".

We can apply Little's Law to systems within the shop. For example, the counter and its
queue. Assume we notice that there are on average 2 customers in the queue and at the
counter. We know the arrival rate is 10 per hour, so customers must be spending 0.2
hour on average checking out.

We can even apply Little's Law to the counter itself. The average number of people at
the counter would be in the range (0, 1) since no more than one person can be at the
counter at a time. In that case, the average number of people at the counter is also
known as the counter's utilization.