Approximate analysis of open networks of queues with blocking: Tandem configurations
IEEE Transactions on Software Engineering
On queueing network models of flexible manufacturing systems
Queueing Systems: Theory and Applications
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
A Queueing Model with Finite Waiting Room and Blocking
Journal of the ACM (JACM)
Queueing networks with blocking: a bibliography
ACM SIGMETRICS Performance Evaluation Review
Modeling the blocking phenomenon of service facilities
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.98 |
While there is an extensive literature dealing with the study of queuing systems with finite capacities, a common characteristic of all these studies is the assumption of the single class of customers (jobs). In this paper we devise a model to capture the dynamics of such a system but with the assumption that arriving jobs have different service priorities. An approximation procedure, based on decomposition, is developed for the computation of the main characteristics of the model. The approximation procedure was validated using simulation data. The approximate results seem to have an acceptable error level.