An efficient computational method for large scale surgery scheduling problems with chance constraints
DOI10.1007/S10589-017-9947-0zbMATH Open1403.90355OpenAlexW2763942039MaRDI QIDQ1744896FDOQ1744896
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
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
integer programmingset-partitioning formulationinteger chance constrained programmingsurgery planning and scheduling
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cites Work
- Chance-constrained programming
- Two-stage stochastic mixed-integer programs: algorithms and insights
- Branch-and-price: Column generation for solving huge integer programs
- Convex Approximations of Chance Constrained Programs
- Operating room planning and scheduling: a literature review
- Decomposition algorithms for two-stage chance-constrained programs
- Chance-Constrained Binary Packing Problems
- Optimal allocation of surgery blocks to operating rooms under uncertainty
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- MIP reformulations of the probabilistic set covering problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Operating room pooling and parallel surgery processing under uncertainty
- Probabilistic set covering with correlations
- Scheduling elective surgery under uncertainty and downstream capacity constraints
- A unified exact method for solving different classes of vehicle routing problems
- 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 Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem
Cited In (10)
- Different stakeholders' perspectives for a surgical case assignment problem: deterministic and robust approaches
- A combinatorial auction mechanism for surgical scheduling considering surgeon's private availability information
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints
- Chance constrained programming models for intelligent scheduling problems and their efficient solutions
- A combined optimization-simulation approach to the master surgical scheduling problem
- The single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics
- Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data
- A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP)
- Dealing with uncertain surgery times in operating room scheduling
- Current trends in operating room scheduling 2015 to 2020: a literature review
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)
