Robust Multiclass Queuing Theory for Wait Time Estimation in Resource Allocation Systems

Published Online:https://doi.org/10.1287/mnsc.2017.2948

References

  • Abate J, Whitt W (1987) Transient behavior of the M/M/1 queue: Starting at the origin. Queueing Systems 2(1):41–65.CrossrefGoogle Scholar
  • Abate J, Whitt W (1988) Transient behavior of the M/M/1 queue via Laplace transforms. Adv. Appl. Probab. 20(1):145–178.CrossrefGoogle Scholar
  • Abate J, Whitt W (1998) Calculating transient characteristics of the Erlang loss model by numerical transform inversion. Comm. Statist. Stochastic Models 14(3):663–680.CrossrefGoogle Scholar
  • Abouna GM (2008) Organ shortage crisis: Problems and possible solutions. Transplantation Proc. 40(1):34–38.CrossrefGoogle Scholar
  • Akan M, Alagoz O, Ata B, Erenay FS, Said A (2012) A broader view of designing the liver allocation system. Oper. Res. 60(4):757–770.LinkGoogle Scholar
  • Alagoz O, Maillart LM, Schaefer AJ, Roberts MS (2007) Determining the acceptance of cadaveric livers using an implicit model of the waiting list. Oper. Res. 55(1):24–36.LinkGoogle Scholar
  • Alizadeh F, Goldfarb D (2001) Second-order cone programming. Math. Programming 95:3–51.CrossrefGoogle Scholar
  • Arıkan M, Ata B, Friedewald JJ, Parker RP (2017) Enhancing kidney supply through geographic sharing in the United States. Production Oper. Management 27(12):2103–2121.CrossrefGoogle Scholar
  • Aufderheide P (1999) Communications Policy and the Public Interest: The Telecommunications Act of 1996, The Guilford Communication Series (Guilford Press).Google Scholar
  • Bandi C, Bertsimas D (2012) Tractable stochastic analysis in high dimensions via robust optimization. Math. Programming 1–48.Google Scholar
  • Bandi C, Bertsimas D, Youssef N (2015) Robust queueing theory. Oper. Res. 63(3):676–700.LinkGoogle Scholar
  • Bandi C, Bertsimas D, Youssef N (2018) Robust transient analysis of multi-server queueing systems and feed-forward networks. Queueing Systems 89(3-4):351–413.CrossrefGoogle Scholar
  • Barabási A-L (2005) The origin of bursts and heavy tails in human dynamics. Nature 435:207–211.CrossrefGoogle Scholar
  • Bell SL, Williams RJ (2001) Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: Asymptotic optimality of a threshold policy. Ann. Appl. Probab. 11(3):608–649.CrossrefGoogle Scholar
  • Bertsimas D, Farias VF, Trichakis N (2013) Fairness, efficiency, and flexibility in organ allocation for kidney transplantation. Oper. Res. 61(1):73–87.LinkGoogle Scholar
  • Bodur M, Luedtke JR (2017) Mixed-integer rounding enhanced benders decomposition for multiclass service-system staffing and scheduling with arrival rate uncertainty. Management Sci. 63(7):2073–2091.LinkGoogle Scholar
  • Bramson MD (2008) Stability of queueing networks. Probab. Surveys 5:169–345.CrossrefGoogle Scholar
  • Choudhury GL, Whitt W (1995) Computing transient and steady-state distributions in polling models by numerical transform inversion. IEEE Internat. Conf. Comm., Vol. 2, 803–809.Google Scholar
  • Choudhury GL, Lucantoni DM, Whitt W (1994) Multi-dimensional transform inversion with applications to the transient M/G/1 queue. Ann. Appl. Probab. 4(3):719–740.CrossrefGoogle Scholar
  • Cleveland Clinic (2015) Changes to donor kidney and lung allocation programs. http://consultqd.clevelandclinic.org/2015/04/changes-to-donor-kidney-and-lung-allocation-programs.Google Scholar
  • Darling DA, Erdős P (1956) A limit theorem for the maximum of normalized sums of independent random variables. Duke Math. J. 23(1):143–155.CrossrefGoogle Scholar
  • Davis AE, Mehrotra S, McElroy LM, Friedewald JJ, Skaro AI, Lapin B, Kang R, Holl JL, Abecassis MM, Ladner DP (2014) The extent and predictors of waiting time geographic disparity in kidney transplantation in the United States. Transplantation 97(10):1049–1057.CrossrefGoogle Scholar
  • Deng Y, Shen S (2016) Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints. Math. Programming 157(1):245–276.CrossrefGoogle Scholar
  • Elwyn G, Edwards A, Eccles M, Rovner D (2001) Decision analysis in patient care. Lancet 358(9281):571–574.CrossrefGoogle Scholar
  • Entwistle VA, Sheldon TA, Sowden A, Watt IS (1998) Evidence-informed patient choice: Practical issues of involving patients in decisions about health care technologies. Internat. J. Tech. Assessment Health Care 14(2):212–225.CrossrefGoogle Scholar
  • Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979, Vol. 58 (Freeman, San Francisco).Google Scholar
  • Grassmann WK (1977) Transient solutions in Markovian queueing systems. Comput. Oper. Res. 4(1):47–53.CrossrefGoogle Scholar
  • Grassmann WK (1980) Transient and steady state results for two parallel queues. Omega 8(1):105–112.CrossrefGoogle Scholar
  • Gross D, Shortleand JF, Thompson JM, Harris CM (2008) Fundamentals of Queueing Theory, 4th ed. (Wiley-Interscience, New York).CrossrefGoogle Scholar
  • Gurvich I, Luedtke J, Tezcan T (2010) Staffing call centers with uncertain demand forecasts: A chance-constrained optimization approach. Management Sci. 56(7):1093–1115.LinkGoogle Scholar
  • Harrison JM, López MJ (1999) Heavy traffic resource pooling in parallel-server systems. Queueing Systems 33(4):339–368.CrossrefGoogle Scholar
  • Harrison JM, Van Mieghem JA (1997) Dynamic control of Brownian networks: State space collapse and equivalent workload formulations. Ann. Appl. Probab. 7(3):747–771.CrossrefGoogle Scholar
  • Heyman DP, Sobel MJ (2003) Stochastic Models in Operations Research, Volume I: Stochastic Processes and Operating Characteristics, Dover Books on Computer Science Series (Dover Publications, Mineola, NY).Google Scholar
  • Horvat LD, Shariff SZ, Garg AX (2009) Global trends in the rates of living kidney donation. Kidney Internat. 75(10):1088–1098.CrossrefGoogle Scholar
  • Ibrahim R, Armony M, Bassamboo A (2017) Does the past predict the future? The case of delay announcements in service systems. Management Sci. 63(6):1762–1780.LinkGoogle Scholar
  • Jiang L, Walrand J (2010) Scheduling and Congestion Control for Wireless and Processing Networks, Synthesis Lectures on Communication Networks (Morgan and Claypool Publishers, Williston, VT).Google Scholar
  • Kaczynski WH, Leemis LM, Drew JH (2012) Transient queueing analysis. INFORMS J. Comput. 24(1):10–28.LinkGoogle Scholar
  • Karlin S, McGregor J (1958) Many server queueing processes with Poisson input and exponential service times. Pacific J. Math. 8(1):87–118.CrossrefGoogle Scholar
  • Keilson J (1979) Markov Chain Models—Rarity and Exponentiality, Applied Mathematical Sciences, Vol. 28 (Springer, New York).CrossrefGoogle Scholar
  • Kelton WD, Law AM (1985) The transient behavior of the M/M/s queue, with implications for steady-state simulation. Oper. Res. 33(2):378–396.LinkGoogle Scholar
  • Kim S-P, Gupta D, Israni AK, Kasiske BL (2015) Accept/decline decision module for the liver simulated allocation model. Health Care Management Sci. 18(1):35–57.CrossrefGoogle Scholar
  • Kong N, Schaefer AJ, Hunsaker B, Roberts MS (2010) Maximizing the efficiency of the U.S. liver allocation system through region design. Management Sci. 56(12):2111–2122.LinkGoogle Scholar
  • Kotiah TCT (1978) Approximate transient analysis of some queuing systems. Oper. Res. 26(2):333–346.LinkGoogle Scholar
  • Lee CP, Chertow GM, Zenios SA (2008) Optimal initiation and management of dialysis therapy. Oper. Res. 56(6):1428–1449.LinkGoogle Scholar
  • Mamani H, Nassiri S, Wagner MR (2017) Closed-form solutions for robust inventory management. Management Sci. 63(5):1625–1643.LinkGoogle 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.LinkGoogle Scholar
  • Matas AJ, Smith JM, Skeans MA, Thompson B, Gustafson SK, Stewart DE, Cherikh WSet al. (2015) OPTN/SRTR 2013 annual data report: Kidney. Amer. J. Transplantation 15(Suppl. 2):1–34.CrossrefGoogle Scholar
  • Moore SC (1975) Approximating the behavior of nonstationary single-server queues. Oper. Res. 23(5):1011–1032.LinkGoogle Scholar
  • Odoni AR, Roth E (1983) An empirical investigation of the transient behavior of stationary queueing systems. Oper. Res. 31(3):432–455.LinkGoogle Scholar
  • OPTNKTC (2007) Report of the OPTN/UNOS Kidney Transplantation Committee to the Board of Directors, September 17–18.Google Scholar
  • Pinedo M (1995) Scheduling: Theory, Algorithms, and Systems (Prentice-Hall, Englewood Cliffs, NJ).Google Scholar
  • Plambeck EL, Ward AR (2006) Optimal control of a high-volume assemble-to-order system. Math. Oper. Res. 31(3):453–477.LinkGoogle Scholar
  • Queyranne M, Schulz AS (1994) Polyhedral approaches to machine scheduling. Technical report, Technische Universität Berlin, Berlin.Google Scholar
  • Rider KL (1976) A simple approximation to the average queue size in the time-dependent M/M/1 queue. J. ACM 23(2):361–367.CrossrefGoogle Scholar
  • Rothkopf MH, Oren SS (1979) A closure approximation for the nonstationary M/M/s queue. Management Sci. 25(6):522–534.LinkGoogle Scholar
  • Sandıkçi B, Maillart LM, Schaefer AJ, Alagoz O, Roberts MS (2008) Estimating the patient’s price of privacy in liver transplantation. Oper. Res. 56(6):1393–1410.LinkGoogle Scholar
  • Sandıkçi B, Maillart LM, Schaefer AJ, Roberts MS (2013) Alleviating the patient’s price of privacy through a partially observable waiting list. Management Sci. 59(8):1836–1854.LinkGoogle Scholar
  • Su X, Zenios SA (2005) Patient choice in kidney allocation: A sequential stochastic assignment model. Oper. Res. 53(3):443–455.LinkGoogle Scholar
  • Su X, Zenios SA (2006) Recipient choice can address the efficiency-equity trade-off in kidney transplantation: A mechanism design model. Management Sci. 52(11):1647–1660.LinkGoogle Scholar
  • Vincent CA, Coulter A (2002) Patient safety: What about the patient? Quality Safety Health Care 11(1):76–80.CrossrefGoogle Scholar
  • Whitt W, You W (2018) Using robust queueing to expose the impact of dependence in single-server queues Oper. Res. 66(1):184–199.Google Scholar
  • Whitt W, You W (2016) Time-Varying Robust Queueing (Columbia University, New York).Google Scholar
  • Xie J, Jiang Y, Xie M (2011) A temporal approach to stochastic network calculus. Working paper, Research and Innovation, Det Norske Veritas, Høvik, Norway.Google Scholar
  • Zenios SA (2005) Models for kidney allocation. Brandeau ML, Sainfort F, Pierskalla WP, eds. Operations Research and Health Care (Springer, Boston), 537–554.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.