Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty

Published Online:https://doi.org/10.1287/opre.1090.0791

References

  • Atamtürk A. Strong formulations of robust mixed 0-1 programming. Math. Programming (2007) 108(2-3):235–250CrossrefGoogle Scholar
  • Bailey N. A study of queues and appointment systems in hospital outpatient departments, with special reference to waiting-times. J. Roy. Statist. Soc. (1952) A14:185–189Google Scholar
  • Bertsimas D., Sim M. The price of robustness. Oper. Res. (2003) 52(1):35–53LinkGoogle Scholar
  • Bertsimas D., Thiele A. A robust optimization approach to inventory theory. Oper. Res. (2006) 54(1):150–168LinkGoogle Scholar
  • Bienstock D., Özbay N. Computing robust basestock levels. (2006) . CORC Report TR-2005-09, Columbia University, New YorkGoogle Scholar
  • Birge J. R., Louveaux F.Introduction to Stochastic Programming (1997) (Springer, New York) Google Scholar
  • Birge J. R., Louveaux F. V. A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. (1988) 34(3):384–392CrossrefGoogle Scholar
  • Blake J. T., Donald J. Mount Sinai Hospital uses integer programming to allocate operating room time. Interfaces (2002) 32(2):63–73LinkGoogle Scholar
  • Bowers J., Mould G. Ambulatory care and orthopaedic capacity planning. Health Care Management Sci. (2005) 8(1):41–47CrossrefGoogle Scholar
  • CAB Surgical services reform: Executive briefing for clinical leaders. (2001) . Technical report, Clinical Advisory Board, Washington, DCGoogle Scholar
  • Charnetski J. Scheduling operating room surgical procedure with early and late completion penalty costs. J. Oper. Management (1984) 5(1):91–102CrossrefGoogle Scholar
  • Coffman E. G., Garey M. R., Johnson D. S., Ausiello G., Lucertini M., Serafini P. Approximation algorithms for bin packing—An update survey. Algorithm Design and Computer System Design (1984) (Springer, New York) 49–106Google Scholar
  • Dell'Olmo P., Kellerer H., Speranza M. G., Tuza Z. A 13/12 approximation algorithm for bin packing with extendable bins. Inform. Processing Lett. (1998) 65(5):229–233CrossrefGoogle Scholar
  • Denton B., Viapiano J., Vogl A. Optimization of surgery sequencing and scheduling decisions under uncertainty. Health Care Management Sci. (2007) 10(1):13–24CrossrefGoogle Scholar
  • Denton B. T., Gupta D. A sequential bounding approach for optimal appointment scheduling. IIE Trans. (2003) 35:1003–1016CrossrefGoogle Scholar
  • Dexter F., Epstein R. H., Macario A. When to release allocated operating room time to increase operating room efficiency. Anesthesia & Analgesia (2004) 98(3):758–762CrossrefGoogle Scholar
  • Dexter F., Macario A., Traub R. D., Hopwood M., Lubarsky D. A. An operating room scheduling strategy to maximize the use of operating room block time: Computer simulation of patient scheduling and survey of patient preferences for surgical waiting time. Anesthesia & Analgesia (1999) 89:7–20Google Scholar
  • Goldman J., Knappenberger H. A., Shearson W. J. A study of the variability of surgical estimates. Hospital Management (1970) 110(3):46–46DGoogle Scholar
  • HFMA Achieving operating room efficiency through process integration. (2005) . Technical report, Health Care Financial Management Association, Westchester, ILGoogle Scholar
  • Ho C.-J., Lau H.-S. Minimizing total cost in scheduling outpatient appointments. Management Sci. (1992) 38(12):750–764LinkGoogle Scholar
  • Jansson B. Choosing a good appointment system—A study of queues of the type (D,M,1). Oper. Res. (1966) 14(2):292–312LinkGoogle Scholar
  • Kall P., Wallace S. W.Stochastic Programming (1994) (John Wiley and Sons, New York) Google Scholar
  • Magerlein J. M., Martin J. B. Surgical demand scheduling: A review. Health Services Res. (1978) 13(4):418–433Google Scholar
  • Marchand H., Wolsey L. A. The 0-1 knapsack problem with a single continuous variable. Math. Programming (1999) 85(1):15–33CrossrefGoogle Scholar
  • Marchand H., Wolsey L. A. Aggregation and mixed integer rounding to solve MIPs. Oper. Res. (2001) 49(3):363–371LinkGoogle Scholar
  • Margot F. Exploiting orbits in symmetric ILP. Math. Programming (2003) 98(1):3–21CrossrefGoogle Scholar
  • McIntosh C., Dexter F., Epstein R. H. Impact of service-specific staffing, case scheduling, turnovers, and first-case starts on anesthesia group and operating room productivity: A tutorial using data from an Australian hospital. Anesthesia & Analgesia (2006) 103(6):1499–1516CrossrefGoogle Scholar
  • Mercer A. Queues with scheduled arrivals: A correction simplification and extension. J. Royal Statist. Soc. (1973) 35):104–116Series 5Google Scholar
  • Ostrowski J., Linderoth J., Rossi F., Smriglio S. Orbital branching. Math. Programming Ser. A (2009) . ePub ahead of print March 10Google Scholar
  • Przasnyski Z. Operating room scheduling: A literature review. AORN J. (1986) 44(1):67–79CrossrefGoogle Scholar
  • Richard J. P. P., de Farias I. R., Nemhauser G. L. Lifted inequalities for 0-1 mixed-integer programming: Basic theory and algorithms. Math. Programming (2003) 98(1–3):89–113CrossrefGoogle Scholar
  • Rohleder T. R., Klassen K. J. Rolling horizon appointment scheduling: A simulation study. Health Care Management Sci. (2002) 5(3):201–209CrossrefGoogle Scholar
  • Sabria F., Daganzo C. F. Approximate expressions for queuing systems with scheduling arrivals and established service order. Transportation Sci. (1989) 23(3):159–165LinkGoogle Scholar
  • Sherali H. D., Smith J. C. Improving discrete model representations via symmetry considerations. Management Sci. (2001) 47(10):1396–1407LinkGoogle Scholar
  • Soriano A. Comparison of two scheduling systems. Oper. Res. (1966) 14(3):388–397LinkGoogle Scholar
  • Vanden Bosch P. M., Dietz D. C. Minimizing expected waiting time in a medical appointment system. IIE Trans. (2000) 32(9):841–848CrossrefGoogle Scholar
  • Wang P. P. Static and dynamic scheduling of customer arrivals to a single-server system. Naval Res. Logist. (1993) 40(3):345–360CrossrefGoogle Scholar
  • Weiss E. N. Models for determining the estimated start times and case orderings. IIE Trans. (1990) 22(2):143–150CrossrefGoogle Scholar
  • Welch J. Appointment systems in hospital outpatient departments. Oper. Res. Quart. (1964) 15(3):224–237CrossrefGoogle 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.