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

Abstract

We can think of the queuing system with several parallel stations as having a corresponding queue for every station at which the arrived clients join. The queued clients joined at a particular station are served based on a certain serving discipline. This paper presents a simulation algorithm for the queuing system, where every station has its own queue, and serving discipline is based on dividing the clients into priority classes, the preemption of the served customers being permitted. One proves the polynomial complexity of the proposed algorithm. Also, we present the object-oriented approach of the system.