Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling

DOI10.1016/j.ejor.2016.08.024zbMath1394.90302OpenAlexW2516687230MaRDI QIDQ1752822

Dionne M. Aleman, Curtiss Luong, Vahid Roshanaei, David Urbach

Publication date: 24 May 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.2016.08.024

zbMATH Keywords

propagationimplementationcut strengthdistributed operating room schedulinglogic-based Benders' decomposition

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Current trends in operating room scheduling 2015 to 2020: a literature review, A simulated annealing for a daily operating room scheduling problem under constraints of uncertainty and setup, Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms, Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling, Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition, An approximate dynamic programming approach to the admission control of elective patients, Assembly planning by disjunctive programming and geometrical reasoning, Designing master surgery schedules with downstream unit integration via stochastic programming, Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling, Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems, Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut, Operating room scheduling for non-operating room anesthesia with emergency uncertainty, The stochastic pseudo-star degree centrality problem, Operating room planning and surgical case scheduling: a review of literature, A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network, Collaborative Operating Room Planning and Scheduling, Stochastic weekly operating room planning with an exponential number of scenarios, Logic-Based Benders Decomposition for Large-Scale Optimization, Almost robust discrete optimization, The Benders decomposition algorithm: a literature review, Operating room scheduling by considering the decision-making styles of surgical team members: a comprehensive approach, Multi-warehouse package consolidation for split orders in online retailing, Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut, Logic-based Benders decomposition algorithm for contamination detection problem in water networks, Order assignment and scheduling under processing and distribution time uncertainty

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• A simulation based approximate dynamic programming approach to multi-class, multi-resource surgical scheduling
• Surgical scheduling with simultaneous employment of specialised human resources
• Scheduling operating theatres: mixed integer programming vs. constraint programming
• An integer programming approach to elective surgery scheduling: analysis and comparison based on a real case
• The single-day surgery scheduling problem: sequential decision-making and threshold-based heuristics
• A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP)
• The capacity and distance constrained plant location problem
• Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
• Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
• Operating room planning and scheduling: a literature review
• The distributed permutation flowshop scheduling problem
• Partitioning procedures for solving mixed-variables programming problems
• Logic-based Benders decomposition
• A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
• A column generation approach for solving the patient admission scheduling problem
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machine
• Decomposition Methods for the Parallel Machine Scheduling Problem with Setups
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
• A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling
• Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations
• Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
• Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
• Operating Room Pooling and Parallel Surgery Processing Under Uncertainty
• Reconsidering Mixed Integer Programming and MIP-Based Hybrids for Scheduling
• Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
• Planning and Scheduling by Logic-Based Benders Decomposition
• Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems