ADM 3301 Lecture Notes - Lecture 13: Amusement Park

29 views2 pages

lilachippopotamus32

1 Aug 2018

School

Department

Course

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

> probability the system is empty - p0. > probability that a customer waits for service. > probability that there are k customers in the system - pk. > service level probability that a customer waits less than t time units for service. > in queuing system we commonly use a three-symbol notation, known as kendall"s notation : M = poisson; d = constant; g = general. M = exponential; d = constant; g = general s: number of servers (channels) 4. arrivals are served on a fifo basis 5. exponential service times. > an m/m/s queue is the same as an m/m/1 queue except that there may be more than one server. > in this model, there is a single buffer and s servers in the resource pool. > jobs are processed on a fifo basis. > when there are more than s jobs in the system, the buffer is occupied and waiting for service occurs.

Related Questions

A fast-food franchise is considering operating a drive-up window food-service operation. Assume that customer arrivals follow a Poisson probability distribution, with an arrival rate of 24 cars per hour, and that service times follow an exponential probability distribution. Arriving customers place orders at an intercom station at the back of the parking lot and then drive to the service window to pay for and receive their orders. The following three service alternatives are being considered:

System A: A single-server operation in which one employee fills the order and takes the money from the customer. The average service time for this alternative is 2 minutes.

System B: A single-server operation in which one employee fills the order while a second employee takes the money from the customer. The average service time for this alternative is 1.25 minutes.

System C: A two-server operation with two service windows and two employees. The employee stationed at each window fills the order and takes the money for customers arriving at the window. The average service time for this alternative is 2 minutes for each server.

The following cost information is available.

Customer waiting time is valued at $25 per hour to reflect the fact that waiting time is costly to the fast-food business.

The cost of each employee is $6.50 per hour.

To account for equipment and space, an additional cost of $20 per hour is attributable to each server.

What is the lowest-cost design for the fast-food business? If required, round your answers to two decimal places.

	Total Cost
System A	$
System B	$
System C	$

System A, B, or C is the most economical.

apricotturtle245

ADM 3301 Lecture Notes - Lecture 13: Amusement Park

Document Summary

Get access

Related Documents

ADM 3301 Lecture Notes - Lecture 12: Poisson Distribution, Markov Chain, Exponential Distribution

ADM 3301 Lecture Notes - Lecture 11: Exponential Distribution, Takers, Standard Deviation

ADM 3301 Lecture Notes - Lecture 10: Service Level, Triage, Queueing Theory

Related Questions