3 Exercise 4 Exercise 1. All four machines are identical and perfectly reliable. Initially, all machines are idle. The interarrival times are exponentially distributed.
Any idle machine can process an arriving part.
However, if all machines are busy, the arriving part leaves without being serviced. Answer the following questions. Draw the state transition rate diagram for this queueing system. Express all rates as rates per minute. These machines require attention only when an exception occurs.