Waiting Time Density, One Server (M/M/1)
This chapter shows how to calculate the waiting time probabilities for a one-server system, with infinite capacity, exponential inter-arrival times and exponential service times, where the customers are serviced in a first-in-first-out discipline. An example is when a city designs a beat for a squad car and wants to determine the probability that at least 90 percent of the calls received for the beat can begin service within 10 min. The squad car is the service facility and the calls within the beat are the arrivals. Examples are presented.