Capacity Allocation and Scheduling in Two-Stage Service Systems with Multiclass Customers

Published Online:https://doi.org/10.1287/msom.2023.0266

References

  • Armony M, Mandelbaum A (2011) Routing and staffing in large-scale service systems: The case of homogeneous impatient customers and heterogeneous servers. Oper. Res. 59(1):50–65.LinkGoogle Scholar
  • Armony M, Chan CW, Zhu B (2018) Critical care capacity management: Understanding the role of a step down unit. Prod. Oper. Management 27(5):859–883.CrossrefGoogle Scholar
  • Armony M, Israelit S, Mandelbaum A, Marmor YN, Tseytlin Y, Yom-Tov GB (2015) On patient flow in hospitals: A data-based queueing-science perspective. Stochastic Systems 5(1):146–194.LinkGoogle Scholar
  • Atar R, Giat C, Shimkim N (2010) The cμ/θ rule for many-server queues with abandonment. Oper. Res. 58(5):1427–1439.LinkGoogle Scholar
  • Atar R, Giat C, Shimkim N (2011) On the asymptotic optimality of the cμ/θ rule under ergodic cost. Queueing Systems 67(2):127–144.CrossrefGoogle Scholar
  • Atar R, Kaspi H, Shimkim N (2014) Fluid limits for many-server systems with reneging under a priority policy. Math. Oper. Res. 39(3):672–696.LinkGoogle Scholar
  • Baron O, Milner J (2009) Staffing to maximize profit for call centers with alternate service-level agreements. Manufacturing Service Oper. Management 57(3):685–700.Google Scholar
  • Bassamboo A, Randhawa RS (2010) On the accuracy of fluid models for capacity sizing in queueing systems with impatient customers. Oper. Res. 58(5):1398–1413.LinkGoogle Scholar
  • Bassamboo A, Randhawa R, Wu CA (2023) Optimally scheduling heterogeneous impatient customers. Manufacturing Service Oper. Management 25(3):1066–1080.LinkGoogle Scholar
  • Baumanna H, Sandmann W (2017) Multi-server tandem queue with Markovian arrival process, phase-type service times, and finite buffers. Eur. J. Oper. Res. 256(1):187–195.CrossrefGoogle Scholar
  • Best TJ, Sandikçi B, Eisenstein DD, Meltzer DO (2015) Managing hospital inpatient bed capacity through partitioning care into focused wings. Manufacturing Service Oper. Management 17(2):157–176.LinkGoogle Scholar
  • Borst S, Mandelbaum A, Reiman MI (2004) Dimensioning large call centers. Oper. Res. 52(1):17–34.LinkGoogle Scholar
  • Chao X, Liu L, Zheng S (2003) Resource allocation in multisite service systems with intersite customer flows. Management Sci. 49(12):1739–1752.LinkGoogle Scholar
  • Cox D, Smith W (1961) Queues (Wiley, New York)Google Scholar
  • Dantzig GB (1957) Discrete-variable extremum problems. Oper. Res. 5(2):266–277.LinkGoogle Scholar
  • Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: Tutorial, review and research prospects. Manufacturing Service Oper. Management 5(2):79–141.LinkGoogle Scholar
  • Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manufacturing Service Oper. Management 3(4):208–227.LinkGoogle Scholar
  • Green LV (2010) Using queueing theory to alleviate emergency department overcrowding. Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC, eds. Wiley Encyclopedia of Operations Research and Management Science (Wiley, Hoboken, NJ).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.LinkGoogle Scholar
  • Gurvich I, Whitt W (2010) Service-level differentiation in many-server service systems via queue-ratio routing. Oper. Res. 58(2):316–328.LinkGoogle Scholar
  • Harrison JM (1978) The diffusion approximation for tandem queues in heavy traffic. Advances Appl. Probab. 10(4):886–905.CrossrefGoogle Scholar
  • Harrison JM, Shepp L (1984) A tandem storage system and its diffusion limit. Stochastic Processes Appl. 16(3):257–274.CrossrefGoogle Scholar
  • Hu Y, Chan CW, Dong J (2022) Optimal scheduling of proactive service with customer deterioration and improvement. Management Sci. 68(4):2533–2578.LinkGoogle Scholar
  • Hu W, Chan CW, Zubizarreta JR, Escobarb GJ (2018) An examination of early transfers to the ICU based on a physiologic risk. Manufacturing Service Oper. Management 20(3):531–549.LinkGoogle Scholar
  • Kim J, Randhawa RS, Ward AR (2018) Dynamic scheduling in a many-server, multiclass system: The role of customer impatience in large systems. Manufacturing Service Oper. Management 20(2):285–301.LinkGoogle Scholar
  • Koçağa YL, Armony M, Ward AR (2014) Staffing call centers with uncertain arrival rates and co-sourcing. Prod. Oper. Management 7(24):1101–1117.Google Scholar
  • Kostami V, Ward AR (2009) Managing service systems with an offline waiting option and customer abandonment. Manufacturing Service Oper. Management 4(11):644–656.LinkGoogle Scholar
  • Long Z, Shimkin N, Zhang H, Zhang J (2020) Dynamic scheduling of multiclass many-server queues with abandonment: The generalized cμ/h rule. Oper. Res. 68(4):1218–1230.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
  • Mandelbaum A, Zeltyn S (2009) Staffing many-server queues with impatient customers: Constraint satisfaction in call centers. Oper. Res. 57(5):1189–1205.LinkGoogle Scholar
  • Momčilović P, Mandelbaum A, Carmeli N, Armony M, Yom-Tov G (2022) Resource-driven activity-networks (RANs): A modelling framework for complex operations. Working paper, Texas A&M University, College Station, TX.Google Scholar
  • Rosberg Z, Varaiya P, Walrand J (1982) Optimal control of service in tandem queues. IEEE Trans. Automatic Control 27(3):600–610.CrossrefGoogle Scholar
  • Sheu R-S, Ziedins I (2010) Asymptotically optimal control of parallel tandem queues with loss. Queueing Systems 65:211–227.CrossrefGoogle Scholar
  • Shone R, Glazebrook K, Zografos KG (2019) Resource allocation in congested queueing systems with time-varying demand: An application to airport operations. Eur. J. Oper. Res. 276(2):566–581.CrossrefGoogle Scholar
  • van Mieghem JA (1995) Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5(3):809–833.CrossrefGoogle Scholar
  • Wang X, Andradottir S, Ayhan H (2019a) Optimal pricing for tandem queues with finite buffers. Queueing Systems 92:323–396.CrossrefGoogle Scholar
  • Wang J, Abouee-Mehrizi H, Baron O, Berman O (2019b) Tandem queues with impatient customers. Performance Evaluation 135:102011.CrossrefGoogle Scholar
  • Whitt W (2004) Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. 50(10):1449–1461.LinkGoogle Scholar
  • Whitt W (2006) Fluid models for multiserver queues with abandonments. Oper. Res. 54(1):27–54.LinkGoogle Scholar
  • Zychlinski N, Chan CW, Dong J (2022) Managing queues with different resource requirements. Oper. Res. 71(4):1387–1413.LinkGoogle Scholar
  • Zychlinski N, Momčilović P, Mandelbaum A (2018) Time-varying many-server finite-queues in tandem: Comparing blocking mechanisms via fluid models. Oper. Res. Lett. 46(5):492–499.CrossrefGoogle Scholar
  • Zychlinski N, Mandelbaum A, Momčilović P, Cohen I (2020) Bed blocking in hospitals due to scarce capacity in geriatric institutions – Cost minimization via fluid models. Manufacturing Service Oper. Management 22(2):396–411.LinkGoogle 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.