Technical Note—The Expected Remaining Service Time in a Single Server Queue

Demetrios Fakinos
Additional contact information
Demetrios Fakinos: University of Essex, Essex, England

Operations Research, 1982, vol. 30, issue 5, 1014-1018

Abstract: For the G / G /1 queueing system, let ( p n ), n = 0, 1, 2, …, and ( r n ), n = 0, 1, 2, … be the limiting probability distributions of the number of customers in the system, when the system is considered “at any time” and when it is considered at arrival epochs respectively. Also let b n ( n = 1, 2, …) be the mean remaining duration of the service in progress at the epoch of an arrival which finds n customers in the system. In this note, a relation between the sequences ( p n ), ( r n ) and ( b n ) is given and it is used to provide alternative derivations for two well-known results in the theory of queues.

Keywords: 681; a; note; on; the; G/G/1; queueing; system (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.5.1014 (application/pdf)

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:inm:oropre:v:30:y:1982:i:5:p:1014-1018

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().