An efficient computational method for large scale surgery scheduling problems with chance constraints

DOI10.1007/S10589-017-9947-0MaRDI QIDQ1744896zbMATH OpenOpenAlexFDO

Authors Mahdi Noorizadegan, Abbas Seifi

Publication date 20 April 2018

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-017-9947-0

zbMATH Keywords

integer programmingset-partitioning formulationinteger chance constrained programmingsurgery planning and scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• Efficient optimization algorithms for surgical scheduling under uncertainty
• Dealing with uncertain surgery times in operating room scheduling
• A two-stage robust optimization method for solving surgery scheduling problem
• Robust scheduling method for resource-constrained operation rooms with uncertain processing time
• A constraint-programming-based branch-and-price-and-cut approach for operating room planning and scheduling

Cites work

• A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
• A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
• A mixed integer programming approach for allocating operating room capacity
• A progressive hedging approach for surgery planning under uncertainty
• A robust optimization model for managing elective admission in a public hospital
• A unified exact method for solving different classes of vehicle routing problems
• Branch-and-price: Column generation for solving huge integer programs
• Chance-Constrained Binary Packing Problems
• Chance-constrained programming
• Convex Approximations of Chance Constrained Programs
• Decomposition algorithms for two-stage chance-constrained programs
• MIP reformulations of the probabilistic set covering problem
• Operating room planning and scheduling: a literature review
• Operating room pooling and parallel surgery processing under uncertainty
• Optimal allocation of surgery blocks to operating rooms under uncertainty
• Probabilistic set covering with correlations
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Scheduling elective surgery under uncertainty and downstream capacity constraints
• Two-stage stochastic mixed-integer programs: algorithms and insights

Cited in

(10)

• Chance constrained programming models for intelligent scheduling problems and their efficient solutions
• Dealing with uncertain surgery times in operating room scheduling
• Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
• A combined optimization-simulation approach to the master surgical scheduling problem
• Current trends in operating room scheduling 2015 to 2020: a literature review
• The single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics
• Different stakeholders' perspectives for a surgical case assignment problem: deterministic and robust approaches
• Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data
• A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP)
• A combinatorial auction mechanism for surgical scheduling considering surgeon's private availability information

This page was built for publication: An efficient computational method for large scale surgery scheduling problems with chance constraints

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