Abstract

In this paper, we consider a stochastic optimization model for a surgical scheduling problem with a single operating room. The goal is to determine the optimal start times of multiple elective surgeries within a single day. The term "optimal" is defined as the largest surgically related utility value while achieving a given threshold defined by the performance variation of a reference solution. The optimization problem is analytically intractable because it involves quantities such as expectation and variance formulations. This implies that traditional mathematical programming techniques cannot be directly applied. We propose a decision support algorithm, which is a fully sequential procedure using variance screening in the first phase, and then employing multiple attribute utility theory to select the best solution in the second phase. The numerical experiments show that the proposed algorithm can find a promising solution in a reasonable amount of time.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call