Simulation , frequency distribution, Operation Research

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

Replacement theory.., a pipe lis dur for rpair,the repair would cost 10000 ...

a pipe lis dur for rpair,the repair would cost 10000 and it would last for 3 years.alternatively a new pipe line can be purchase at 30000 for 10 years.assuming 10% depriciation rat

Linear programming, A paper mill produces two grades of paper viz., X and Y...

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

Operations research 2, management wants to know how many supervisors should...

management wants to know how many supervisors should be hired, and what could be the optimum workload distribution to be applied, given a number of constraints

Answering questions for minimum spanning tree problems, Sample Assignment f...

Sample Assignment for minimum spanning tree problems For the subsequent graph get the minimum spanning tree. The numbers on the branches presents the cost.

#title. solution, Solve the following Linear Programming Problem using Simp...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2

#methode, #what are the methods of OR ?

#what are the methods of OR ?

Census method, Census Methods Complete Enumeration: If detail informat...

Census Methods Complete Enumeration: If detail information regarding every individual person or item of a given universe ( or population ) is collected then the enquir

Linear programming problem, A paper mill produces two grades of paper viz.,...

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

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Write Your Message!

Name

Email id

Message

Verfication Code

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!

Submit Assignment

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