On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes

P. J. Courtois and J. Georges
Additional contact information
P. J. Courtois: MBLE Research Laboratory, Brussels, Belgium
J. Georges: MBLE Research Laboratory, Brussels, Belgium

Operations Research, 1971, vol. 19, issue 2, 424-435

Abstract: This paper generalizes the M / G /1 queuing process by considering both the arrival and the service rates as being essentially arbitrary functions of the current number of customers in the system, and by assuming, moreover, that the amount of service demanded by a customer is conditioned by the queue length at the moment service is begun for that customer. Taking the imbedded Markov chain approach, the paper proposes a method for calculating (1) the limiting probability distribution of the congestion and (2) the expected value of the time needed to complete a service. An expression for the distribution of the waiting time is then given and its first moment deduced.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.2.424 (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:19:y:1971:i:2:p:424-435

Access Statistics for this article

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