Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations
DOI10.1016/j.ejor.2018.05.022zbMath1403.90391OpenAlexW2804936867MaRDI QIDQ724114
Mickaël Grima, Christoph Barner, Guillaume Sagnol, Claudia Spies, Ralf Borndörfer, Matthes Seeling, Klaus Wernecke
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.05.022
robust optimizationOR in medicineparallel machines schedulingHilbert's projective metricextensible bin packinglognormal durations
Minimax problems in mathematical programming (90C47) Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- A 13/12 approximation algorithm for bin packing with extendable bins
- Dobrushin's ergodicity coefficient for Markov operators on cones
- Event-based MILP models for resource-constrained project scheduling problems
- A multicut algorithm for two-stage stochastic linear programs
- Finsler structures for the part metric and Hilbert's projective metric and applications to ordinary differential equations
- Hilbert's metric and positive contraction mappings in a Banach space
- Robust scheduling with budgeted uncertainty
- Surgical case scheduling as a generalized job shop scheduling problem
- Robust surgery loading
- Robust Convex Optimization
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- A Robust Optimization Model for Managing Elective Admission in a Public Hospital
- Operating Room Pooling and Parallel Surgery Processing Under Uncertainty
- Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
- Resource allocation by means of project networks: Dominance results
- Parallel Machine Scheduling under Uncertainty
- Cutting-set methods for robust convex optimization with pessimizing oracles
- The Price of Robustness
- Iterated nonlinear maps and Hilbert’s projective metric. II
- Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected Makespan
- Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers
- Discrete-Variable Extremum Problems
- Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
This page was built for publication: Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations
