Complexity results for the basic residency scheduling problem

DOI10.1007/S10951-013-0362-9zbMath1297.90077OpenAlexW1966508863MaRDI QIDQ398919

Janet A. Jokela, David R. Morrison, Jiayi Guo, Jacobson, Sheldon H.

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

zbMATH Keywords

alternate optimamedical schoolresidency programschedule perturbation

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (4)

An exact branch-and-price approach for the medical student scheduling problem ⋮ State of the art in Physician scheduling ⋮ A robust framework for task-related resident scheduling ⋮ A decomposition-based heuristic procedure for the medical student scheduling problem

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity results for the basic residency scheduling problem