Complexity results for the basic residency scheduling problem
From MaRDI portal
Publication:398919
DOI10.1007/s10951-013-0362-9zbMath1297.90077MaRDI QIDQ398919
Jacobson, Sheldon H., Jiayi Guo, David R. Morrison, Janet A. Jokela
Publication date: 18 August 2014
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0362-9
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90B90: Case-oriented studies in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A constraint programming-based solution approach for medical resident scheduling problems
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- A shift scheduling model for employees with different seniority levels and an application in healthcare
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- Scheduling trainees at a hospital department using a branch-and-price approach
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria