Annual block scheduling for internal medicine residents with 4+1 templates

被引:16
作者
Bard, Jonathan F. [1 ]
Shu, Zhichao [1 ]
Morrice, Douglas J. [1 ]
Leykum, Luci K. [2 ]
机构
[1] Univ Texas Austin, Austin, TX 78712 USA
[2] Univ Texas Hlth Sci Ctr San Antonio, San Antonio, TX 78229 USA
关键词
resident scheduling; 4+1 block scheduling; medical rotations; soft constraints; mixed-integer programming; CONTINUITY; MODEL; CARE; ROTATIONS; TRAINEES; OUTCOMES; BREAK;
D O I
10.1057/jors.2015.109
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Internal Medicine residency programmes have traditionally been structured around monthly or 4-week blocks where a different rotation is assigned to each block over the year. A subset of those rotations carry the requirement of one or two half-day sessions of clinic duty per week. In the last several years, a growing number of Internal Medicine residency programmes have moved away from this traditional structure and have adopted an 'X + Y' template, where the resident spends X weeks on a rotation without clinic duty and then Y weeks mostly in clinic. This paper addresses the '4 + 1' annual block scheduling problem as adopted by the Department of Medicine at the University of Texas Health Science Center in San Antonio (UTHSC-SA). We believe it is the first attempt to investigate the problem formally; specifically, we develop a series of optimization models that can be used to construct individual block schedules for the academic year and to assign clinic sessions to the residents during their ambulatory week. (At UTHSC-SA, Internal Medicine residents are divided into five groups to match the 4 + 1 pattern, and scheduled so only one group at a time has clinic responsibilities each of the 52 weeks.) The objective is to balance the workload during the half-day clinic sessions and to ensure that each resident receives roughly the same training experiences over their programme. Once the blocks and groups are known, a second optimization problem is solved to determine individual clinic session assignments. The basic model takes the form of a mixed-integer program but was not solvable with commercial software. After decomposing it into two parts, we were able to find optimal solutions to the original problem. Complexity results are provided for the problems solved. Compared with current practice, our decomposition approach was seen to offer improved schedules with respect to the workload balance objective for each of the five resident groups.
引用
收藏
页码:911 / 927
页数:17
相关论文
共 34 条
[1]   Operator staffing and scheduling for an IT-help call centre [J].
Alfares, Hesham K. .
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2007, 1 (04) :414-430
[2]  
[Anonymous], 2015, Common program requirements
[3]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[4]  
Aykin T, 1996, MANAGE SCI, V42, P5
[5]  
Bard J. F., 2013, IIE T HEALTHCARE SYS, V3, P207, DOI DOI 10.1080/19488300.2013.857370
[6]   Preference scheduling for nurses using column generation [J].
Bard, JF ;
Purnomo, HW .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 164 (02) :510-534
[7]  
Bard JF, 2016, IIE T HEALTHCARE SYS
[8]   A network-based approach for monthly scheduling of residents in primary care clinics [J].
Bard, Jonathan F. ;
Shu, Zhichao ;
Leykum, Luci .
OPERATIONS RESEARCH FOR HEALTH CARE, 2014, 3 (04) :200-214
[9]  
Beaulieu H, 2000, Health Care Manag Sci, V3, P193
[10]   IMPLICIT MODELING OF FLEXIBLE BREAK ASSIGNMENTS IN OPTIMAL SHIFT SCHEDULING [J].
BECHTOLD, SE ;
JACOBS, LW .
MANAGEMENT SCIENCE, 1990, 36 (11) :1339-1351