The reactive multiple operating room surgical case sequencing problem
share
In this paper we consider the surgical case sequencing problem (SCSP) under stochastic conditions. In addition to implementing a robust surgical schedule, we investigate the use of a number of reactive strategies that can be used to maintain schedule feasibility. We present a mixed integer nonlinear programming (MINLP) model for the reactive multiple operating room (OR) SCSP that may be suitable for direct implementation on small problem instances. A machine scheduling perspective is considered and the model is equivalent to a resource-constrained parallel-machine scheduling problem with identical machines, machine eligibility restrictions, and machine and job release dates. The explicit objective of the model is to reduce OR idle time, although other common objectives (including time to surgery and overtime) are discussed. The work here is based on a case study of a large Australian public hospital with long surgical waiting lists and high non-elective demand. Results of computational experiments show that the reactive strategies presented in this paper can be used to reduce idle time without putting excessive pressure on surgeons.
READ FULL TEXT
