Group Arrivals of Emergency Patients: A Resilient Approach to Operating Room Scheduling

Addressing the challenge of operating-room management under unpredictable group arrivals of emergency patients, we propose a resilient, block-based scheduling strategy that balances elective throughput with rapid emergency response. The day is partitioned into contiguous time blocks; an initial elective surgery schedule is generated for the full horizon and then dynamically updated at the start of each block as emergency arrivals materialize. Our policy preferentially assigns shorter elective procedures to blocks with a higher estimated probability of emergency arrivals, thereby reducing elective disruption, increasing the likelihood of on-time completion for scheduled cases, and expediting care for emergency patients. To support this operational design, we formulated an initial mixed-integer programming model for baseline planning, and two rescheduling models that are triggered when emergencies occur. For computational tractability on realistic instance sizes, we solved these models using the Invasive Weed Optimization (IWO) metaheuristic. Computational experiments on large, randomly generated benchmarks indicate that IWO consistently produces high-quality solutions within modest computation times, preserving elective performance while significantly improving system resilience to grouped emergency arrivals. The proposed framework is readily adaptable to hospital preferences and uncertainty estimates, making it suitable for practical deployment.

کلیدواژه ها:

Operating room scheduling ، Group Arrivals of Emergency Patients ، Scheduling and Rescheduling