Complexity results for the basic residency scheduling problem
DOI10.1007/S10951-013-0362-9zbMATH Open1297.90077OpenAlexW1966508863MaRDI QIDQ398919FDOQ398919
Authors: Jiayi Guo, David R. Morrison, Janet A. Jokela, Sheldon H. Jacobson 
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
Recommendations
- A robust framework for task-related resident scheduling
- Scheduling medical residents' training at university hospitals
- A constraint programming-based solution approach for medical resident scheduling problems
- Scheduling trainees at a hospital department using a branch-and-price approach
- On the complexity of manpower shift scheduling
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling trainees at a hospital department using a branch-and-price approach
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
- A constraint programming-based solution approach for medical resident scheduling problems
- Title not available (Why is that?)
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A shift scheduling model for employees with different seniority levels and an application in healthcare
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
Cited In (6)
- State of the art in Physician scheduling
- Scheduling medical residents' training at university hospitals
- Resident scheduling in teaching hospitals
- A decomposition-based heuristic procedure for the medical student scheduling problem
- An exact branch-and-price approach for the medical student scheduling problem
- A robust framework for task-related resident scheduling
This page was built for publication: Complexity results for the basic residency scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398919)
