Server Routing-Scheduling Problem in Distributed Queueing System with Time-Varying Demand and Queue Length Control

References

• Baras JS, Dorsey AJ, Makowski AM (1985) Two competing queues with linear costs and geometric service requirements: The μc-rule is often optimal. Adv. Appl. Probab. 17(1):186–209.Crossref, Google Scholar
• Berman O, Wang J, Sapna KP (2005) Optimal management of cross-trained workers in services with negligible switching costs. Eur. J. Oper. Res. 167(2):349–369.Crossref, Google Scholar
• Bertsekas DP (2005) Dynamic Programming and Optimal Control, vol. I, 3rd ed. (Athena Scientific, Belmont, MA).Google Scholar
• Boon MAA, van der Mei RD, Winands EMM (2011) Applications of polling systems. Surveys Oper. Res. Management Sci. 16(2):67–82.Crossref, Google Scholar
• Borst SC, Van Der Mei RD (1998) Waiting-time approximations for multiple-server polling systems. Performance Evaluation 31(3–4):163–182.Crossref, Google Scholar
• Brunner JO, Bard JF, Kolisch R (2010) Midterm scheduling of physicians with flexible shifts using branch and price. IIE Trans. 43(2):84–109.Crossref, Google Scholar
• Chan CW, Huang M, Sarhangian V (2021) Dynamic server assignment in multiclass queues with shifts, with applications to nurse staffing in emergency departments. Oper. Res. 69(6):1936–1959.Link, Google Scholar
• Chen H, Yao DD (1993) Dynamic scheduling of a multiclass fluid network. Oper. Res. 41(6):1104–1115.Link, Google Scholar
• Defraeye M, Van Nieuwenhuyse I (2016) Staffing and scheduling under nonstationary demand for service: A literature review. Omega 58:4–25.Crossref, Google Scholar
• Duenyas I, Van Oyen MP (1996) Heuristic scheduling of parallel heterogeneous queues with set-ups. Management Sci. 42(6):814–829.Link, Google Scholar
• Eick SG, Massey WA, Whitt W (1993) Mt/G/∞ queues with sinusoidal arrival rates. Management Sci. 39(2):241–252.Link, Google Scholar
• El-Rifai O, Garaix T, Augusto V, Xie X (2015) A stochastic optimization model for shift scheduling in emergency departments. Health Care Management Sci. 18(3):289–302.Crossref, Google Scholar
• Erhard M, Schoenfelder J, Fügener A, Brunner JO (2018) State of the art in physician scheduling. Eur. J. Oper. Res. 265(1):1–18.Crossref, Google Scholar
• Ernst AT, Jiang H, Krishnamoorthy M, Owens B, Sier D (2004) An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. 127(1):21–144.Crossref, Google Scholar
• Federgruen A, Katalan Z (1996) The stochastic economic lot scheduling problem: Cyclical base-stock policies with idle times. Management Sci. 42(6):783–796.Link, Google Scholar
• Feldman Z, Mandelbaum A, Massey WA, Whitt W (2008) Staffing of time-varying queues to achieve time-stable performance. Management Sci. 54(2):324–338.Link, Google Scholar
• Fisher M, Kubicek C, McKee P, Mitrani I, Palmer J, Smith R (2004) Dynamic allocation of servers in a grid hosting environment. Proc. Fifth IEEE/ACM Internat. Workshop Grid Comput. (IEEE, Piscataway, NJ), 421–426.Google Scholar
• Fügener A, Brunner JO (2019) Planning for overtime: The value of shift extensions in physician scheduling. INFORMS J. Comput. 31(4):732–744.Link, Google Scholar
• Goodson JC, Ohlmann JW, Thomas BW (2013) Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits. Oper. Res. 61(1):138–154.Link, Google Scholar
• Goodson JC, Thomas BW, Ohlmann JW (2017) A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs. Eur. J. Oper. Res. 258(1):216–229.Crossref, Google Scholar
• Grassmann W (1983) The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity. J. Appl. Probab. 20(4):916–919.Crossref, Google Scholar
• Green L, Kolesar P (1991) The pointwise stationary approximation for queues with nonstationary arrivals. Management Sci. 37(1):84–97.Link, Google Scholar
• Green LV, Kolesar PJ, Soares J (2001) Improving the SIPP approach for staffing service systems that have cyclic demands. Oper. Res. 49(4):549–564.Link, Google Scholar
• Hanumantha GJ, Arici BT, Sefair JA, Askin R (2020) Demand prediction and dynamic workforce allocation to improve airport screening operations. IISE Trans. 52(12):1324–1342.Crossref, Google Scholar
• He B, Liu Y, Whitt W (2016) Staffing a service system with non-Poisson non-stationary arrivals. Probab. Engrg. Inform. Sci. 30(4):593–621.Crossref, Google Scholar
• Henderson SG, Mason AJ (1998) Rostering by iterating integer programming and simulation. 1998 Winter Simulation Conf. Proc., vol. 1 (IEEE, Piscataway, NJ), 677–683.Google Scholar
• Ingolfsson A, Haque MA, Umnikov A (2002) Accounting for time-varying queueing effects in workforce scheduling. Eur. J. Oper. Res. 139(3):585–597.Crossref, Google Scholar
• Ingolfsson A, Campello F, Wu X, Cabral E (2010) Combining integer programming and the randomization method to schedule employees. Eur. J. Oper. Res. 202(1):153–163.Crossref, Google Scholar
• Ingolfsson A, Akhmetshina E, Budge S, Li Y, Wu X (2007) A survey and experimental comparison of service-level-approximation methods for nonstationary M(t)/M/s(t) queueing systems with exhaustive discipline. INFORMS J. Comput. 19(2):201–214.Link, Google Scholar
• Janssen SAM, van der Sommen R, Dilweg A, Sharpanskykh A (2020) Airport security checkpoint data. Accessed October 27, 2022, https://doi.org/10.4121/UUID:6246E6A6-D149-420F-A6A4-7AFD08F154B5.Google Scholar
• 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
• Jensen A (1953) Markoff chains as an aid in the study of Markoff processes. Scandinavian Actuarial J. 1953(Suppl. 1):87–91.Crossref, Google Scholar
• Jongbloed G, Koole G (2001) Managing uncertainty in call centres using Poisson mixtures. Appl. Stochastic Models Bus. Indust. 17(4):307–318.Crossref, Google Scholar
• Koole G, van der Sluis E (2003) Optimal shift scheduling with a global service level constraint. IIE Trans. 35(11):1049–1055.Crossref, Google Scholar
• Leone K, Liu R (2011) Improving airport security screening checkpoint operations in the US via paced system design. J. Air Transportation Management 17(2):62–67.Crossref, Google Scholar
• Levy H, Sidi M (1990) Polling systems: Applications, modeling, and optimization. IEEE Trans. Commun. 38(10):1750–1760.Crossref, Google Scholar
• Little J (1961) A proof of the queueing formula: L = λW. Oper. Res. 9(3):383–387.Link, Google Scholar
• Liu R, Xie X (2021) Weekly scheduling of emergency department physicians to cope with time-varying demand. IISE Trans. 53(10):1109–1123.Google Scholar
• Liu R, Fan X, Wu Z, Pang B, Xie X (2022) The physician scheduling of fever clinic in the COVID-19 pandemic. IEEE Trans. Automation Sci. Engrg. 19(2):709–723.Crossref, Google Scholar
• Liu Y (2018) Staffing to stabilize the tail probability of delay in service systems with time-varying demand. Oper. Res. 66(2):514–534.Link, Google Scholar
• Liu Y, Whitt W (2012) Stabilizing customer abandonment in many-server queues with time-varying arrivals. Oper. Res. 60(6):1551–1564.Link, Google Scholar
• Liu Y, Whitt W (2014) Many-server heavy-traffic limit for queues with time-varying parameters. Ann. Appl. Probab. 24(1):378–421.Crossref, Google Scholar
• Martonosi SE (2011) Dynamic server allocation at parallel queues. IIE Trans. 43(12):863–877.Crossref, Google Scholar
• Massey WA, Parker GA, Whitt W (1996) Estimating the parameters of a nonhomogeneous Poisson process with linear rate. Telecommun. Systems 5(2):361–388.Crossref, Google Scholar
• Matveev A (2018) On stabilizability of fluid multi-server polling systems with setups. Cybernetics Physics 7(1):26–34.Crossref, Google Scholar
• Moder JJ, Phillips CR Jr (1962) Queuing with fixed and variable channels. Oper. Res. 10(2):218–231.Link, Google Scholar
• Novoa C, Storer R (2009) An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur. J. Oper. Res. 196(2):509–515.Crossref, Google Scholar
• Palmer J, Mitrani I (2005) Optimal and heuristic policies for dynamic server allocation. J. Parallel Distributed Comput. 65(10):1204–1211.Crossref, Google Scholar
• Rosa-Hatko W, Gunn EA (1997) Queues with switchover—A review and critique. Ann. Oper. Res. 69:299–322.Crossref, Google Scholar
• Sadykov R, Uchoa E, Pessoa A (2020) A bucket graph-based labeling algorithm with application to vehicle routing. Transportation Sci. 55(1):4–28.Link, Google Scholar
• Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5):796–802.Link, Google Scholar
• Souza e Silva ED, Gail HR, Muntz RR (1995) Polling systems with server timeouts and their application to token passing networks. IEEE/ACM Trans. Networking 3(5):560–575.Crossref, Google Scholar
• Spliet R, Dabia S, Van Woensel T (2017) The time window assignment vehicle routing problem with time-dependent travel times. Transportation Sci. 52(2):261–276.Link, Google Scholar
• Squillante MS, Xia CH, Yao DD, Zhang L (2001) Threshold-based priority policies for parallel-server systems with affinity scheduling. Proc. 2001 Amer. Control Conf. (IEEE, Piscataway, NJ), 2992–2999.Google Scholar
• van Brummelen SPJ, van Dijk NM, van den Hurk K, de Kort WL (2018) Waiting time-based staff capacity and shift planning at blood collection sites. Health Systems 7(2):89–99.Crossref, Google Scholar
• Van den Bergh J, Beliën J, Bruecker PD, Demeulemeester E, Boeck LD (2013) Personnel scheduling: A literature review. Eur. J. Oper. Res. 226(3):367–385.Crossref, Google Scholar
• Vandergraft JS (1983) Fluid flow model of networks of queues. Management Sci. 39(10):1198–1208.Link, Google Scholar
• Wang W-P, Tipper D, Banerjee S (1996) A simple approximation for modeling nonstationary queues. Proc. IEEE INFOCOM ‘96 Conf. Comput. Commun., vol. 1 (IEEE, Piscataway, NJ), 255–262.Google Scholar
• Whitt W (1999) Dynamic staffing in a telephone call center aiming to immediately answer all calls. Oper. Res. Lett. 24(5):205–212.Crossref, Google Scholar
• Yom-Tov GB, Mandelbaum A (2014) Erlang-R: A time-varying queue with reentrant customers, in support of healthcare staffing. Manufacturing Service Oper. Management 16(2):283–299.Link, Google Scholar
• Zeltyn S, Marmor YN, Mandelbaum A, Carmeli B, Greenshpan O, Mesika Y, Wasserkrug S, et al. (2011) Simulation-based models of emergency departments: Operational, tactical, and strategic staffing. ACM Trans. Model. Comput. Simulation 21(4):24.Crossref, Google Scholar
• Zhang S, Ohlmann JW, Thomas BW (2014) A priori orienteering with time windows and stochastic wait times at customers. Eur. J. Oper. Res. 239(1):70–79.Crossref, Google Scholar
• Zhang S, Ohlmann JW, Thomas BW (2018) Dynamic orienteering on a network of queues. Transportation Sci. 52(3):691–706.Link, Google Scholar
• Zhang ZG (2009) Performance analysis of a queue with congestion-based staffing policy. Management Sci. 55(2):240–251.Link, Google Scholar