Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut

DOI10.1016/j.ejor.2020.12.004zbMath1487.90317OpenAlexW3111837762MaRDI QIDQ2030502

Vahid Roshanaei, Bahman Naderi

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.004

zbMATH Keywords

healthcarecombinatorial optimizationlogic-based Benders decompositionbranch-and-price-and-cutintegrated operating room planning and scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items

Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut ⋮ Stochastic weekly operating room planning with an exponential number of scenarios ⋮ A hybrid heuristic approach to master surgery scheduling with downstream resource constraints and dividable operating room blocks ⋮ The multiphase course timetabling problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Scheduling operating rooms: achievements, challenges and pitfalls
• Operating room scheduling with generalized disjunctive programming
• Mixed integer programming models for job shop scheduling: A computational analysis
• An integer programming approach to elective surgery scheduling: analysis and comparison based on a real case
• An integer programming algorithm for routing optimization in IP networks
• A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP)
• Almost robust discrete optimization
• An improved Benders decomposition applied to a multi-layer network design problem
• The distributed permutation flowshop scheduling problem
• Logic-based Benders decomposition
• A Benders decomposition-based framework for solving quay crane scheduling problems
• Recursive logic-based Benders' decomposition for multi-mode outpatient scheduling
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
• Two-stage robust optimization approach to elective surgery and downstream capacity planning
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling
• A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
• New decomposition methods for home care scheduling with predefined visits
• Surgical case scheduling as a generalized job shop scheduling problem
• Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
• Logic-Based Decomposition Methods for the Travelling Purchaser Problem
• Scheduling Home Hospice Care with Logic-Based Benders Decomposition
• A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling
• Operating Room Pooling and Parallel Surgery Processing Under Uncertainty
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
• Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
• Planning and Scheduling by Logic-Based Benders Decomposition
• New MILP models for the permutation flowshop problem
• Collaborative Operating Room Planning and Scheduling
• Integrated Anesthesiologist and Room Scheduling for Surgeries: Methodology and Application
• The Schedule-Sequencing Problem
• A combined optimization-simulation approach to the master surgical scheduling problem
• Patient mix optimization in tactical cardiothoracic surgery planning: a case study