Coordinated lab-clinics: a tactical assignment problem in healthcare
From MaRDI portal
Publication:1695040
DOI10.1016/j.ejor.2017.05.012zbMath1380.90306MaRDI QIDQ1695040
Farzad Zaerpour, Diane P. Bischak, Mozart B. C. Menezes
Publication date: 6 February 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.2017.05.012
90C90: Applications of mathematical programming
90C11: Mixed integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B35: Deterministic scheduling theory in operations research
92C50: Medical applications (general)
90B80: Discrete location and assignment
Cites Work
- Unnamed Item
- Surgical scheduling with simultaneous employment of specialised human resources
- A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints
- A MILP model for the teacher assignment problem considering teachers' preferences
- A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP)
- Assignment problems: a golden anniversary survey
- Scheduling elective surgery under uncertainty and downstream capacity constraints
- Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
- A 3/4-approximation algorithm for multiple subset sum
- Nurse scheduling with tabu search and strategic oscillation
- Geometric versions of the three-dimensional assignment problem under general norms
- A 0-1 goal programming model for nurse scheduling
- An approach to optimize block surgical schedules
- A cardinality-constrained robust model for the assignment problem in home care services
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- A stochastic model for operating room planning with elective and emergency demand for surgery
- Robust surgery loading
- Outpatient appointment scheduling given individual day-dependent no-show predictions
- The Multiple Subset Sum Problem
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
- Decomposition Principle for Linear Programs