Asymptotic bounds for an optimal state-dependent retrial rate of the M/M/1 queue with returning customers

Authors:
A. Elcan
Affiliations:
Department of Mathematics, University of Colorado Campus Box 395, Boulder, CO 80309-0395, U.S.A. and US WEST Advanced Technologies 4001 Discovery Drive Boulder, CO 80303, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1999

Citing 3
Cited 0

Optimal incentive-compatible priority pricing for the M/M/1 queue

Operations Research
A survey of retrial queues

Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications
Retrial queues with server subject to breakdown and repairs

Queueing Systems: Theory and Applications - Special issue of queueing systems, theory and applications

Quantified Score

Hi-index	0.98

Visualization

Abstract

In this paper, we examine the zero capacity M/M/1 queue with returning customers. Asymptotic bounds for the optimal state dependent retrial rate are derived, where the state of the process is determined by queue length and server status. This optimal return rate minimizes the penalty cost to a customer for waiting and checking in to verify that the server is busy. It will be shown that the problem reduces to three cases characterized by a linear relationship between four system parameters: customer arrival rate, service rate, competing retrial rate, and cost. In two of these cases, asymptotic bounds are tight.