A Queueing Model to Evaluate the Impact of Patient “Batching” on Throughput and Flow Time in a Medical Teaching Facility

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

References

  • Ahn HS, Duenyas I, Zhang RQ. Optimal stochastic scheduling of a two-stage tandem queue with parallel servers. Adv. Appl. Prob. (1999) 31(4):1095–1117CrossrefGoogle Scholar
  • Andradóttir S, Ayhan H. Throughput maximization for tandem lines with two stations and flexible servers. Oper. Res. (2005) 53(3):516–531LinkGoogle Scholar
  • Andradóttir S, Ayhan H, Down DG. Server assignment policies for maximizing the steady-state throughput of finite queueing systems. Management Sci. (2001) 47(10):1421–1439LinkGoogle Scholar
  • Atzema C, Bandiera G, Schull MJ. Emergency department crowding: The effect on resident education. Ann. Emergency Medicine (2005) 45(3):276–281CrossrefGoogle Scholar
  • Brill PH, Green L. Queues in which customers receive simultaneous service from a random number of servers: A system point approach. Management Sci. (1984) 30(1):51–68LinkGoogle Scholar
  • Chisholm CD, Whenmouth LF, Daly EA, Cordell WH, Giles BK, Brizendine EJ. An evaluation of emergency medicine resident interaction time with faculty in different teaching venues. Acad. Emergency Medicine (2004) 11(2):149–155CrossrefGoogle Scholar
  • Courcoubetis C, Reiman M. Optimal control of a queueing system with simultaneous service requirements. IEEE Trans. Automatic Control (1987) 32(8):717–727CrossrefGoogle Scholar
  • Dallery Y, Frein Y. On decomposition methods for tandem queueing networks with blocking. Oper. Res. (1993) 41(2):386–399LinkGoogle Scholar
  • Denton BT, Miller A, Balasubramanian H, Huschka T. Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. (2010) 58(4):802–816LinkGoogle Scholar
  • de Véricourt F, Jennings OB. Nurse staffing in medical units: A queueing perspective. Oper. Res. (2011) 59(6):1320–1331LinkGoogle Scholar
  • Dobson G, Lee HH, Pinker E. A model of ICU bumping. Oper. Res. (2010) 58(6):1564–1576LinkGoogle Scholar
  • Duenyas I, Gupta D, Olsen TL. Control of a single-server tandem queueing system with setups. Oper. Res. (1998) 46(2):218–230LinkGoogle Scholar
  • Erdogan SA, Denton B. Dynamic appointment scheduling of a stochastic server with uncertain demand. INFORMS J. Comput. (2011) . ePub ahead of print December 7, http://dx.doi.org/10.1287/ijoc.1100.0482Google Scholar
  • Gershwin SB, Schor JE. Efficient algorithms for buffer space allocation. Ann. Oper. Res. (2000) 93(1):117–144CrossrefGoogle Scholar
  • Grasman SE, Olsen TL, Birge JR. Finite buffer polling models with routing. Eur. J. Oper. Res. (2005) 165(3):794–809CrossrefGoogle Scholar
  • Green L, Savin S. Reducing delays for medical appointments: A queueing approach. Oper. Res. (2008) 56(6):1526–38LinkGoogle Scholar
  • Green L, Soares J, Giglio JF, Green RA. Using queueing theory to increase the effectiveness of physician staffing in the emergency department. Academic Emergency Medicine (2006) 13(1):61–68CrossrefGoogle Scholar
  • Hopp W, Spearman ML. Factory Physics: Foundation of Manufacturing Management (2006) (McGraw-Hill, Boston) Google Scholar
  • Institute of MedicineHosptial-Based Emergency Care: At the Breaking Point (2006) (Institute of Medicine, Washington, DC) Google Scholar
  • Jacobson PA, Lazowska ED. Analyzing queueing networks with simultaneous resource possession. Comm. ACM (1982) 25(2):142–151CrossrefGoogle Scholar
  • Lammers RL, Roiger M, Rice L, Overton DT, Cucos D. The effect of a new emergency medicine residency program on patient length of stay in a community hospital emergency department. Acad. Emergency Medicine (2003) 10(7):723–730CrossrefGoogle Scholar
  • Lee DKK, Zenios SA. Optimal capacity overbooking for the regular treatment of chronic conditions. Oper. Res. (2009) 57(4):852–865LinkGoogle Scholar
  • Liu N, Ziya S, Kulkarni VG. Dynamic scheduling of outpatient appointments under patient no-shows and cancellations. Manufacturing Service Oper. Management (2010) 12(2):347–364LinkGoogle Scholar
  • McClain JO, Moodie DR. A comment on “Buffer space allocation in automated assembly lines”. Oper. Res. (1991) 39(5):857–860LinkGoogle Scholar
  • Meester LE, Shanthikumar JG. Concavity of the throughput of tandem queueing systems with finite buffer storage space. Adv. Appl. Probab. (1990) 22(3):764–767CrossrefGoogle Scholar
  • Olsen TL. A practical scheduling method for multi-class production systems with setups. Management Sci. (1999) 45(1):116–130LinkGoogle Scholar
  • Olsen TL. Limit theorems for polling models with increasing setups. Probab. Engrg. Informational Sci. (2001a) 15(1):35–55CrossrefGoogle Scholar
  • Olsen TL. Approximations for the waiting time distribution in polling models with and without state-dependent setups. Oper. Res. Lett. (2001b) 28(3):113–123CrossrefGoogle Scholar
  • Olsen TL, van der Mei RD. Polling systems with periodic server routing in heavy-traffic: Distribution of the delay. J. Appl. Probab. (2003) 40(2):305–326CrossrefGoogle Scholar
  • Olsen TL, van der Mei RD. Polling systems with periodic server routing in heavy-traffic: Renewal arrivals. Oper. Res. Lett. (2005) 33(1):17–25CrossrefGoogle Scholar
  • Patrick J, Puterman ML. Reducing wait times through operations research: Optimizing the use of surge capacity. Healthcare Policy (2008) 3(3):75–88Google Scholar
  • Patrick J, Puterman ML, Queyranne M. Dynamic multipriority patient scheduling for a diagnostic resource. Oper. Res. (2008) 56(6):1507–1525LinkGoogle Scholar
  • Puterman ML. Markov Decision Processes (2005) (John Wiley & Sons, Hoboken, NJ) Google Scholar
  • Rich EC, Liebow M, Srinivasan M, Parish D, Wolliscroft JO, Fein O, Blasere R. Medicare financing of graduate medical education. J. General Internal Medicine (2002) 17(4):283–292CrossrefGoogle Scholar
  • Serfozo RF. An equivalence between continuous and discrete time Markov decision processes. Oper. Res. (1979) 27(3):616–620LinkGoogle Scholar
  • Singh MP, Srinivasan MM. Exact analysis of the state-dependent polling model. Queueing Systems (2002) 41(4):371–399CrossrefGoogle Scholar
  • So KC. Optimal buffer allocation strategy for minimizing work-in-process inventory in unpaced production lines. IIE Trans. (1997) 29(1):81–88CrossrefGoogle Scholar
  • Sparaggis PD, Gong W. Optimal buffer allocation in a two-stage queueing system. J. Appl. Probab. (1993) 30(2):478–482CrossrefGoogle Scholar
  • Srinivasan MM, Gupta D. When should a roving server be patient? Management Sci. (1996) 42(3):437–451LinkGoogle Scholar
  • Thibodeau LG, Geary SP, Werter C. An evaluation of resident work profiles, attending-resident teaching interactions, and the effect of variations in emergency department volume on each. Academic Emergency Medicine (2010) 17(2):62–66CrossrefGoogle Scholar
  • Winands EMM. On polling systems with large setups. Oper. Res. Lett. (2007) 35(5):584–590CrossrefGoogle 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.