A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling

Published Online:https://doi.org/10.1287/ijoc.2022.0191

References

  • Ardestani-Jaafari A, Delage E (2016) Robust optimization of sums of piecewise linear functions with application to inventory problems. Oper. Res. 64(2):474–494.LinkGoogle Scholar
  • Ardestani-Jaafari A, Delage E (2021) Linearized robust counterparts of two-stage robust optimization problems with applications in operations management. INFORMS J. Comput. 33(3):1138–1161.LinkGoogle Scholar
  • Bai M, Storer RH, Tonkay GL (2022) Surgery sequencing coordination with recovery resource constraints. INFORMS J. Comput. 34(2):1207–1223.LinkGoogle Scholar
  • Bam M, Denton BT, Van Oyen MP, Cowen ME (2017) Surgery scheduling with recovery resources. IISE Trans. 49(10):942–955.CrossrefGoogle Scholar
  • Bansal A, Berg B, Huang YL (2021a) A distributionally robust optimization approach for coordinating clinical and surgical appointments. IISE Trans. 53(12):1311–1323.Google Scholar
  • Bansal A, Berg BP, Huang YL (2021b) A value function-based approach for robust surgery planning. Comput. Oper. Res. 132:105313.CrossrefGoogle Scholar
  • Bansal A, Richard JPP, Bjorn BP, Huang YL (2023) A sequential follower refinement algorithm for robust surgery scheduling. http://dx.doi.org/10.1287/ijoc.2022.0191.cd, https://github.com/INFORMSJoC/2022.0191.Google Scholar
  • Berg BP, Denton BT, Erdogan SA, Rohleder T, Huschka T (2014) Optimal booking and scheduling in outpatient procedure centers. Comput. Oper. Res. 50:24–37.CrossrefGoogle Scholar
  • Cardoen B, Demeulemeester E, Beliën J (2010) Operating room planning and scheduling: A literature review. Eur. J. Oper. Res. 201(3):921–932.CrossrefGoogle Scholar
  • Childers CP, Maggard-Gibbons M (2018) Understanding costs of care in the operating room. JAMA Surgery 153(4):e176233–e176233.CrossrefGoogle Scholar
  • Chvátal V (1973) Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4:305–337.CrossrefGoogle Scholar
  • Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann. Oper. Res. 153(1):235–256.CrossrefGoogle Scholar
  • Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, 1st ed. (Springer, Berlin).CrossrefGoogle Scholar
  • Dell’Olmo P, Kellerer H, Speranza MG, Tuza Z (1998) A 13/12 approximation algorithm for bin packing with extendable bins. Inform. Processing Lett. 65(5):229–233.CrossrefGoogle Scholar
  • Deng Y, Shen S, Denton B (2019) Chance-constrained surgery planning under conditions of limited and ambiguous data. INFORMS J. Comput. 31(3):559–575.LinkGoogle Scholar
  • Denton B, Viapiano J, Vogl A (2007) Optimization of surgery sequencing and scheduling decisions under uncertainty. Health Care Management Sci. 10(1):13–24.CrossrefGoogle Scholar
  • Denton BT, Miller AJ, Balasubramanian HJ, Huschka TR (2010) Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. 58(4):802–816.LinkGoogle Scholar
  • Erdogan SA, Denton BT, Cochran J, Cox L, Keskinocak P, Kharoufeh J, Smith J, eds. (2011) Surgery Planning and Scheduling (Wiley, Hoboken, NJ).CrossrefGoogle Scholar
  • Ferrand YB, Magazine MJ, Rao US (2014) Managing operating room efficiency and responsiveness for emergency and elective surgeries-a literature survey. IIE Trans. Healthcare System Engrg. 4(1):49–64.CrossrefGoogle Scholar
  • Fischetti M, Lodi A (2007) Optimizing over the first Chvátal closure. Math. Programming 110(1):3–20.CrossrefGoogle Scholar
  • Fischetti M, Lodi A, Tramontani A (2011) On the separation of disjunctive cuts. Math. Programming 128(1):205–230.CrossrefGoogle Scholar
  • Fortet R (1960) Applications de l’algèbre de boole en recherche opérationelle. Rev. Française Recherche Opér. 4(14):17–26.Google Scholar
  • Fügener A, Hans EW, Kolisch R, Kortbeek N, Vanberkel PT (2014) Master surgery scheduling with consideration of multiple downstream units. Eur. J. Oper. Res. 239(1):227–236.CrossrefGoogle Scholar
  • Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull. Amer. Math. Soc. (New Series) 64:275–278.CrossrefGoogle Scholar
  • Grötschel M, Lovász L, Schrijver A (1981) The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2):169–197.CrossrefGoogle Scholar
  • Guerriero F, Guido R (2011) Operational research in the management of the operating theatre: A survey. Health Care Management Sci. 14(1):89–114.CrossrefGoogle Scholar
  • Gupta D (2007) Surgical suites’ operations management. Production Oper. Management 16(6):689–700.CrossrefGoogle Scholar
  • Johnson EL, Mehrotra A, Nemhauser GL (1993) Min-cut clustering. Math. Programming 62(1–3):133–151.CrossrefGoogle Scholar
  • Liu N, Truong VA, Wang X, Anderson BR (2019) Integrated scheduling and capacity planning with considerations for patients’ length-of-stays. Production Oper. Management 28(7):1735–1756.CrossrefGoogle Scholar
  • Makboul S, Kharraja S, Abbassi A, Alaoui AEH (2022) A two-stage robust optimization approach for the master surgical schedule problem under uncertainty considering downstream resources. Health Care Management Sci. 25(1):63–88.CrossrefGoogle Scholar
  • Mancilla C, Storer R (2012) A sample average approximation approach to stochastic appointment sequencing and scheduling. IIE Trans. 44(8):655–670.CrossrefGoogle Scholar
  • May JH, Spangler WE, Strum DP, Vargas LG (2011) The surgical scheduling problem: Current research and future opportunities. Production Oper. Management 20(3):392–405.CrossrefGoogle Scholar
  • Meyer RR (1974) On the existence of optimal solutions to integer and mixed-integer programming problems. Math. Programming 7(1):223–235.CrossrefGoogle Scholar
  • Min D, Yih Y (2010) Scheduling elective surgery under uncertainty and downstream capacity constraints. Eur. J. Oper. Res. 206(3):642–652.CrossrefGoogle Scholar
  • Muñoz E, Muñoz W III, Wise L (2010) National and surgical healthcare expenditures, 2005–2025. Ann. Surgery 251(2):195–200.CrossrefGoogle Scholar
  • Neyshabouri S, Berg BP (2017) Two-stage robust optimization approach to elective surgery and downstream capacity planning. Eur. J. Oper. Res. 260(1):21–40.CrossrefGoogle Scholar
  • Rath S, Rajaram K, Mahajan A (2017) Integrated anesthesiologist and room scheduling for surgeries: Methodology and application. Oper. Res. 65(6):1460–1478.LinkGoogle Scholar
  • Sagnol G, Barner C, Borndörfer R, Grima M, Seeling M, Spies C, Wernecke K (2018) Robust allocation of operating rooms: A cutting plane approach to handle lognormal case durations. Eur. J. Oper. Res. 271(2):420–435.CrossrefGoogle Scholar
  • Shehadeh KS, Padman R (2021) A distributionally robust optimization approach for stochastic elective surgery scheduling with limited intensive care unit capacity. Eur. J. Oper. Res. 290(3):901–913.CrossrefGoogle Scholar
  • Sherali HD, Adams WP (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3):411–430.CrossrefGoogle Scholar
  • Stey AM, Brook RH, Needleman J, Hall BL, Zingmond DS, Lawson EH, Ko CY (2015) Hospital costs by cost center of inpatient hospitalization for Medicare patients undergoing major abdominal surgery. J. Amer. College Surgery 220(2):207–217.CrossrefGoogle Scholar
  • Strum DP, May JH, Vargas LG (2000) Modeling the uncertainty of surgical procedure times: Comparison of log-normal and normal models. Anesthesiology 92(4):1160–1167.CrossrefGoogle Scholar
  • Vandenberghe M, De Vuyst S, Aghezzaf EH, Bruneel H (2019) Surgery sequencing to minimize the expected maximum waiting time of emergent patients. Eur. J. Oper. Res. 275(3):971–982.CrossrefGoogle Scholar
  • Wang S, Li J, Mehrotra S (2021) Chance-constrained multiple bin packing problem with an application to operating room planning. INFORMS J. Comput. 33(4):1661–1677.AbstractGoogle Scholar
  • Wang Y, Zhang Y, Tang J (2019) A distributionally robust optimization approach for surgery block allocation. Eur. J. Oper. Res. 273(2):740–753.CrossrefGoogle Scholar
  • Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5):457–461.CrossrefGoogle Scholar
  • Zhang Y, Shen S, Erdogan SA (2018) Solving 0–1 semidefinite programs for distributionally robust allocation of surgery blocks. Optim. Lett. 12(7):1503–1521.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.