Diffusion-Based Staffing for Multitasking Service Systems with Many Servers

References

• [1] Akgun OT, Righter R, Wolff R (2011) Multiple-server system with flexible arrivals. Adv. Appl. Probab. 43(4):985–1004.Crossref, Google Scholar
• [2] Altman E, Ayesta U, Prabhu BJ (2011) Load balancing in processor sharing systems. Telecomm. Systems 47(1–2):35–48.Crossref, Google Scholar
• [3] Berry Jaeker JA, Tucker AL (2017) Past the point of speeding up: The negative effects of workload saturation on efficiency and patient severity. Management Sci. 63(4):1042–1062.Link, Google Scholar
• [4] Bertrand JM, Van Ooijen H (2002) Workload based order release and productivity: A missing link. Production Planning Control 13(7):665–678.Crossref, Google Scholar
• [5] Billingsley P (2013) Convergence of Probability Measures (John Wiley & Sons, New York).Google Scholar
• [6] Borst S, Mandelbaum A, Reiman MI (2004) Dimensioning large call centers. Oper. Res. 52(1):17–34.Link, Google Scholar
• [7] Browne S, Whitt W (1995) Piecewise-linear diffusion processes. Dshalalow J, ed. Advances in Queueing: Theory, Methods, and Open Problems (CRC Press, Boca Raton), 463–480.Google Scholar
• [8] Campello F, Ingolfsson A, Shumsky RA (2017) Queueing models of case managers. Management Sci. 63(3):882–900.Link, Google Scholar
• [9] Chen H, Mandelbaum A (1991) Stochastic discrete flow networks: Diffusion approximations and bottlenecks. Ann. Probab. 19(4):1463–1519.Crossref, Google Scholar
• [10] Cui L, Tezcan T (2016) Approximations for chat service systems using many-server diffusion limits. Math. Oper. Res. 41(3):775–807.Link, Google Scholar
• [11] Dai JG, Weiss G (1996) Stability and instability of fluid models for reentrant lines. Math. Oper. Res. 21(1):115–134.Link, Google Scholar
• [12] Dai JG, He S, Tezcan T (2010) Many-server diffusion limits for G/Ph/n+ GI queues. Ann. Appl. Probab. 20(5):1854–1890.Crossref, Google Scholar
• [13] Delasay M, Ingolfsson A, Kolfal B, Schultz K (2019) Load effect on service times. Eur. J. Oper. Res. 279(3):673–686.Crossref, Google Scholar
• [14] Douglas HE, Raban MZ, Walter SR, Westbrook JI (2017) Improving our understanding of multi-tasking in healthcare: Drawing together the cognitive psychology and healthcare literature. Appl. Ergonomics 59:45–55.Crossref, Google Scholar
• [15] Elkhuizen SG, Bor G, Smeenk M, Klazinga NS, Bakker PJ (2007) Capacity management of nursing staff as a vehicle for organizational improvement. BMC Health Service Res. 7(1):196–205.Crossref, Google Scholar
• [16] Ethier SN, Kurtz TG (2009) Markov Processes: Characterization and Convergence, vol. 282 (John Wiley & Sons, Hoboken, NJ).Google Scholar
• [17] Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2):79–141.Link, Google Scholar
• [18] Garnett O, Mandelbaum A, Reiman M (2002) Designing a call center with impatient customers. Manufacturing Service Oper. Management 4(3):208–227.Link, Google Scholar
• [19] Green LV, Kolesar PJ, Whitt W (2007) Coping with time-varying demand when setting staffing requirements for a service system. Production Oper. Management 16(1):13–39.Crossref, Google Scholar
• [20] Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.Link, Google Scholar
• [21] Hall R (2012) Bed assignment and bed management. Hall R, ed. Handbook of Healthcare System Scheduling, International Series in Operations Research & Management Science, vol. 168 (Springer, Boston), 177–200.Crossref, Google Scholar
• [22] Harrison J, Williams R (1996) A multiclass closed queueing network with unconventional heavy traffic behavior. Ann. Appl. Probab. 6(1):1–47.Crossref, Google Scholar
• [23] Harrison JM, Reiman MI (1981) Reflected Brownian motion on an orthant. Ann. Probab. 9(2):302–308.Crossref, Google Scholar
• [24] Hasija S, Pinker E, Shumsky RA (2010) OM practice—Work expands to fill the time available: Capacity estimation and staffing under Parkinson’s law. Manufacturing Service Oper. Management 12(1):1–18.Link, Google Scholar
• [25] Horváth IA, Scully Z, Van Houdt B (2019) Mean field analysis of join-below-threshold load balancing for resource sharing servers. Proc. ACM Measurement Anal. Comput. Systems, vol. 3, 1–21.Google Scholar
• [26] Jacod J, Shiryaev A (2013) Limit Theorems for Stochastic Processes, vol. 288 (Springer, Berlin).Google Scholar
• [27] Janssen A, Van Leeuwaarden JS, Zwart B (2011) Refining square-root safety staffing by expanding Erlang C. Oper. Res. 59(6):1512–1522.Link, Google Scholar
• [28] Jennings OB, Mandelbaum A, Massey WA, Whitt W (1996) Server staffing to meet time-varying demand. Management Sci. 42(10):1383–1394.Link, Google Scholar
• [29] Kallenberg O (2006) Foundations of Modern Probability (Springer, Cham, Switzerland).Google Scholar
• [30] Karatzas I, Shreve SE (1998) Brownian motion. Brownian Motion and Stochastic Calculus (Springer, New York), 47–127.Crossref, Google Scholar
• [31] Kc DS (2014) Does multitasking improve performance? Evidence from the emergency department. Manufacturing Service Oper. Management 16(2):168–183.Link, Google Scholar
• [32] Kc DS, Terwiesch C (2009) Impact of workload on service time and patient safety: An econometric analysis of hospital operations. Management Sci. 55(9):1486–1498.Link, Google Scholar
• [33] Kleinrock L (1976) Queueing Systems, Volume 2. Computer Applications (Wiley, New York).Google Scholar
• [34] Legros B, Jouini O (2019) On the scheduling of operations in a chat contact center. Eur. J. Oper. Res. 274(1):303–316.Crossref, Google Scholar
• [35] Long Z, Tezcan T, Zhang J (2018) Customer service chat systems with general service and patience times. Preprint, submitted June 24, http://dx.doi.org/10.2139/ssrn.3201743.Google Scholar
• [36] Luo J, Zhang J (2013) Staffing and control of instant messaging contact centers. Oper. Res. 61(2):328–343.Link, Google Scholar
• [37] Mandelbaum A, Zeltyn S (2009) Staffing many-server queues with impatient customers: Constraint satisfaction in call centers. Oper. Res. 57(5):1189–1205.Link, Google Scholar
• [38] Mandelbaum A, Massey WA, Reiman MI (1998) Strong approximations for Markovian service networks. Queueing Systems 30(1–2):149–201.Crossref, Google Scholar
• [39] Marshall AW, Olkin I, Arnold BC (2011) Inequalities: Theory of Majorization and Its Applications, 2nd ed. (Springer, Cham, Switzerland).Crossref, Google Scholar
• [40] Pang G, Talreja R, Whitt W (2007) Martingale proofs of many-server heavy-traffic limits for Markovian queues. Probab. Surveys 4:193–267.Crossref, Google Scholar
• [41] Puhalskii AA, Reiman MI (2000) The multiclass GI/PH/N queue in the Halfin-Whitt regime. Adv. Appl. Probab. 32(2):564–595.Crossref, Google Scholar
• [42] Reed J, Ward AR (2004) A diffusion approximation for a generalized Jackson network with reneging. Proc. 42nd Annual Allerton Conf. Comm. Control Comput. (Curran Associates, Inc., Red Hook, NY).Google Scholar
• [43] Reed J, Ward AR (2008) Approximating the GI/GI/1+ GI queue with a nonlinear drift diffusion: Hazard rate scaling in heavy traffic. Math. Oper. Res. 33(3):606–644.Link, Google Scholar
• [44] Reed J, Ward A, Zhan D (2013) On the generalized drift Skorokhod problem in one dimension. J. Appl. Probab. 50(1):16–28.Crossref, Google Scholar
• [45] Reiman MI (1984) Open queueing networks in heavy traffic. Math. Oper. Res. 9(3):441–458.Link, Google Scholar
• [46] Revuz D, Yor M (2013) Continuous Martingales and Brownian Motion, vol. 293 (Springer Science & Business Media, New York).Google Scholar
• [47] Robert P (2013) Stochastic Networks and Queues, vol. 52 (Springer Science & Business Media, New York).Google Scholar
• [48] Schroeder B, Harchol-Balter M, Iyengar A, Nahum E, Wierman A (2006) How to determine a good multi-programming level for external scheduling. 22nd Internat. Conf. Data Engrg. (ICDE’06) (IEEE, Piscataway, NJ).Google Scholar
• [49] Sparaggis PD, Towsley D, Cassandras C (1993) Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates. J. Appl. Probab. 30(1):223–236.Crossref, Google Scholar
• [50] Tan TF, Netessine S (2014) When does the devil make work? An empirical study of the impact of workload on worker productivity. Management Sci. 60(6):1574–1593.Link, Google Scholar
• [51] Tezcan T, Zhang J (2014) Routing and staffing in customer service chat systems with impatient customers. Oper. Res. 62(4):943–956.Link, Google Scholar
• [52] van der Boor MV, Borst SC, Van Leeuwaarden JS, Mukherjee D (2022) Scalable load balancing in networked systems: A survey of recent advances. SIAM Rev. 64(3):554–622.Crossref, Google Scholar
• [53] van Leeuwaarden JSH, Mathijsen BWJ, Zwart B (2019) Economies-of-scale in many-server queueing systems: Tutorial and partial review of the QED Halfin–Whitt heavy-traffic regime. SIAM Rev. 61(3):403–440.Crossref, Google Scholar
• [54] Véricourt Fd, Jennings OB (2011) Nurse staffing in medical units: A queueing perspective. Oper. Res. 59(6):1320–1331.Link, Google Scholar
• [55] Whitt W (1992) Understanding the efficiency of multi-server service systems. Management Sci. 38(5):708–723.Link, Google Scholar
• [56] Whitt W (2002) Stochastic-Process Limits: An Introduction to Stochastic-Process Limits and Their Application to Queues (Springer, New York).Crossref, Google Scholar
• [57] Whitt W (2004) Efficiency-driven heavy-traffic approximations for many-server queues with abandonments. Management Sci. 50(10):1449–1461.Link, Google Scholar
• [58] Wickens CD, Hollands JG, Banbury S, Parasuraman R (2015) Engineering Psychology and Human Performance (Psychology Press, New York).Crossref, Google Scholar
• [59] Yankovic N, Green LV (2011) Identifying good nursing levels: A queuing approach. Oper. Res. 59(4):942–955.Link, Google Scholar
• [60] Yashkov S (1987) Processor-sharing queues: Some progress in analysis. Queueing Systems 2(1):1–17.Crossref, Google Scholar
• [61] Zhang J, Zwart B (2008) Steady state approximations of limited processor sharing queues in heavy traffic. Queueing Systems 60(3–4):227–246.Crossref, Google Scholar
• [62] Zhang J, Dai J, Zwart B (2011) Diffusion limits of limited processor sharing queues. Ann. Appl. Probab. 21(2):745–799.Crossref, Google Scholar