Service station factors in monotonicity of retrial queues

Authors:
Liang Huei-Mei
Affiliations:
Department of Business Management National Sun Yat-Sen University, Taiwan R.O.C.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1999

Citing 4
Cited 4

A survey on retrial queues

Queueing Systems: Theory and Applications
A survey of retrial queues

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

Frontiers in queueing
Stochastic inequalities for M/G/1 retrial queues

Operations Research Letters

Monotonicity properties in various retrial queues and their applications

Queueing Systems: Theory and Applications
Approximations of retrial queue with limited number of retrials

Computers and Operations Research
Unreliable M/G/1 retrial queue: monotonicity and comparability

Queueing Systems: Theory and Applications
Stochastic inequalities for M/G/1 retrial queues with vacations and constant retrial policy

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.98

Visualization

Abstract

A retrial queue consists of an orbit with infinite capacity, a service station, and a queue with finite capacity B. If any customer attempting the queue is blocked due to saturation, he then enters the orbit where the customer waits for some time, called retrial time, before the next retrial attempt. We show that if the hazard rate function of the retrial time distribution is decreasing, then stochastically longer service time or less servers will result in more customers in the system.