Author:
Caldentey René,Kaplan Edward H.,Weiss Gideon
Abstract
We consider an infinite sequence of customers of typesand an infinite sequence of servers of typeswhere a server of typejcan serve a subset of customer typesC(j) and where a customer of typeican be served by a subset of server typesS(i). We assume that the types of customers and servers in the infinite sequences are random, independent, and identically distributed, and that customers and servers are matched according to their order in the sequence, on a first-come–first-served (FCFS) basis. We investigate this process of infinite bipartite matching. In particular, we are interested in the rateri,jthat customers of typeiare assigned to servers of typej. We present a countable state Markov chain to describe this process, and for some previously unsolved instances, we prove ergodicity and existence of limiting rates, and calculateri,j.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Statistics and Probability
Reference21 articles.
1. Zero-automatic queues and product form
2. [1] Adan I. , Foley R. D. and McDonald D. R. (2007). Exact asymptotics of the stationary distribution of a Markov chain: a production model. EURANDOM Report 2008-036, Eindhoven, Netherlands. Available at http://www.eurandom.nl/EURANDOMreports.htm.
3. The Modern Call Center: A Multi-Disciplinary Perspective on Operations Management Research
4. Flows in Networks
5. [13] Garnett O. and Mandelbaum A. (2000). An introduction to skill-based routing and its operational complexities. Unpublished manuscript. Available at http://iew3.technion.ac.il/serveng/Lectures/SBR.pdf.
Cited by
96 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献