Approximation of the Overflow Process from a G/M/N/K Queueing System

Behnam Pourbabai
Additional contact information
Behnam Pourbabai: Graduate School of Business Administration, New York University, New York, New York 10006

Management Science, 1987, vol. 33, issue 7, 931-938

Abstract: The overflow process from a G/M/N/K queueing system with a stationary counting arrival process, Markovian service times, N parallel homogeneous servers, and K waiting spaces, is asymptotically approximated by a two parameter method. Numerical results are presented and approximation outcomes are compared against those from a simulation study.

Keywords: approximation; overflow process; finite queueing systems (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.33.7.931 (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:ormnsc:v:33:y:1987:i:7:p:931-938

Access Statistics for this article

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