A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards

References

• Adan, I , Weiss G (2012) Exact FCFS matching rates for two infinite multitype sequences. Oper. Res. 60(2):475–489.Google Scholar
• Adan I , Weiss G (2014) A skill based parallel service system under FCFS-ALIS-steady state, overloads, and abandonments. Stochastic Systems 4(1):250–299.Link, Google Scholar
• Adan I , Bušić A , Mairesse J , Weiss G (2017) Reversibility and further properties of fcfs infinite bipartite matching. Math. Oper. Res. 43(2):598–621.Link, Google Scholar
• Afeche P , Caldentey R , Gupta V (2019) On the optimal design of a bipartite matching queueing system. Working paper, Rotman School of Management, Toronto.Google Scholar
• Afèche P , Diamant A , Milner J (2014) Double-sided batch queues with abandonment: Modeling crossing networks. Oper. Res. 62(5):1179–1201.Link, Google Scholar
• Ahuja RK , Magnanti TL , Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
• Ahuja RK , Orlin JB , Stein C , Tarjan RE (1994) Improved algorithms for bipartite network flow. SIAM J. Comput. 23(5):906–933.Crossref, Google Scholar
• Akan M , Alagoz O , Ata E , Erenay FS , Said A (2012) A broader view of designing the liver allocation system. Oper. Res. 60(4):757–770.Google Scholar
• Ata B , Ding Y , Zenios S (2020) An achievable-region-based approach for kidney allocation policy design with endogenous patient choice. Manufacturing Service Oper. Managment Forthcoming.Google Scholar
• Atar R , Giat C , Shimkin N (2010) The c μ / θ rule for many-server queues with abandonment. Oper. Res. 58(5):1427–1439.Link, Google Scholar
• Atar R , Mandelbaum A , Shaikhet G (2009) Simplified control problems for multiclass many-server queueing systems. Math. Oper. Res. 34(4):795–812.Link, Google Scholar
• Caldentey R , Kaplan EH , Gideon W (2009) FCFS infinite bipartite matching of servers and customers. Adv. Appl. Probab. 41(3):695–730.Crossref, Google Scholar
• Caldentey RA , Kaplan EH (2007) A heavy traffic approximation for queues with restricted customer-server matchings. Working Paper No. OM-2007-04, New York University, New York.Google Scholar
• Chen H , Shanthikumar JG (1994) Fluid limits and diffusion approximations for networks of multi-server queues in heavy traffic. Discrete Event Dynamic Systems 4(3):269–291.Crossref, Google Scholar
• Dai JG , Tezcan T (2008) Optimal control of parallel server systems with many servers in heavy traffic. Queueing Systems 59(2):95–134.Crossref, Google Scholar
• Ding Y , McCormick T , Nagarajan M (2018) Public housing assignment in Pittsburgh: A case study. Working paper, Desautels Faculty of Management, Montreal, Canada.Google Scholar
• Fazel-Zarandi MM , Kaplan EH (2018) Approximating the first-come, first-served stochastic matching model with ohm’s law. Oper. Res. 66(5):1423–1432.Link, Google Scholar
• Gallo G , Grigoriadis MD , Tarjan RE (1989) A fast parametric maximum flow algorithm and applications. SIAM J. Comput. 18(1):30–55.Google Scholar
• Gardner K , Zbarsky S , Doroudi S , Harchol-Balter M , Hyytiä E , Scheller-Wolf A (2016) Queueing with redundant requests: exact analysis. Queueing Systems 83(3-4):227–259.Crossref, Google Scholar
• Granot F , McCormick ST , Queyranne M , Tardella F (2012) Structural and algorithmic properties for parametric minimum cuts. Math. Programming 135(1-2):337–367.Crossref, Google Scholar
• Grindlay AA (1965) Tandem queues with dynamic priorities. Oper. Res. 16(4):439–451.Google Scholar
• Gurvich I , Ward A (2014) On the dynamic control of matching queues. Stochastic Systems 4(2):479–523.Link, Google Scholar
• Gurvich I , Whitt W (2009) Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management 11(2):237–253.Link, Google Scholar
• Gurvich I , Whitt W (2010) Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. 58(2):316–328.Link, Google Scholar
• Jackson JR (1960) Some problems in queueing with dynamic priorities. Naval Res. Logist. Quart. 7(3):235–249.Google Scholar
• Kaplan EH (1984) Managing the demand for public housing. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Kaplan EH (1988) A public housing queue with reneging. Decision Sci. 19(2):383–391.Crossref, Google Scholar
• Kleinrock L , Finkelstein RP (1967) Time dependent priority queues. Oper. Res. 15(1):104–116.Link, Google Scholar
• Liu Y , Whitt W (2011) Large-time asymptotics for the gt/mt/st+gi many-server fluid queue with abandonment. Queueing Systems 67(2):145–182.Crossref, Google Scholar
• Liu Y , Whitt W (2012a) The gt/gi/st+gi many-server fluid queue. Queueing Systems 71(4):405–444.Crossref, Google Scholar
• Liu Y , Whitt W (2012b) Stabilizing customer abandonment in many-server queues with time-varying arrivals. Oper. Res. 60(6):1551–1564.Link, Google Scholar
• Luss H (1999) On equitable resource allocation problems: A lexicographic minimax approach. Oper. Res. 47(3):361–378.Link, Google Scholar
• Mandelbaum A , Stolyar AL (2004) Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized c μ -rule. Oper. Res. 52(6):836–855.Link, Google Scholar
• Mehrotra V , Ross K , Ryder G , Zhou Y-P (2012) Routing to manage resolution and waiting time in call centers with heterogeneous servers. Manufacturing Service Oper. Management 14(1):66–81.Link, Google Scholar
• Moulin H , Sethuraman J (2013) The bipartite rationing problem. Oper. Res. 61(5):1087–1100.Link, Google Scholar
• Nelson RD (1990) Heavy traffic response times for a priority queue with linear priorities. Oper. Res. 38(3):560–563.Link, Google Scholar
• Netterman A , Adiri I (1979) A dynamic priority queue with general concave priority functions. Oper. Res. 27(6):1088–1100.Link, Google Scholar
• OPTN/UNOS (2008) Kidney allocation concepts: Request for information. Accessed on March 1, 2020, https://asts.org/docs/default-source/optn-unos/proposed-kidney-allocation-concepts-rfi-september-24-2008.pdf.Google Scholar
• OPTN/UNOS (2015) OPTN/UNOS online data report. Accessed March 1, 2020, https://optn.transplant.hrsa.gov/data/.Google Scholar
• OPTN/UNOS Kidney Transplantation Committee (2011) Concepts for kidney allocations. Accessed March 1, 2020, http://media1.s-nbcnews.com/i/MSNBC/Sections/NEWS/z_Personal/AJohnson/110301_KidneyConceptDocument.pdf.Google Scholar
• Shi C , Wei Y , Zhong Y (2019) Process flexibility for multiperiod production systems. Oper. Res. 67(5):1300–1320.Link, Google Scholar
• Sisselman ME , Whitt W (2007) Value-based routing and preference-based routing in customer contact centers. Production Oper. Management 16(3):277–291.Crossref, Google Scholar
• Stolyar AL (2004) Maxweight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14(1):1–53.Crossref, Google Scholar
• Stolyar AL , Tezcan T (2010) Control of systems with flexible multi-server pools: A shadow routing approach. Queueing Systems 66(1):1–51.Crossref, Google Scholar
• Stolyar AL , Tezcan T (2011) Shadow-routing based control of flexible multiserver pools in overload. Oper. Res. 59(6):1427–1444.Link, Google Scholar
• Su X , Zenios SA (2005) Patient choice in kidney allocation: A sequential stochastic assignment model. Oper. Res. 53(3):443–455.Link, Google Scholar
• Talreja R , Whitt W (2008) Fluid models for overloaded multiclass many-server queueing systems with first-come, first-served routing. Management Sci. 54(8):1513–1527.Link, Google Scholar
• Tezcan T , Dai JG (2010) Dynamic control of n-systems with many servers: Asymptotic optimality of a static priority policy in heavy traffic. Oper. Res. 58(1):94–110.Link, Google Scholar
• Van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized c—mu rule. Ann. Appl. Probab. 5(3)809–833.Crossref, Google Scholar
• Visschers J , Adan I , Weiss G (2012) A product form solution to a system with multi-type jobs and multi-type servers. Queueing Systems 70(3):269–298.Crossref, Google Scholar
• Wang X , Zhang J (2015) Process flexibility: A distribution-free bound on the performance of k-chain. Oper. Res. 63(3):555–571.Link, Google Scholar
• Ward AR , Armony M (2013) Blind fair routing in large-scale service systems with heterogeneous customers and servers. Oper. Res. 61(1):228–243.Link, Google Scholar
• Whitt W (2002) Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues (Springer, New York). Crossref, Google Scholar
• Xu Z , Zhang H , Zhang J , Zhang R (2020) Online demand fulfillment under limited flexibility. Management Sci. 66(10):4667–4685.Link, Google Scholar
• Zenios SA , Chertow GM , Wein LM (2000) Dynamic allocation of kidneys to candidates on the transplant waiting list. Oper. Res. 48(4):549–569.Link, Google Scholar