The M/M/c with critical jobs

We consider theM/M/c queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach. Copyright Physica-Verlag 1998

MoreLess

Year of publication:	1998
Authors:	Adan, Ivo ; Hooghiemstra, Gerard
Published in:	Computational Statistics. - Springer. - Vol. 47.1998, 3, p. 341-353
Publisher:	Springer
Subject:	M/M/c \| priority queue \| bounds \| matrix methods

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

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