Robustness of Rootfinding in Single-Server Queueing Models
From MaRDI portal
Recommendations
- Using robust queueing to expose the impact of dependence in single-server queues
- Multiple roots in some equations of queueing theory
- Robust optimal service analysis of single-server re-entrant queues
- Robustness of queuing network formulas
- Robust queueing theory
- Convergence rates of perturbation-analysis-Robbins-Monro-single-run algorithms for single server queues
- Analytic and computational analysis of the discrete-time GI/D-MSP/1 queue using roots
- A new method for finding the characteristic roots of \(E_{n }/E_{m }/1\) queues
- Robust queueing theory: an initial study using imprecise probabilities
Cited in
(35)- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- Analytic and computational analysis of the discrete-time GI/D-MSP/1 queue using roots
- Analyzing a single hyper-exponential working vacation queue from its governing difference equation
- Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\)
- A simple and complete computational analysis of MAP/R/1 queue using roots
- Stationary analysis and optimal control under multiple working vacation policy in a \(\mathrm{GI/M}^{(a,b)}/1\) queue
- A new method for finding the characteristic roots of \(E_{n }/E_{m }/1\) queues
- Markovian queueing models with periodic-review
- Waiting time in a combined first-come-first-served and shortest-time-first queue.
- Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue
- scientific article; zbMATH DE number 98645 (Why is no real title available?)
- The queue \(\mathrm{Geo}/\mathrm{G}/1/N + 1\) revisited
- Computing steady-state queueing-time distributions of single-server queues:GI X /M/1
- Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
- A simple procedure to determine the queue length and waiting time distributions for \(M/G^{a, b}/1\) queueing system
- Analysis of system length and waiting time distributions in BMAP /G/1 queue using characteristic roots
- A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: \(\mathrm{GI}/\mathrm{C-MSP}^{a,b}/1/\infty\)
- Analysis of queueing-time distributions for MAP/DN/1 queue
- Difference equations approach for multi-server queueing models with removable servers
- Analytic computation schemes for the discrete-time bulk service queue
- Equilibrium balking strategies in renewal input queue with Bernoulli-schedule controlled vacation and vacation interruption
- Waiting-time analysis of D-BMAP/G/1 queueing system
- A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues
- Analytically explicit results for the GI/C-MSP/1/ queueing system using roots
- Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach
- Relaxation time for the discrete \(D/G/1\) queue
- Finding the roots of a non-linear equation: history and reliability
- Robust optimal service analysis of single-server re-entrant queues
- Computational analysis of bulk service queue with Markovian arrival process: MAP/R\(^{(a,b)}/1\) queue
- Travel time estimation and order batching in a 2-block warehouse
- The queue GeoX/G/1/N+1 revisited
- Roots, symmetry, and contour integrals in queuing-type systems
- Multiple roots in some equations of queueing theory
- Computational procedure for system length and waiting-time distribution in an m^x/D/c/N queue
This page was built for publication: Robustness of Rootfinding in Single-Server Queueing Models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4025921)
