Robustness of Rootfinding in Single-Server Queueing Models

DOI10.1287/ijoc.2.3.273zbMath0760.60081OpenAlexW2128430094MaRDI QIDQ4025921

Mohan L. Chaudhry, William G. Marchal, Carl M. Harris

Publication date: 18 February 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2.3.273

zbMATH Keywords

computational resultsqueueing problemscomputational difficultiesnumerical rootfinding

Mathematics Subject Classification ID

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

Related Items (27)

Stationary analysis and optimal control under multiple working vacation policy in a \(\mathrm{GI/M}^{(a,b)}/1\) queue ⋮ Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue ⋮ ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS ⋮ Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots ⋮ Difference equations approach for multi-server queueing models with removable servers ⋮ Finding the roots of a non-linear equation: history and reliability ⋮ The queue GeoX/G/1/N+1 revisited ⋮ Analysis of queueing-time distributions for MAP/D_N/1 queue ⋮ A simple and complete computational analysis of MAP/R/1 queue using roots ⋮ Markovian queueing models with periodic-review ⋮ Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues ⋮ 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 ⋮ Computing steady-state queueing-time distributions of single-server queues:GI X /M/1 ⋮ Equilibrium balking strategies in renewal input queue with Bernoulli-schedule controlled vacation and vacation interruption ⋮ Travel time estimation and order batching in a 2-block warehouse ⋮ Waiting time in a combined first-come-first-served and shortest-time-first queue. ⋮ Exact and approximate numerical solutions to steady-state single-server queues: \(M/G/1\) -- a unified approach ⋮ Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\) ⋮ The queue \(\mathrm{Geo}/\mathrm{G}/1/N + 1\) revisited ⋮ Computational analysis of bulk service queue with Markovian arrival process: MAP/R\(^{(a,b)}/1\) queue ⋮ A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)] ⋮ Waiting-time analysis of D-BMAP/G/1 queueing system ⋮ Unnamed Item ⋮ A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method:GI/C-MSP^(a,b)/1/∞ ⋮ Relaxation time for the discrete \(D/G/1\) queue ⋮ Analytic computation schemes for the discrete-time bulk service queue ⋮ Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system

This page was built for publication: Robustness of Rootfinding in Single-Server Queueing Models