Question: Q 1 . Cuts - R - Us provides low - cost haircuts at a shopping center in Boise, Idaho. During the day, customers arrive
Q CutsRUs provides lowcost haircuts at a shopping center in Boise, Idaho. During the day, customers arrive at an average rate of per hour following an exponential distribution. After a customer is in a cosmeticians chair, it takes an average of minutes for the haircut to be completed, with the actual service time following a Poisson distribution.
a If there are cosmeticians on duty, how long will customers have to wait on average before receiving service and how many customers are typically waiting for service?
b If there are cosmeticians on duty, how long will customers have to wait on average before receiving service and how many customers are typically waiting for service?
c If there are cosmeticians on duty, how long will customers have to wait on average before receiving service and how many customers are typically waiting for service?
d If you managed this store, how many cosmeticians would you employ and why?
Solve it in Excel using the queuing theory problem that can be modeled using the MMc queuing system.
Problem Breakdown:
Arrival rate lambda: Customers arrive at a rate of per hour.
Service rate mu: Each cosmetician can serve at a rate of haircut per minutes or per hour.
Number of servers c: There are cosmeticians
Calculate on Excel:
U Utilization factor, of the time that all servers are busy.
P Prob. that there are no units zero in the system.
Lq Avg number of units in line waiting for service.
L Avg number of units in the system inline & being served
Wq Avg time a unit spends in line waiting for service.
W Avg time a unit spends in the system inline & being served
Pw Prob. that an arriving unit has to wait for service.
Pn Prob. of n units in the system
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
