On the Optimal Design of a Bipartite Matching Queueing System
From MaRDI portal
Publication:5031017
DOI10.1287/opre.2020.2027zbMath1482.90059OpenAlexW3128553668MaRDI QIDQ5031017
No author found.
Publication date: 18 February 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2020.2027
stochastic modelsbipartite matchingsteady-state analysisfirst-come-first-servedmulti-class queueing systemflexibility design
Related Items (2)
Dynamic Stochastic Matching Under Limited Time ⋮ Applications of fluid models in service operations management
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
- Optimal control of parallel server systems with many servers in heavy traffic
- Heavy traffic analysis of a system with parallel servers: Asymptotic optimality of discrete-review policies
- On the instability of matching queues
- Heavy traffic resource pooling in parallel-server systems
- Design heuristic for parallel many server systems
- Reward maximization in general dynamic matching systems
- Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic
- Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders
- Stability of the Bipartite Matching Model
- Bayesian Mechanism Design
- Exact FCFS Matching Rates for Two Infinite Multitype Sequences
- A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments
- Stability of the stochastic matching model
- Construction of Asymptotically Optimal Control for a Stochastic Network from a Free Boundary Problem
- Design for Process Flexibility: Efficiency of the Long Chain and Sparse Structure
- Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing
- Process Flexibility in Supply Chains
- Recipient Choice Can Address the Efficiency-Equity Trade-off in Kidney Transplantation: A Mechanism Design Model
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- A Broader View of Designing the Liver Allocation System
- Modeling and analysis of flexible queueing systems
- Dynamic Kidney Exchange
- Fcfs infinite bipartite matching of servers and customers
- A Queueing System with General-Use and Limited-Use Servers
- Resource pooling in queueing networks with dynamic routing
- Flexible Queueing Architectures
- Efficient Dynamic Barter Exchange
- On the generation of all topological sortings
- Queuing Models with Lane Selection: A New Class of Problems
- Principles on the Benefits of Manufacturing Process Flexibility
- A Little Flexibility Is All You Need: On the Asymptotic Value of Flexible Capacity in Parallel Queuing Systems
- Optimal dynamic matching
- Min-Cost Bipartite Perfect Matching with Delays
- Dynamic Matching for Real-Time Ride Sharing
- On Matching and Thickness in Heterogeneous Dynamic Markets
- Process Flexibility for Multiperiod Production Systems
- Empty-Car Routing in Ridesharing Systems
- Reversibility and Further Properties of FCFS Infinite Bipartite Matching
- Fairness, Efficiency, and Flexibility in Organ Allocation for Kidney Transplantation
- Blind Fair Routing in Large-Scale Service Systems with Heterogeneous Customers and Servers
- Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cμ-Rule
- Sparse Process Flexibility Designs: Is the Long Chain Really Optimal?
This page was built for publication: On the Optimal Design of a Bipartite Matching Queueing System
