Gerçek hayat operasyon odası çizelgelemesi problemi

A real life operating room scheduling problem is studied using a data set from a leading hospital, Hospital X, in Turkey. After analyzing the real data, we solve daily operating room scheduling problems by mixed integer linear programming models. Various objective functions and performance metrics are analyzed including minimizing the waiting time of patients while maximizing fairness between operating rooms. We examine operation delays and incorporate an important delay type, operation durations, by a heuristic method embedded in the mathematical models. In addition, a simple heuristic that does not utilize optimization is introduced. We conclude that our methods perform better than the Hospital X's current schedules, especially with respect to fairness of operating rooms' usage. However, we measure the performance of schedules (computed via mixed integer linear programming models) under randomly generated scenarios and such schedules perform worse than the schedules computed via the simple heuristic. Extensive computational results demonstrate that Hospital X can adapt any of the proposed schedules and realize progress in their schedules.