A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards
From MaRDI portal
Publication:5031622
DOI10.1287/opre.2020.2015zbMath1482.90067OpenAlexW3130305711MaRDI QIDQ5031622
Yichuan Ding, Mahesh Nagarajan, S. Thomas McCormick
Publication date: 16 February 2022
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2020.2015
networkstochastic modelspriority queuesflow algorithmskidney allocationfluid sample pathmin cost max flownested cuts for parameterized networkparallel server systemvalue-based routing
Related Items (2)
Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities ⋮ Applications of fluid models in service operations management
Cites Work
- Unnamed Item
- Unnamed Item
- Queueing with redundant requests: exact analysis
- A product form solution to a system with multi-type jobs and multi-type servers
- The \(G_{t}/GI/s_{t}+GI\) many-server fluid queue
- Large-time asymptotics for the \(G_{t}/M_{t}/s_{t}+GI_{t}\) many-server fluid queue with abandonment
- Structural and algorithmic properties for parametric minimum cuts
- Optimal control of parallel server systems with many servers in heavy traffic
- Control of systems with flexible multi-server pools: a shadow routing approach
- Fluid limits and diffusion approximations for networks of multi-server queues in heavy traffic
- MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
- Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
- Stochastic-Process Limits
- Shadow-Routing Based Control of Flexible Multiserver Pools in Overload
- 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
- Dynamic Control of N-Systems with Many Servers: Asymptotic Optimality of a Static Priority Policy in Heavy Traffic
- Service-Level Differentiation in Many-Server Service Systems via Queue-Ratio Routing
- The cμ/θ Rule for Many-Server Queues with Abandonment
- Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
- A Broader View of Designing the Liver Allocation System
- Simplified Control Problems for Multiclass Many-Server Queueing Systems
- Process Flexibility: A Distribution-Free Bound on the Performance of k-Chain
- Heavy Traffic Response Times for a Priority Queue with Linear Priorities
- Fcfs infinite bipartite matching of servers and customers
- A Dynamic Priority Queue with General Concave Priority Functions
- Improved Algorithms for Bipartite Network Flow
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- A Fast Parametric Maximum Flow Algorithm and Applications
- Stabilizing Customer Abandonment in Many-Server Queues with Time-Varying Arrivals
- Process Flexibility for Multiperiod Production Systems
- The Bipartite Rationing Problem
- Reversibility and Further Properties of FCFS Infinite Bipartite Matching
- 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
- Patient Choice in Kidney Allocation: A Sequential Stochastic Assignment Model
- Time Dependent Priority Queues
- Some problems in queueing with dynamic priorities
This page was built for publication: A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards
