A master surgical scheduling approach for cyclic scheduling in operating room departments

被引:141
作者
van Oostrum, Jeroen M. [1 ]
Van Houdenhoven, M. [1 ]
Hurink, J. L. [3 ]
Hans, E. W. [4 ]
Wullink, G. [1 ]
Kazemier, G. [1 ,2 ]
机构
[1] Erasmus MC, Dept Operating Rooms Anesthesiol & Intens Care, NL-3000 CA Rotterdam, Netherlands
[2] Erasmus MC, Dept Surg, NL-3000 CA Rotterdam, Netherlands
[3] Univ Twente, Dept Elect Engn Math & Comp Sci, NL-7500 AE Enschede, Netherlands
[4] Univ Twente, Sch Business Publ Adm & Technol, NL-7500 AE Enschede, Netherlands
关键词
scheduling; master surgical schedules; healthcare planning; mathematical modeling; 90B35;
D O I
10.1007/s00291-006-0068-x
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper addresses the problem of operating room (OR) scheduling at the tactical level of hospital planning and control. Hospitals repetitively construct operating room schedules, which is a time-consuming, tedious, and complex task. The stochasticity of the durations of surgical procedures complicates the construction of operating room schedules. In addition, unbalanced scheduling of the operating room department often causes demand fluctuation in other departments such as surgical wards and intensive care units. We propose cyclic operating room schedules, so-called master surgical schedules (MSSs) to deal with this problem. In an MSS, frequently performed elective surgical procedure types are planned in a cyclic manner. To deal with the uncertain duration of procedures we use planned slack. The problem of constructing MSSs is modeled as a mathematical program containing probabilistic constraints. Since the resulting mathematical program is computationally intractable we propose a column generation approach that maximizes the operation room utilization and levels the requirements for subsequent hospital beds such as wards and intensive care units in two subsequent phases. We tested the solution approach with data from the Erasmus Medical Center. Computational experiments show that the proposed solution approach works well for both the OR utilization and the leveling of requirements of subsequent hospital beds.
引用
收藏
页码:355 / 374
页数:20
相关论文
共 33 条
[1]  
[Anonymous], SPRINGER SERIES OPER
[2]  
BAKKER H, 2002, ZORGVISIE, P7
[3]   Branch-and-price: Column generation for solving huge integer programs [J].
Barnhart, C ;
Johnson, EL ;
Nemhauser, GL ;
Savelsbergh, MWP ;
Vance, PH .
OPERATIONS RESEARCH, 1998, 46 (03) :316-329
[4]  
BELIEN J, 2005, IN PRESS EUR J OPER
[5]  
Bisschop J., 1999, Aimms Optimization Modeling
[6]   Mount Sinai Hospital uses integer programming to allocate operating room time [J].
Blake, JT ;
Donald, J .
INTERFACES, 2002, 32 (02) :63-73
[7]   Resource-constrained project scheduling: Notation, classification, models, and methods [J].
Brucker, P ;
Drexl, A ;
Mohring, R ;
Neumann, K ;
Pesch, E .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 112 (01) :3-41
[8]  
CARTER M, 2002, OPER RES MANAGE APR, P26
[9]   CRITICAL PATH ANALYSES VIA CHANCE CONSTRAINED + STOCHASTIC-PROGRAMMING [J].
CHARNES, A ;
COOPER, WW ;
THOMPSON, GL .
OPERATIONS RESEARCH, 1964, 12 (03) :460-&
[10]   Approximation algorithms for partitioning small items in unequal bins to minimize the total size [J].
Dell'Olmo, P ;
Speranza, MG .
DISCRETE APPLIED MATHEMATICS, 1999, 94 (1-3) :181-191