Fcfs infinite bipartite matching of servers and customers

DOI10.1239/aap/1253281061zbMath1247.90099OpenAlexW2091125010WikidataQ59558527 ScholiaQ59558527MaRDI QIDQ3644302

Gideon Weiss, René Caldentey, Edward H. Kaplan

Publication date: 4 November 2009

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1253281061

zbMATH Keywords

ergodicityMarkov chainsteady stateservice systemsfirst-come-first-servedinfinite bipartite matching

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (26)

A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards ⋮ Queueing Dynamics and State Space Collapse in Fragmented Limit Order Book Markets ⋮ Parallel multi-type many server conjecture ⋮ Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities ⋮ Fluid and diffusion approximations of probabilistic matching systems ⋮ A general stochastic matching model on multigraphs ⋮ Dynamic Stochastic Matching Under Limited Time ⋮ Stability regions of systems with compatibilities and ubiquitous measures on graphs ⋮ Many-server scaling of the N-system under FCFS-ALIS ⋮ On the instability of matching queues ⋮ On Matching and Thickness in Heterogeneous Dynamic Markets ⋮ Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview ⋮ On spatial matchings: The first-in-first-match case ⋮ Design heuristic for parallel many server systems ⋮ A LOSS SYSTEM WITH SKILL-BASED SERVERS UNDER ASSIGN TO LONGEST IDLE SERVER POLICY ⋮ Directed FCFS infinite bipartite matching ⋮ Reversibility and Further Properties of FCFS Infinite Bipartite Matching ⋮ A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS ⋮ Stability of the Bipartite Matching Model ⋮ Reward maximization in general dynamic matching systems ⋮ A product form for the general stochastic matching model ⋮ A stochastic matching model on hypergraphs ⋮ A skill based parallel service system under FCFS-ALIS — steady state, overloads, and abandonments ⋮ Stabilizing policies for probabilistic matching systems ⋮ Stochastic non-bipartite matching models and order-independent loss queues ⋮ On the Optimal Design of a Bipartite Matching Queueing System

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks on groups and monoids with a Markovian harmonic measure
• Zero-automatic networks
• Exact asymptotics for the stationary distribution of a Markov chain: a production model
• Modeling the transplant waiting list: A queueing model with reneging
• Fluid Models for Overloaded Multiclass Many-Server Queueing Systems with First-Come, First-Served Routing
• Zero-automatic queues and product form
• Markov Chains
• Topics in the Constructive Theory of Countable Markov Chains
• Random walks on free products of cyclic groups
• The Analysis of Cross-Classified Data: Independence, Quasi-Independence, and Interactions in Contingency Tables with or Without Missing Entries
• Quasi-Independence and Maximum Likelihood Estimation in Incomplete Contingency Tables

This page was built for publication: Fcfs infinite bipartite matching of servers and customers