Return
A new heuristic algorithm for resource-constrained operating room scheduling problem: A case study
DOI:10.1016/j.asej.2026.104108.png)
Abstract
En 中文
Operating rooms (ORs) are considered critical resources for hospitals. Indeed, they are among the most intensively used resources, limited in quantity, shared between surgical teams and their management is of a great importance. Recently, the challenges in optimizing OR scheduling have attracted considerable interest due to their impact on both patient satisfaction and cost-related factors. Various strategies for OR scheduling have emerged in literature, yet a focus on reducing operation overtime, specifically by reducing the overall time required for surgical procedures (known as makespan, Cmax), has not been adequately addressed. Therefore, this paper focuses primarily on better managing overtime in various surgical operations during a workday to guarantee surgeries start on time. In response to these challenges, we suggest a new optimization model, as well as a new heuristic algorithm to solve operating room scheduling problem as part of a case study carried out in the pediatric surgery department of a Tunisian hospital. Several experiments are performed to validate the solution approach using real data.
Keywords:
Operating room
Shared resources
Scheduling
Healthcare management
Heuristic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
3.4K
Citations:
1.2W

