Master surgical scheduling problem with multiple criteria and robust estimation

In this research, the Master Surgical Scheduling (MSS) problem at the tactical level of hospital planning and scheduling is studied. Before constructing the MSS, a strategic level problem, i.e., Case Mix Planning Problem (CMPP), shall be solved to allocate the capacity of Operating Room (OR) to each surgical specialty. In order to make an eective coordination between CMPP and MSS, the results obtained from solving the CMPP are used as an input for the respective MSS. In the MSS, frequently performed elective surgeries are planned in a cyclic manner for a pre-dened planning period. As a part of the planning process, it is required to adjust downstream limited resources, such as Intensive Care Unit (ICU) and ward beds, with patient ow. In this study, a mathematical model is developed to construct an MSS. The proposed model is based on a lexicographic goal programming approach, which is aimed at minimizing the o‎r spare time while considering the results of the CMPP. In this paper, the data required to solve MSS are collected from a medium-sized Iranian hospital. Hence, a robust estimation method is applied to reduce the effect of outliers on the decision-making process. The results show the performance of the proposed method against the solution put in practice in the hospital.