Abstract
In this paper, we analyze systems that can be modelled by M ∨ M ∨ n queues with heterogeneous servers and non informed customers. We solve the balance equations. We present a threshold result for a system with an arbitrary number n of servers, i.e. we show that there is a value of arrival rate below which the slow server should not be used and above which it should be used. The structure of the slow server problem for uninformed costumers is investigated. Results for homogeneous systems are also provided in order to add insight into the structure of the problem.
Similar content being viewed by others
References
F.P. Kelly, Reversibility and Stochastic Networks, (John Wiley, New York, 1979)
L. Kleinrock, Queueing Systems. (John Wiley, New York, 1975–1976) 2v
G Koole, A simple proof of the optimality of a threshold policy in a two-server queueing system, Syst. Control Letters 26 (1995) 301–303.
Woei Lin and P.R. Kumar, Optimal control of a Queueing System with Two Heterogenous Servers IEEE Transactions on Automatic Control AC-29(8) (1983) 696–703.
M. Rubinovitch, The Slow Server Problem, J. Appl. Prob. 22 (1985) 205–213
M. Rubinovitch, The Slow Server Problem: A Queue With Stalling, J. Appl. Prob 22 (1985) 879–892.
J. Walrand, A note on Optimal control of a queueing system with two heterogeneous servers, Syst. Control Letters 4 (1984) 131–134.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by grants from CAPES, CNPq, FAPESP and FAPERJ.
AMS subject classification: 90B22, 60K25, 68M20
Rights and permissions
About this article
Cite this article
Cabral, F.B. The Slow Server Problem for Uninformed Customers. Queueing Syst 50, 353–370 (2005). https://doi.org/10.1007/s11134-005-3283-2
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11134-005-3283-2