State-Dependent Estimation of Delay Distributions in Fork-Join Networks

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

References

  • Ang E, Kwasnick S, Bayati M, Plambeck EL, Aratow M (2016) Accurate emergency department wait time prediction. Manufacturing Service Oper. Management 18(1):141–156.LinkGoogle Scholar
  • Armony M, Shimkin N, Whitt W (2009) The impact of delay announcements in many-server queues with abandonment. Oper. Res. 57(1):66–81.LinkGoogle Scholar
  • Baccelli F, Makowski AM, Shwartz A (1989) The fork-join queue and related systems with synchronization constraints: Stochastic ordering and computable bounds. Adv. Appl. Probability 21(3):629–660.CrossrefGoogle Scholar
  • Bassamboo A, Ibrahim R (2021) A general framework to compare announcement accuracy: Static vs. LES-based announcement. Management Sci. 67(7):4191–4208.LinkGoogle Scholar
  • Benevento E, Aloini D, Squicciarini N, Dulmin R, Mininno V (2019) Queue-based features for dynamic waiting time prediction in emergency department. Measuring Bus. Excellence 23(4):458–471.CrossrefGoogle Scholar
  • Boxma O (1983) The cyclic queue with one general and one exponential server. Adv. Appl. Probability 15(4):857–873.CrossrefGoogle Scholar
  • Boxma OJ, Daduna H (1990) Sojourn times in queueing networks. Takagi H, ed. Stochastic Analysis of Computer and Communication Systems (North-Holland Publishing Company, Amsterdam), 401–450.Google Scholar
  • Boxma O, Daduna H (2014) The cyclic queue and the tandem queue. QUESTA 77(3):275–295.Google Scholar
  • Boxma OJ, Koole G, Liu Z (1994) Queueing-theoretic solution methods for models of parallel and distributed systems. Boxma OJ, Koole G, eds. Performance Evaluation of Parallel and Distributed Systems—Solution Methods (CWI, Amsterdam).Google Scholar
  • Chen T, Guestrin C (2016) XGBoost: A scalable tree boosting system. Proc. 22nd ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining (ACM, New York), 785–794.Google Scholar
  • Chocron E, Cohen I, Feigin PD (2022) Delay prediction for managing multi-class service systems: An investigation of queueing theory and machine learning approaches. Trans. Engrg. Management. Forthcoming.Google Scholar
  • Daduna H (1986) Two-stage cyclic queues with nonexponential servers: Steady-state and cyclic time. Oper. Res. 34(3):455–459.LinkGoogle Scholar
  • Diebold FX, Mariano RS (2002) Comparing predictive accuracy. J. Bus. Econom. Statist. 20(1):134–144.CrossrefGoogle Scholar
  • Dong J, Yom-Tov E, Yom-Tov GB (2019) The impact of delay announcements on hospital network coordination and waiting times. Management Sci. 65(5):1969–1994.AbstractGoogle Scholar
  • Efrat-Treister D, Moriah H, Rafaeli A (2020) The effect of waiting on aggressive tendencies toward emergency department staff: Providing information can help but may also backfire. PLoS One 15(1):e0227729.CrossrefGoogle Scholar
  • Friedman JH (2001) Greedy function approximation: A gradient boosting machine. Ann. Statist. 29(5):1189–1232.CrossrefGoogle Scholar
  • Gal A, Mandelbaum A, Schnitzler F, Senderovich A, Weidlich M (2017) Traveling time prediction in scheduled transportation with journey segments. Inform. Systems 64:266–280.CrossrefGoogle Scholar
  • Huang J, Carmeli B, Mandelbaum A (2015) Control of patient flow in emergency departments, or multiclass queues with deadlines and feedback. Oper. Res. 63(4):892–908.LinkGoogle Scholar
  • Ibrahim R (2018) Sharing delay information in service systems: A literature survey. QUESTA 89(1–2):49–79.Google Scholar
  • Ibrahim R, Whitt W (2009) Real-time delay estimation based on delay history. Manufacturing Service Oper. Management 11(3):397–415.LinkGoogle Scholar
  • Ibrahim R, Whitt W (2011) Real-time delay estimation based on delay history in many-server service systems with time-varying arrivals. Production Oper. Management 20(5):654–667.CrossrefGoogle Scholar
  • Jouini O, Aksin Z, Dallery Y (2011) Call centers with delay information: Models and insights. Manufacturing Service Oper. Management 13(4):534–548.LinkGoogle Scholar
  • Kim C, Agrawala AK (1989) Analysis of the fork-join queue. IEEE Trans. Comput. 38(2):250–255.CrossrefGoogle Scholar
  • Ko SS, Serfozo RF (2004) Response times in M/M/s fork-join networks. Adv. Appl. Probability 36(3):854–871.CrossrefGoogle Scholar
  • Ko SS, Serfozo RF (2008) Sojourn times in G/M/1 fork-join networks. Naval Res. Logist. 55(5):432–443.CrossrefGoogle Scholar
  • Maister DH (1984) The psychology of waiting lines. Czepiel JA, Solomon MR, Surprenant CF, eds. The Service Encounter (Lexington Books, Lexington, MA), 113–123.Google Scholar
  • Mourõo R, Carvalho R, Carvalho R, Ramos GN (2017) Predicting waiting time overflow on bank teller queues. Proc. 16th IEEE Internat. Conf. on Machine Learning and Appl. (IEEE, New York), 842–847.Google Scholar
  • Munichor N, Rafaeli A (2007) Numbers or apologies? Customer reactions to telephone waiting time fillers. J. Appl. Psych. 92(2):511–518.CrossrefGoogle Scholar
  • Nakibly E (2002) Predicting waiting times in telephone service systems. M.Sc. thesis, Technion—Israel Institute of Technology, Israel.Google Scholar
  • Nelson R, Tantawi AN (1988) Approximate analysis of fork/join synchronization in parallel queues. IEEE Trans. Comput. 37(6):739–743.CrossrefGoogle Scholar
  • Nguyen V (1993) Processing networks with parallel and sequential tasks: Heavy traffic analysis and Brownian limits. Ann. Appl. Probability 3(1):28–55.CrossrefGoogle Scholar
  • Pender J, Rand RH, Wesson E (2017) Queues with choice via delay differential equations. Internat. J. Bifur. Chaos Appl. Sci. Engrg. 27(04):1730016.CrossrefGoogle Scholar
  • Qiu Z, Pérez JF, Harrison PG (2015) Beyond the mean in fork-join queues: Efficient approximation for response-time tails. Performance Evaluation 91:99–116.CrossrefGoogle Scholar
  • Reiman MI (1982) The heavy traffic diffusion approximation for sojourn times in Jackson networks. Disney RL, Ott TJ, eds. Applied Probability — Computer Science: The Interface. Progress in Computer Science, vol. 3 (Birkhäuser, Boston), 409–421.Google Scholar
  • Rizk A, Poloczek F, Ciucu F (2015) Computable bounds in fork-join queueing systems. Performance Evaluation Rev. 43(1):335–346.CrossrefGoogle Scholar
  • Sanit-in Y, Saikaew KR (2019) Prediction of waiting time in one stop service. Internat. J. Machine Learn. Comput. 9(3):322–327.CrossrefGoogle Scholar
  • Schol D, Vlasiou M, Zwart B (2022) Large fork-join queues with nearly deterministic arrival and service times. Math. Oper. Res. 47(2):1335–1364.LinkGoogle Scholar
  • Senderovich A, Rogge-Solti A, Gal A, Mendling J, Mandelbaum A, Kadish S, Bunnell CA (2015) Data-driven performance analysis of scheduled processes. Motahari-Nezhad H, Recker J, Weidlich M, eds. Business Process Management, BPM 2016, Lecture Notes in Computer Science, vol. 9253 (Springer, Cham), 35–52.Google Scholar
  • Stadje W (1996) Non-stationary waiting times in a closed exponential tandem queue. QUESTA 22(1–2):65–77.Google Scholar
  • Sun Y, Teow KL, Heng BH, Ooi CK, Tay SY (2012) Real-time prediction of waiting time in the emergency department, using quantile regression. Ann. Emergency Medicine 60(3):299–308.CrossrefGoogle Scholar
  • Thiongane M, Chan W, L’Ecuyer P (2016) New history-based delay predictors for service systems. 2016 Winter Simulation Conf. (WSC), 425–436.Google Scholar
  • Thiongane M, Chan W, L’Ecuyer P (2020) Delay predictors in multi-skill call centers: An empirical comparison with real data. Proc. 9th Internat. Conf. Oper. Res. Enterprise Systems, vol. 1: ICORES, 100–108.Google Scholar
  • Thomasian A (2014) Analysis of forkjoin and related queueing systems. ACM Comput. surveys 47(2):1–71.CrossrefGoogle Scholar
  • Westphal M, Yom-Tov GB, Parush A, Rafaeli A (2022) Reducing abandonment and improving attitudes in eds: Integrating delay announcements into operational transparency to signal service quality. Preprint, submitted May 26, https://dx.doi.org/10.2139/ssrn.4120485.Google Scholar
  • Westphal M, Yom-Tov GB, Parush A, Carmeli N, Shaulov A, Shapira C, Rafaeli A (2020) A patient-centered information system (myED) for emergency care journeys: Design, development, and initial adoption. JMIR Form Res. 4(2):1.CrossrefGoogle Scholar
  • Whitt W (1999) Predicting queueing delays. Management Sci. 45(6):870–888.LinkGoogle Scholar
  • Witkovský V (2016) Numerical inversion of a characteristic function: An alternative tool to form the probability distribution of output quantity in linear measurement models. Acta IMEKO 5(3):32–44.CrossrefGoogle 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.LinkGoogle Scholar
  • Yu Q, Allon G, Bassamboo A (2016) How do delay announcements shape customer behavior? An empirical study. Management Sci. 63(1):1–20.LinkGoogle Scholar
  • Zhang Z (1990) Analytical results for waiting time and system size distributions in two parallel queueing systems. SIAM J. Appl. Math. 50(4):1176–1193.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.