2013
DOI: 10.1007/s10951-013-0362-9
|View full text |Cite
|
Sign up to set email alerts
|

Complexity results for the basic residency scheduling problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
16
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 29 publications
(16 citation statements)
references
References 16 publications
0
16
0
Order By: Relevance
“…Whereas the structure of emergency medicine and anesthesia training programs may benefit from optimizing individual shift scheduling, other programs have pre-defined rotations with a set shift schedule which repeats on a weekly to monthly basis. The basic problem of assigning trainees to rotations while satisfying hospital staffing and trainee education requirements is NP-complete , requiring exponentially more time to solve when accounting for increasing numbers of trainees and rotations [ 11 ]. Therefore, heuristic approaches are often used to identify near-optimal solutions within a reasonable time constraint.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Whereas the structure of emergency medicine and anesthesia training programs may benefit from optimizing individual shift scheduling, other programs have pre-defined rotations with a set shift schedule which repeats on a weekly to monthly basis. The basic problem of assigning trainees to rotations while satisfying hospital staffing and trainee education requirements is NP-complete , requiring exponentially more time to solve when accounting for increasing numbers of trainees and rotations [ 11 ]. Therefore, heuristic approaches are often used to identify near-optimal solutions within a reasonable time constraint.…”
Section: Introductionmentioning
confidence: 99%
“…Computerized schedules have demonstrated improved ability to satisfy preferences when compared to manual schedules in programs with fewer than 100 trainees [ 3 , 13 ]. A simplified version of the problem, accounting for staffing and educational requirements without incorporating intern and resident preferences, can be rapidly solved in a “greedy” fashion for larger programs–this algorithm has been successfully implemented at the University of Illinois College of Medicine [ 11 , 12 ]. An integer programming model applied to the surgical residency program at Emory University School of Medicine was able to identify near optimal staffing for 28 rotations, although certain requests such as vacation preferences were not accommodated in this solution [ 14 ].…”
Section: Introductionmentioning
confidence: 99%
“…Multi-period assignment problems arise in many instances, which include organizational training programs [1], doctor assignment ( [2] and [3]), in scheduling law enforcement agency to elections [4], and in assigning airline customer service agent [5]. Such problems have attracted many researchers for years in which it is formulated as a multi-dimensional assignment problem [6].…”
Section: Introductionmentioning
confidence: 99%
“…For the problem addressed here, it is formulated as a multidimensional assignment problem as stated in [1] or it can also be formulated as a multiperiod assignment problem [3] and [4]. The application of this problem category spans many areas of staff assignments, such as in medical staffing [4] and [5], in scheduling law enforcement agency to elections [6], and in assigning airline customer service agent [7].…”
Section: Introductionmentioning
confidence: 99%