A Simulation Algorithm for Queuing Systems with Parallel Working Stations Having One’s Own Queue for Every Station

Abstract

We can think of the queuing system as having only one queue to all stations, where the client joins in order to be served when there is a free station or every station has its own queue where arrived clients join. In the first case, for some distributions of the inter-arrival and service time and serving discipline, there are analytical methods. For the second case, there are no such techniques. The paper presents a studying method for this system class, based on discrete events simulation. One proves the polynomial complexity of the proposed algorithm. Also, we present the object-oriented approach of the system.