Complexity results for the basic residency scheduling problem
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 2080236 (Why is no real title available?)
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- A constraint programming-based solution approach for medical resident scheduling problems
- 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
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- Scheduling trainees at a hospital department using a branch-and-price approach
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)
