Approximating Many Server Queues by Means of Single Server Queues

DOI10.1287/MOOR.3.3.205MaRDI QIDQ4174055zbMATH OpenOpenAlexFDO

Authors Elja Arjas, Tapani Lehtonen

Publication date 1978

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.3.3.205

zbMATH Keywords

Approximating Many Server QueuesService TimesSingle-Server Queues

Mathematics Subject Classification ID

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

Cited in

(15)

• Stability, monotonicity and invariant quantities in general polling systems
• Discontinuity of the percolation density in one dimensional \(1/| x- y| ^ 2\) percolation models
• On exact distribution for multivariate weighted distributions and classification
• Stochastic comparisons of order statistics,with applications in relibility
• Multivariate excess wealth ordering of generalized order statistics
• New multivariate aging notions based on the corrected orthant and the standard construction
• The multivariate hazard construction
• Optimal payoffs under state-dependent preferences
• On relative skewness for multivariate distributions
• Comparison of multivariate risks and positive dependence
• On a new NBUE property in multivariate sense: an application
• Efficient dependency models: simulating dependent random variables
• Multidimensional inequalities and generalized quantile functions
• A characterization of the multivariate excess wealth ordering
• On the distributional transform, Sklar's theorem, and the empirical copula process

This page was built for publication: Approximating Many Server Queues by Means of Single Server Queues

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