A queueing model with two classes of retrial customers and paired services
Ioannis Dimitriou ()
Annals of Operations Research, 2016, vol. 238, issue 1, 123-143
Abstract:
We mathematically investigate a single server system accepting two types of retrial customers and paired service. If upon arrival a customer finds the server busy, it is routed to an infinite capacity orbit queue according to each type. Upon a service completion epoch, if at least one orbit queue is non-empty, the server seeks to find customers from the orbits. If both orbit queues are non-empty, the seeking process will bring to the service area a pair of customers, one from each orbit. If there is only one non-empty, then a single customer from this orbit queue will be brought to the service area. However, if a primary customer arrives during the seeking process it will occupy the server immediately. It is shown that the joint stationary orbit queue length distribution at service completion epochs is determined by solving a Riemann boundary value problem. Stability condition is investigated, while generalizations of the main model are also discussed. A simple numerical example is obtained and yields insight into the behavior of the system. Copyright Springer Science+Business Media New York 2016
Keywords: Retrial queue; Riemann boundary value problem; Paired service; Constant retrial policy; General retrial times; Stationary distribution (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-015-2059-2 (text/html)
Access to full text is restricted to subscribers.
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:spr:annopr:v:238:y:2016:i:1:p:123-143:10.1007/s10479-015-2059-2
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-015-2059-2
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().