A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling
DOI10.1287/ijoc.2015.0686zbMath1348.90271OpenAlexW2348420909MaRDI QIDQ2830948
Seyed Hossein Hashemi Doulabi, Gilles Pesant, Louis-Martin Rousseau
Publication date: 1 November 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f2ef328bf5d137450aaf2698dba65c47cb7cd562
constraint programmingbranch-and-price-and-cutintegrated operating room planning and schedulingoperations research in healthcare
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (25)
Cites Work
- Unnamed Item
- Unnamed Item
- An integer programming approach to elective surgery scheduling: analysis and comparison based on a real case
- Cover and pack inequalities for (mixed) integer programming
- 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
- A goal programming approach to strategic resource allocation in acute care hospitals
- A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
- Solving Talent Scheduling with Dynamic Programming
- Operating Room Pooling and Parallel Surgery Processing Under Uncertainty
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem
This page was built for publication: A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling