A sequential follower refinement algorithm for robust surgery scheduling

DOI10.1287/IJOC.2022.0191MaRDI QIDQ6580565zbMATH OpenFDO

Authors Ankit Bansal, Jean-Philippe Richard, Bjorn P. Berg, Yuli Huang

Publication date 29 July 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/IJOC.2022.0191

zbMATH Keywords

Chvátal-Gomory cutscolumn generationconvex hull approximationrobust optimizationsurgery scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Mixed integer programming (90C11) Robustness in mathematical programming (90C17)

Recommendations

• A value function-based approach for robust surgery planning
• Optimal allocation of surgery blocks to operating rooms under uncertainty
• A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling
• Operating room management under uncertainty
• Efficient optimization algorithms for surgical scheduling under uncertainty

Cited in

(2)

• A multiobjective -constraint based approach for the robust master surgical schedule under multiple uncertainties
• Generalized last open-end bin packing problem

This page was built for publication: A sequential follower refinement algorithm for robust surgery scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580565)