EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||||||||
|
van Oostrum, J.M. and van Houdenhoven, M. and Hurink, J.L. and Hans, E.W. and Wullink, G. and Kazemier, G.
(2008)
A master surgical scheduling approach for cyclic scheduling in operating room departments.
OR Spectrum, 30 (2).
pp. 355-374.
ISSN 0171-6468
*** ISI Impact 1,233 ***
Full text available as:
Official URL: http://dx.doi.org/10.1007/s00291-006-0068-x ![]() AbstractThis 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.
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||||||||
