scientific article; zbMATH DE number 431647

MaRDI QIDQ3138423zbMATH OpenFDO

Authors A. Ya. Kreĭnin, C. D. Trengove, D. J. Daley

Publication date 6 April 1994

zbMATH Keywords

stationary solutionapproximationsextreme queueing systemsmany- server queueing system

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• Technical Note—A Note on Waiting Times in Single Server Queues
• Some comparability results for waiting times in single- and many-server queues
• Convex ordering of the attained waiting times in single-server queues and related problems
• ON THE RELAXATION TIME FOR SINGLE SERVER QUEUES
• Waiting time asymptotics in the single server queue with service in random order
• A Note on Convexity of the Expected Delay Cost in Single-Server Queues
• Waiting times in queueing networks with a single shared server
• Stationary queue-length and waiting-time distributions in single-server feedback queues
• scientific article; zbMATH DE number 1229526

Cited in

(16)

• Simple Inequalities for the D/G/1 Queue
• Optimal stationary appointment schedules
• The Marshall and Stoyan bounds for IMRL/G/1 queues are tight
• Long range dependence of point processes, with queueing examples
• Convex ordering of the attained waiting times in single-server queues and related problems
• Set-valued performance approximations for the \(GI/GI/K\) queue given partial information
• Sharp bounds for exponential approximations of NWUE distributions
• Delay Moment Bounds for Multiserver Queues with Infinite Variance Service Times
• Idle period approximations and bounds for the GI/G/1 queue
• Sharp bounds for exponential approximations under a hazard rate upper bound
• Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
• Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
• Conditions for finite moments of waiting times in G/G/1 queues
• Inequalities for queues with a learning server
• Approximations and bounds for the variance of steady-state waiting times in a GI/G/1 queue
• Applying optimization theory to study extremal \(GI/GI/1\) transient mean waiting times

This page was built for publication:

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