A B C D E F G H I J K L M N O

1 Queueing at fast-foods restaurant Question

2 A fast-food restaurant has one drive-through window. On average, 40 customers arrive per hour at the window. It takes an average of 1
3 Inputs minute to serve a customer. Assume that interarrival and service times are exponentially distributed.
a. On average, how many customers are waiting in line?
4 Unit of time hour b. On average, how long does a customer spend at the restaurant (from time of arrival to time service is completed)?
5 Arrival rate 40 customers/hour c. What fraction of the time are more than three cars in line? (Here, the line includes the car, if any,
6 Service rate 60 customers/hour being serviced.)
d. What percentage of customers spend more than 3 minutes in the queue?
7
8 Outputs
9 Direct outputs from inputs Distribution of number in system Distribution of time in queue
10 Mean time between arrivals 0.025 hours n (customers) P(n in system) t (in hours) P(wait > t)
11 Mean time per service 0.017 hours 0 0.333 0.050 0.245
12 Traffic intensity 0.667 1 0.222
13 2 0.148 Answers:
14 Summary measures 3 0.099
a. On average, 1.333 customers are waiting in line
15 Expected number in system 2.000 customers
16 Expected number in queue 1.333 customers Prob >3 cars 0.198 b. On average, a customer spends 0.05hours or 3 min at the restaurant
17 Expected time in system 0.050 hours
c. 19.8% of the time there are more than 3 cars in line/queue d.
18 Expected time in queue 0.033 hours 24.5% of all customers spend more than 3minutes in the queue
19 Percentage who don't wait in queue 33.3%
20
21 Formulas:
22 λ = arrival rate (mean number of arrivals per time period)
μ = service rate (mean number of people or items served per time Mean time between arrivals = 1/ λ
23 period) The mean service time per customer = 1/ μ
24 ρ = traffic intensity = λ/μ
25 L = the expected number of customers in the system
LQ = the expected number of customers in the queue L = λW
26 LS = the expected number of customers in service LQ = λWQ
27 P(all idle) = the probability that all servers are idle Ls = λWs
28 P(all busy) = the probability that all servers are busy L = LQ + Ls
W = the expected time spent in the system (waiting in line or being W = WQ + Ws
29 served) U = Ls / s
30 WQ = the expected time spent in the queue
WS = the expected time spent in service Formulas for M/M/1
31
pn = (1 — ρ) ρⁿ ,n≥ 0 (Distribution of number in system)
32 U = server utilization (the long-run fraction of time the server is busy) L= ρ / (1-ρ) = λ / (μ - λ)
33 ρ = traffic intensity U=ρ
s = number of serves W=L/λ
34 WQ = W -(1 / μ)
35 LQ = λWQ
36 P(Time in Q > t) = ρe^(-μ(1-ρ)t ) for any t > 0 (Distribution of time in
queue)
37
38
39
40
41
42

Problem 11.13