Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Numerical investigation of a multiserver retrial model
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
The M/G/1 retrial queue with Bernoulli schedule
Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Some analytical results for congestion in subscriber line modules
Queueing Systems: Theory and Applications
A retrial BMAP/SM/1 system with linear repeated requests
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
A Multi-Server Retrial Queue with BMAP Arrivals and Group Services
Queueing Systems: Theory and Applications
Single server retrial queues with priority calls
Mathematical and Computer Modelling: An International Journal
MAP1, MAP2/M/c retrial queue with the retrial group of finite capacity and geometric loss
Mathematical and Computer Modelling: An International Journal
Queueing system BMAP/G/1 with repeated calls
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Gated polling models with customers in orbit
Mathematical and Computer Modelling: An International Journal
Accessible bibliography on retrial queues
Mathematical and Computer Modelling: An International Journal
A perishable inventory system with service facilities and retrial customers
Computers and Industrial Engineering
A multi-server perishable inventory system with negative customer
Computers and Industrial Engineering
Hi-index | 0.98 |
In this paper, we consider a queuing model in which two types of customers, say, Types 1 and 2, arrive according to a Markovian arrival process (MAP). Type 1 customers have a buffer of capacity K and are served in groups of varying sizes ranging from a predetermined value L to a maximum size, K. The service times are exponentially distributed. Type 2 customers are served one at a time and the service times are assumed to be exponential. The system has two servers, of which one is totally dedicated to serving Type 2 customers. The other server can serve both Types 1 and 2 customers. Any arriving Type 1 customer finding the buffer full is considered lost. Any Type 2 customer not entering into service immediately orbit in an infinite space. These orbiting customers compete for service by sending out signals that are exponentially distributed. The steady state probability vector of this queuing model is of matrix-geometric type with a highly sparse rate matrix. This sparsity is exploited in the analysis and several interesting numerical examples are discussed. The Laplace-Stieltjes transform LST of the waiting time distribution of a Type 1 customer at an arrival epoch is derived.