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

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.

MoreLess

Year of publication:	1987
Authors:	Pourbabai, Behnam
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 33.1987, 7, p. 931-938
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	approximation \| overflow process \| finite queueing systems

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.33.7.931 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009214830