A two-class queueing system with constant retrial policy and general class dependent service times

Ioannis Dimitriou

European Journal of Operational Research, 2018, vol. 270, issue 3, 1063-1073

Abstract: A single server retrial queueing system with two-classes of orbiting customers, and general class dependent service times is considered. If an arriving customer finds the server unavailable, it enters a virtual queue, called the orbit, according to its type. The customers from the orbits retry independently to access the server according to the constant retrial policy. We derive the generating function of the stationary distribution of the number of orbiting customers at service completion epochs in terms of the solution of a Riemann boundary value problem. For the symmetrical system we also derived explicit expressions for the expected delay in an orbit without solving a boundary value problem. A simple numerical example is obtained to illustrate the system’s performance.

Keywords: Queueing; Two-class retrial queue; Boundary value problem; Delay analysis; Embedded Markov chain (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037722171830211X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:270:y:2018:i:3:p:1063-1073

DOI: 10.1016/j.ejor.2018.03.002

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().