Some inequalities for the queue GI/G/1

Cited in

(53)

Bedienungstheorie: Tendenzen und neuere Entwicklungen. (Servicing theory: Tendencies and new developments)
Moment inequalities for a class of stochastic systems
Analysis of an open tandem queueing network with population constraint and constant service times
An exploration of models that minimize leadtime through batching of arrived orders
Perturbation analysis of the \(GI/GI/1\) queue
Approximating by enhanced interpolation in queueing analyses.
Approximating class-departure variability in tandem queues with downtime events: regression-based variability function
Data-driven robust optimization
Optimal stationary appointment schedules
Stationary queuing systems with dependencies
The Marshall and Stoyan bounds for IMRL/G/1 queues are tight
Analysis of transient queues with semidefinite optimization
Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
WCFS: a new framework for analyzing multiserver systems
Applying optimization theory to study extremal GI/GI/1 transient mean waiting times
Queueing theory
The advantage of indices of dispersion in queueing approximations
Algorithms for the upper bound mean waiting time in the \(\mathrm{GI}/\mathrm{GI}/1\) queue
A semidefinite optimization approach to the steady-state analysis of queueing systems
Setting defect charts control limits to balance cycle time and yield for a tandem production line
When will an elevator arrive?
Technical note -- constant-order policies for lost-sales inventory models with random supply functions: asymptotics and heuristic
Process flexibility: a distribution-free bound on the performance of k-chain
ON THE TIME-DEPENDENT OCCUPANCY DISTRIBUTION OF THE G/G/1 QUEUING SYSTEM
Asymptotically tight steady-state queue length bounds implied by drift conditions
scientific article; zbMATH DE number 3729192 (Why is no real title available?)
Some One-Sided Theorems on the Tail Distribution of Sample Sums with Applications to the Last Time and Largest Excess of Boundary Crossings
Stochastic bounds for the single-server queue
Inequalities for moments of tails of random variables, with a queueing application
Stochastic bounds for the queue GI/G/1 in heavy traffic
Approximation techniques in the solution of queueing problems
Some aspects of queueing theory
Idle period approximations and bounds for the GI/G/1 queue
Bounds on the Mean Delay in Multiclass Queueing Networks under Shortfall-Based Priority Rules
Using robust queueing to expose the impact of dependence in single-server queues
Performance of the smallest-variance-first rule in appointment sequencing
Set-valued performance approximations for the \(GI/GI/K\) queue given partial information
MAD dispersion measure makes extremal queue analysis simple
Transform methods for heavy-traffic analysis
The Missing Piece Syndrome in Peer-to-Peer Communication
On Queues with Interarrival Times Proportional to Service Times
An expansion related to the central limit theorem
Optimale Eigenschaften einiger Wartesysteme bei regelmäßigem Eingang bzw. konstanten Bedienungszeiten
Abschätzungen für die Konvergenz gegen die stationäre Verteilung monotoner M<scp>ARKOWS</scp>cher Prozesse
Heavy-Traffic Analysis of Queueing Systems with No Complete Resource Pooling
Dual sourcing systems: an asymptotic result for the cost of optimal tailored base-surge (TBS) policy
Ergodicity of two class priority queues with preemptive priority
Heavy-traffic limits for nearly deterministic queues: Stationary distributions
Eliciting claims development patterns and costs hidden in backlogs
Data-driven approximation of distributionally robust chance constraints using Bayesian credible intervals
Second-order bounds for the M/M/s queue with random arrival rate
Limit theorems for Markov chains of finite rank
Stable and scalable universal swarms

This page was built for publication: Some inequalities for the queue GI/G/1

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