Directed FCFS infinite bipartite matching
From MaRDI portal
Publication:2052427
DOI10.1007/s11134-020-09676-6zbMath1475.60190arXiv1912.00489OpenAlexW3110494557MaRDI QIDQ2052427
Publication date: 26 November 2021
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.00489
matching ratesparallel service systemsdynamic online matchingFCFS matchingmatching delaystwo-sided queues
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Cites Work
- Queueing with redundant requests: exact analysis
- A product form solution to a system with multi-type jobs and multi-type servers
- Modeling the transplant waiting list: A queueing model with reneging
- On the instability of matching queues
- Perishable inventory systems with impatient demands
- Design heuristic for parallel many server systems
- Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments
- Double-Sided Batch Queues with Abandonment: Modeling Crossing Networks
- Stability of the stochastic matching model
- Letter to the Editor—A Doubled-Ended Queuing Problem of Kendall
- Fcfs infinite bipartite matching of servers and customers
- Poisson Arrivals See Time Averages
- Reversibility and Further Properties of FCFS Infinite Bipartite Matching
