Queues with heterogeneous servers and uninformed customers: who works the most?

MaRDI QIDQ6205809zbMATH OpenFDO

Authors F. B. Cabral

Publication date 4 June 2007

Abstract: In this paper, we consider systems that can be modelled by $MmidMmidn$ queues with heterogeneous servers and non informed customers. Considering any two servers: we show that the probability that the fastest server is busy is smaller than the probability that the slowest server is busy. Moreover, we show that the effective rate of service done by the fastest server is larger than effective rate of service done by the slowest server.

This page was built for publication: Queues with heterogeneous servers and uninformed customers: who works the most?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6205809)