A new heuristic algorithm for the operating room scheduling problem

doi:10.1016/j.cie.2011.05.020

A new heuristic algorithm for the operating room scheduling problem

2011-10-01

49

PRE

AI

DOI：10.1016/j.cie.2011.05.020

Original

Original request for help

Save

Abstract

En 中文

Due to the great importance of operating rooms in hospitals, this paper studies an operating room scheduling problem with open scheduling strategy. According to this strategy, no time slot is reserved for a particular surgeon. The surgeons can use all available time slots. Based on Fei et al.'s model which is considered to be close to reality, we develop a heuristic algorithm to solve it. The idea of this heuristic algorithm is from dynamic programming by aggregating states to avoid the explosion of the number of states. The objective of this paper is to design an operating program to maximize the operating rooms' use efficiency and minimize the overtime cost. Computational results show that our algorithm is efficient, especially for large size instances where our algorithm always finds feasible solutions while the algorithm of Fei et al. does not. (C) 2011 Elsevier Ltd. All rights reserved.

Keywords:

Operating room

Dynamic programming

Set partitioning

Open scheduling

A new heuristic algorithm for the operating room scheduling problem

Abstract

Journal

Organization