A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
From MaRDI portal
Publication:2253473
DOI10.1016/j.ejor.2012.09.010zbMath1292.90126OpenAlexW2011574095MaRDI QIDQ2253473
Pratik J. Parikh, April Barnes, Rosalyn Scott, Bharathwaj Vijayakumar, Jennie Gallimore
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.09.010
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)
Related Items (28)
A simulated annealing for a daily operating room scheduling problem under constraints of uncertainty and setup ⋮ Scheduling the hospital-wide flow of elective patients ⋮ Dynamic patient admission scheduling with operating room constraints, flexible horizons, and patient delays ⋮ Surgical scheduling with simultaneous employment of specialised human resources ⋮ Scheduling operating theatres: mixed integer programming vs. constraint programming ⋮ Integer linear programming models for the skiving stock problem ⋮ Scheduling operating rooms: achievements, challenges and pitfalls ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering ⋮ Adopting a hierarchical diagnosis and treatment system to optimize elective surgery scheduling ⋮ Large proper gaps in bin packing and dual bin packing problems ⋮ Operating room planning and surgical case scheduling: a review of literature ⋮ Collaborative Operating Room Planning and Scheduling ⋮ A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints ⋮ Stochastic weekly operating room planning with an exponential number of scenarios ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ The proper relaxation and the proper gap of the skiving stock problem ⋮ Integer rounding and modified integer rounding for the skiving stock problem ⋮ Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling ⋮ Lower bounds and algorithms for the minimum cardinality bin covering problem ⋮ Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling ⋮ Operating room scheduling by considering the decision-making styles of surgical team members: a comprehensive approach ⋮ An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case ⋮ Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut ⋮ Dynamic three-stage operating room scheduling considering patient waiting time and surgical overtime costs ⋮ A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling ⋮ A fuzzy robust stochastic mathematical programming approach for multi-objective scheduling of the surgical cases ⋮ Adaptive Bin Packing with Overflow
This page was built for publication: A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
