Spreadsheet simulation of a queue with arrivals from a finite population

Demonstrates the application of spreadsheets in simulating queuing systems with arrivals from a finite population. The problem is referred to as the machine repair problem where the members of the queue are machines that are breaking down and the servers are the technicians repairing the broken machines. The total number of machines are finite and pre‐specified. The technique for the development of the simulation is illustrated with six machines. Describes the approach for developing a generalized simulation model with any number of machines.