A system with parallel serving stations where every station has its own queue can be abstracted to a system that has identical stations. In such a system a client can choose a serving station following a random mechanism. Often, such systems divide the clients in classes and allocate serving station to a specific class of clients. Such models imply that every client chooses to be served by a working station within its own class. Systems with multiple client classes have no corresponding analytical models that study them. This paper presents a study method using a discrete simulation approach. It is proved in the paper that the proposed algorithm has a polynomial complexity. The implementation of the algorithm is achieved by an object oriented approach.
Queuing System, Waiting Queue for Every Station, Simulation Algorithm, Polynomial Complexity, Different Classes of Stations
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).