Consider a queuing system with two parallel servers and a single

waiting line: customers join a single line if both servers are busy. They are eventually

serviced by the first free server. If a customer arrives while both servers are idle, $($s$)$he then

prefers server $1,$ who happens to work faster. The interarrival times of the customers are

known to be:

Interarrival Time $($mins$)$ Probability

$50\mathrm{.}35$

$100\mathrm{.}40$

$150\mathrm{.}25$

The service time for the first server is Uniform$(15,20)$ minutes, and it is Uniform$(14,24)$

minutes for the second server