A Queueing Model to Evaluate the Impact of Patient “Batching” on Throughput and Flow Time in a Medical Teaching Facility
Published Online:13 Apr 2012https://doi.org/10.1287/msom.1120.0380
References
- . Optimal stochastic scheduling of a two-stage tandem queue with parallel servers. Adv. Appl. Prob. (1999) 31(4):1095–1117Crossref, Google Scholar
- . Throughput maximization for tandem lines with two stations and flexible servers. Oper. Res. (2005) 53(3):516–531Link, Google Scholar
- . Server assignment policies for maximizing the steady-state throughput of finite queueing systems. Management Sci. (2001) 47(10):1421–1439Link, Google Scholar
- . Emergency department crowding: The effect on resident education. Ann. Emergency Medicine (2005) 45(3):276–281Crossref, Google Scholar
- . Queues in which customers receive simultaneous service from a random number of servers: A system point approach. Management Sci. (1984) 30(1):51–68Link, Google Scholar
- . An evaluation of emergency medicine resident interaction time with faculty in different teaching venues. Acad. Emergency Medicine (2004) 11(2):149–155Crossref, Google Scholar
- . Optimal control of a queueing system with simultaneous service requirements. IEEE Trans. Automatic Control (1987) 32(8):717–727Crossref, Google Scholar
- . On decomposition methods for tandem queueing networks with blocking. Oper. Res. (1993) 41(2):386–399Link, Google Scholar
- . Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. (2010) 58(4):802–816Link, Google Scholar
- . Nurse staffing in medical units: A queueing perspective. Oper. Res. (2011) 59(6):1320–1331Link, Google Scholar
- . A model of ICU bumping. Oper. Res. (2010) 58(6):1564–1576Link, Google Scholar
- . Control of a single-server tandem queueing system with setups. Oper. Res. (1998) 46(2):218–230Link, Google Scholar
- . 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
- . Efficient algorithms for buffer space allocation. Ann. Oper. Res. (2000) 93(1):117–144Crossref, Google Scholar
- . Finite buffer polling models with routing. Eur. J. Oper. Res. (2005) 165(3):794–809Crossref, Google Scholar
- . Reducing delays for medical appointments: A queueing approach. Oper. Res. (2008) 56(6):1526–38Link, Google Scholar
- . Using queueing theory to increase the effectiveness of physician staffing in the emergency department. Academic Emergency Medicine (2006) 13(1):61–68Crossref, Google Scholar
- . 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
- . Analyzing queueing networks with simultaneous resource possession. Comm. ACM (1982) 25(2):142–151Crossref, Google Scholar
- . 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–730Crossref, Google Scholar
- . Optimal capacity overbooking for the regular treatment of chronic conditions. Oper. Res. (2009) 57(4):852–865Link, Google Scholar
- . Dynamic scheduling of outpatient appointments under patient no-shows and cancellations. Manufacturing Service Oper. Management (2010) 12(2):347–364Link, Google Scholar
- . A comment on “Buffer space allocation in automated assembly lines”. Oper. Res. (1991) 39(5):857–860Link, Google Scholar
- . Concavity of the throughput of tandem queueing systems with finite buffer storage space. Adv. Appl. Probab. (1990) 22(3):764–767Crossref, Google Scholar
- . A practical scheduling method for multi-class production systems with setups. Management Sci. (1999) 45(1):116–130Link, Google Scholar
- . Limit theorems for polling models with increasing setups. Probab. Engrg. Informational Sci. (2001a) 15(1):35–55Crossref, Google Scholar
- . Approximations for the waiting time distribution in polling models with and without state-dependent setups. Oper. Res. Lett. (2001b) 28(3):113–123Crossref, Google Scholar
- . Polling systems with periodic server routing in heavy-traffic: Distribution of the delay. J. Appl. Probab. (2003) 40(2):305–326Crossref, Google Scholar
- . Polling systems with periodic server routing in heavy-traffic: Renewal arrivals. Oper. Res. Lett. (2005) 33(1):17–25Crossref, Google Scholar
- . Reducing wait times through operations research: Optimizing the use of surge capacity. Healthcare Policy (2008) 3(3):75–88Google Scholar
- . Dynamic multipriority patient scheduling for a diagnostic resource. Oper. Res. (2008) 56(6):1507–1525Link, Google Scholar
- . Markov Decision Processes (2005) (John Wiley & Sons, Hoboken, NJ) Google Scholar
- . Medicare financing of graduate medical education. J. General Internal Medicine (2002) 17(4):283–292Crossref, Google Scholar
- . An equivalence between continuous and discrete time Markov decision processes. Oper. Res. (1979) 27(3):616–620Link, Google Scholar
- . Exact analysis of the state-dependent polling model. Queueing Systems (2002) 41(4):371–399Crossref, Google Scholar
- . Optimal buffer allocation strategy for minimizing work-in-process inventory in unpaced production lines. IIE Trans. (1997) 29(1):81–88Crossref, Google Scholar
- . Optimal buffer allocation in a two-stage queueing system. J. Appl. Probab. (1993) 30(2):478–482Crossref, Google Scholar
- . When should a roving server be patient? Management Sci. (1996) 42(3):437–451Link, Google Scholar
- . 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–66Crossref, Google Scholar
- . On polling systems with large setups. Oper. Res. Lett. (2007) 35(5):584–590Crossref, Google Scholar

