Skip to main content
Log in

The single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

Scheduling elective surgeries is a dynamic, sequential decision-making process that must balance the costs of deferring waiting cases and blocking higher-priority cases. Although other surgery scheduling problems have received extensive treatment in the literature, this paper presents the first single-day scheduling problem formulation to capture this aspect of the scheduling process while also incorporating surgical block schedules, block release policies, and waiting lists. Theoretical results for the special case in which all cases have the same duration motivate a range of threshold-based heuristics for the general problem with multiple case durations. Our computational results demonstrate the effectiveness of the proposed heuristics and show how block release dates affect the quality of the scheduling decisions. Based on these results, we propose a new approach to surgery scheduling. In particular, to make more equitable waiting list decisions, operating room (OR) managers should gradually release unused OR time over the course of several days leading up to the day of surgery.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Beliën J, Demeulemeester E (2007) Building cyclic master surgery schedules with leveled resulting bed occupancy. Eur J Oper Res 176: 1185–1204

    Article  Google Scholar 

  • Beliën J, Demeulemeester E, Cardoen B (2009) A decision support system for cyclic master surgery scheduling with multiple objectives. J Sched 12(2): 147–161

    Article  Google Scholar 

  • Blake J, Carter M (2002) A goal programming approach to strategic resource allocation in acute care hospitals. Eur J Oper Res 140: 541–561

    Article  Google Scholar 

  • Blake J, Donald J (2002) Mount Sinai Hospital uses integer programming to allocate operating room time. Interfaces 32(2): 63–73

    Article  Google Scholar 

  • Brumelle S, Walczak D (2003) Dynamic airline revenue management with multiple semi–Markov demand. Oper Res 51: 137–148

    Article  Google Scholar 

  • Cardoen B, Demeulemeester E, Beliën J (2009) Sequencing surgical cases in a day-care environment: an exact branch-and-price approach. Comput Oper Res 36(9): 2660–2669

    Article  Google Scholar 

  • Cardoen B, Demeulemeester E, Beliën J (2010) Operating room planning and scheduling: a literature review. Eur J Oper Res 201: 921–932

    Article  Google Scholar 

  • Denton B, Viapiano J, Vogl A (2007) Optimization of surgery sequencing and scheduling decisions under uncertainty. Health Care Manag Sci 10: 13–24

    Article  Google Scholar 

  • Dexter F, Macario A, Traub RD (1999) Which algorithm for scheduling elective add-on cases maximizes operating room utilization? Use of bin packing algorithms and fuzzy constraints in operating room management. Anesthesiology 91: 1491–1500

    Article  Google Scholar 

  • Dexter F, Traub R (2002) How to schedule elective surgical cases into specific operating rooms to maximize the efficiency of use of operating room time. Anesth Analg 94: 933–942

    Article  Google Scholar 

  • Dexter F, Traub R, Macario A (2003) How to release allocated operating room time to increase efficiency: predicting which surgical service will have the most under-utilized operating room time. Anesth Analg 96: 507–512

    Google Scholar 

  • Dexter F, Macario A (2004) When to release allocated operating room time to increase operating room efficiency. Anesth Analg 98: 758–762

    Article  Google Scholar 

  • Gerchak Y, Gupta D, Henig M (1996) Reservation planning for elective surgery under uncertain demand for emergency surgery. Management Science. 42(3): 321–334

    Article  Google Scholar 

  • Guinet A, Chaabane S (2003) Operating theatre planning. Int J Prod Econ 85: 69–81

    Article  Google Scholar 

  • Gupta D (2007) Surgical suites’ operations management. Prod Oper Manag 16(6): 689–700

    Article  Google Scholar 

  • Hans E, Wullink G, van Houdenhoven M, Kazemier G (2008) Robust surgery loading. Eur J Oper Res 185: 1038–1050

    Article  Google Scholar 

  • Herring WL (2010) A stochastic dynamic program for the single-day surgery scheduling problem.In: Proceedings of the 2010 IIE Society for Health Systems Annual Conference, Atlanta, 25–28 Feb 2010

  • Herring WL (2011) Prioritizing patients: stochastic dynamic programming for surgery scheduling and mass casualty incident triage. Ph.D. Dissertation, University of Maryland, College Park, MD. Available at http://hdl.handle.net/1903/11689

  • Lee TC, Hersh M (1993) A model for dynamic airline seat inventory control with multiple seat bookings. Transp Sci 27(3): 252–265

    Article  Google Scholar 

  • Macario A, Vitez T, Dunn B, McDonald T (1995) Where are the costs in perioperative care? Analysis of hospital costs and charges for inpatient surgical care. Anesthesiology 83(6): 1138–1144

    Article  Google Scholar 

  • McManus M, Long M, Cooper A, Mandell J, Berwick D, Pagano M, Litvak E (2003) Variability in surgical caseload and access to intensive care services. Anesthesiology 98(6): 1491–1496

    Article  Google Scholar 

  • Ozkarahan I (2000) Allocation of surgeries to operating rooms by goal programing. J Med Syst 24(6): 339–378

    Article  Google Scholar 

  • Pham D, Klinkert A (2008) Surgical case scheduling as a generalized job shop scheduling problem. Eur J Oper Res 185: 1011–1025

    Article  Google Scholar 

  • Santibañez P, Begen M, Atkins D (2007) Surgical block scheduling in a system of hospitals: an application to resource and wait list management in a British Columbia health authority. Health Care Manag Sci 10: 269–282

    Article  Google Scholar 

  • Schütz H-J, Kolisch R (2010a) Approximate dynamic programming for capacity allocation in the service industry. Working paper, available at SSRN: http://ssrn.com/abstract=1618315

  • Schütz H-J, Kolisch R (2010b) Capacity allocation for demand of different customer–product–combinations with cancellation, no–shows, and overbooking when there is a sequential delivery of service. Working paper, available at SSRN: http://ssrn.com/abstract=1618313

  • Subramanian J, Stidham S Jr, Lautenbacher CJ (1999) Airline yield management with overbooking, cancellations, and no-shows. Transp Sci 33(2): 147–167

    Article  Google Scholar 

  • Testi A, Tanfani E, Torre G (2007) A three-phase approach for operating theatre schedules. Health Care Manag Sci 10: 163–172

    Article  Google Scholar 

  • van Oostrum JM, van Houdenhoven M, Hurink JL, Hans EW, Wullink G, Kazemier G (2008) A master surgical scheduling approach for cyclic scheduling in operating room departments. OR Spectr 30(2): 355–374

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to William L. Herring.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Herring, W.L., Herrmann, J.W. The single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics. OR Spectrum 34, 429–459 (2012). https://doi.org/10.1007/s00291-011-0270-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-011-0270-3

Keywords

Navigation