Simulation , frequency distribution, Operation Research

Assignment Help:
The Neatee Eatee Hamburger Joint specializes in soyabean burgers. Customers arrive according to the following inter - arrival times between 11.00 am and 2.00 pm:

Interval-arrival times [mts] probability

3 0.30

5 0.20

6 0.15

8 0.20

10 0.15

People who want burgers arrive in single or groups [2 or more]. The following distribution of arrivals has been observed:

# of people probability

1 0.40

2 0.30

3 0.20

4 0.10

Each customer orders between 1 or 2 burgers as shown below:

Burger/person probability

1 0.75

2 0.25

Due to fluctuation in burger eating habits, time taken per burger is:

Length of stay [mts] probability

10 0.25

15 0.45

20 0.35

[if a group enters the joint, the time in the system for the group is determined by the longest length of stay for an individual in the group]

Simulate the behavior of the hamburger joint for 10 hours

a.how many burgers would have to be made on average per hour?
b.What is the frequency distribution of the stay of a group [2 or more] in the dining area?

Related Discussions:- Simulation , frequency distribution

Simplex method of LP, MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 = 200 - ...

MAX: 150 X1 + 250 X2 Subject to: 2 X1 + 5 X2 = 200 - resource 1 3 X1 + 7 X2 = 175 - resource 2 X1, X2 = 0 2. How many units of resource 1 are cons

Transportation, we have three reservoirs with daily supplies of15, 20 and 2...

we have three reservoirs with daily supplies of15, 20 and 25 litres of fresh water respectively. on each day we must supply four cities A B C D whose demands are 8 10 12 and 15 res

Lp, #question.Solve the following Linear Programming Problem using Simple m...

#question.Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0.

LPP using Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Linear programing, Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly ...

Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly explain x1,x2,x3;term labour,metal&plastic;the160hours;x1,x2&x3>=0

LP - Assignment problem, I have looked at Hungarian algorithm to solve assi...

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.

Assignment, A paper mill produces two grades of paper viz., X and Y. Becaus...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Research design and methodology , Case Study - Research Design RJR N...

Case Study - Research Design RJR Nabisco Ever since the health aspects  of smoking  became  a public  issue  shortly after world war II the tobacco industry knew there

Sequencing, how the sequencing techniques help the manager

how the sequencing techniques help the manager

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd