A dynamic-server queuing simulation

We develop a queuing simulation algorithm that systematically adjusts the number of servers in a system. It applies to systems with a single waiting line but multiple servers. We impose a few realistic assumptions then use the algorithm to simulate random Poisson arrivals and exponential service. The results show that the proposed algorithm increases the system's efficiency and customer satisfaction relative to existing models.