Parallel multi-type many server conjecture
From MaRDI portal
Publication:2146395
DOI10.1007/s11134-022-09742-1zbMath1491.90072OpenAlexW4293100308WikidataQ113900593 ScholiaQ113900593MaRDI QIDQ2146395
Publication date: 16 June 2022
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-022-09742-1
Cites Work
- Queueing with redundant requests: exact analysis
- Asymptotic approximations for stationary distributions of many-server queues with abandonment
- Fluid limits of many-server queues with reneging
- On the stability of a partially accessible multi-station queue with state-dependent routing
- Many-server scaling of the N-system under FCFS-ALIS
- Quasi-reversible multiclass queues with order independent departure rates
- Design heuristic for parallel many server systems
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments
- Queue-and-Idleness-Ratio Controls in Many-Server Service Systems
- Fcfs infinite bipartite matching of servers and customers
- Reversibility and Further Properties of FCFS Infinite Bipartite Matching
This page was built for publication: Parallel multi-type many server conjecture
