Hospital resident scheduling problem

被引:0
作者
Sherali, HD
Ramahi, MH
Saifee, QJ
机构
[1] Virginia Polytech Inst & State Univ, Grado Dept Ind & Syst Engn 0118, Blacksburg, VA 24061 USA
[2] Delta Technol Inc, Dept 709, Atlanta, GA USA
[3] WIT Inc, St Clair Shores, MI 48080 USA
关键词
resident scheduling; mixed-integer programming; network flows; sequential heuristics;
D O I
10.1080/09537280110069667
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper addresses the resident scheduling problem (RSP) at hospitals concerned with prescribing work-nights for residents while considering departmental staffing and skill requirements as well as residents' preferences. Three scenarios that represent most situations and account for various departmental requirements and needs are described. Although similar scheduling problems are considered in the literature, no analysis exists that adequately deals with the specific nature of this problem. The problem is modeled as a mixed-integer program and heuristic solution procedures are developed for the different identified scheduling scenarios. These procedures exploit the inherent network structure of the problem which is an important feature that enhances problem solvability. For the sake of comparison, the problem is also solved exactly via the CPLEX-MIP (version 6.0) package. The contribution of this work is important since many hospitals are still utilizing manual techniques in preparing their own schedules, expending considerable effort and time and yet contending with limited scheduling flexibility.
引用
收藏
页码:220 / 233
页数:14
相关论文
共 26 条
[1]   SCHEDULING A FULL-TIME WORKFORCE TO MEET CYCLIC STAFFING REQUIREMENTS [J].
BAKER, KR .
MANAGEMENT SCIENCE SERIES B-APPLICATION, 1974, 20 (12) :1561-1568
[2]   FORMULATING A MIXED-INTEGER PROGRAMMING PROBLEM TO IMPROVE SOLVABILITY [J].
BARNHART, C ;
JOHNSON, EL ;
NEMHAUSER, GL ;
SIGISMONDI, G ;
VANCE, P .
OPERATIONS RESEARCH, 1993, 41 (06) :1013-1019
[3]   CYCLIC SCHEDULING VIA INTEGER PROGRAMS WITH CIRCULAR ONES [J].
BARTHOLDI, JJ ;
ORLIN, JB ;
RATLIFF, HD .
OPERATIONS RESEARCH, 1980, 28 (05) :1074-1085
[4]  
BAZARAA MS, 1990, LINEAR PROGRAMMING N
[5]   A tree search algorithm for the crew scheduling problem [J].
Beasley, JE ;
Cao, B .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (03) :517-526
[6]  
Beaumont N, 1997, J OPER RES SOC, V48, P585
[7]   Scheduling staff using mixed integer programming [J].
Beaumont, N .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 98 (03) :473-484
[8]   RELAXATION METHODS FOR MINIMUM COST ORDINARY AND GENERALIZED NETWORK FLOW PROBLEMS [J].
BERTSEKAS, DP ;
TSENG, P .
OPERATIONS RESEARCH, 1988, 36 (01) :93-114
[9]  
BLANTIFY J, 1969, 36 NAT M ORSA MIAM B
[10]  
BURNS RN, 1978, INFOR, V16, P101