An integrated operating room and physician scheduling problem solved by a hybrid variable neighborhood search-based algorithm

Yuli Wang, Wenjuan Fan (), Shaowen Lan, Shuwan Zhu and Jianmei Du
Additional contact information
Yuli Wang: Hefei University of Technology
Wenjuan Fan: Hefei University of Technology
Shaowen Lan: Fuzhou University
Shuwan Zhu: Hefei University of Technology
Jianmei Du: Hefei University of Technology

Journal of Combinatorial Optimization, 2025, vol. 50, issue 1, No 9, 35 pages

Abstract: Abstract This paper addresses an integrated operating room (OR) and physician scheduling problem driven by the real-world needs in the surgical department. The OR scheduling problem involves determining the number of ORs to be opened each day, the operation date of each surgery, and the schedule of surgeries in each OR. The physician scheduling problem considers two primary work for physicians: surgery service and consultation service, aiming to assign physicians to shifts and determine their responsibilities for either performing surgeries or providing consultation services in the outpatient department. The integration of these two scheduling problems improves coordination between OR availability and physician schedules, which can directly reduce operational costs and enhance resource utilization in the surgical department. The objective of the integrated problem is to minimize the total costs of the hospital and the patients, including the total waiting cost of patients, the total working cost of physicians, the total opening cost of ORs, and the total overtime cost of ORs. To solve the problem, a hybrid approach DP-H-VNS is proposed, which incorporates dynamic programming (DP), heuristics, and a variable neighborhood search (VNS) algorithm. The DP algorithm is used to assign surgeries to specific ORs, while the proposed heuristic rules are presented to determine the number of ORs to open each day and the scheduling of physicians. The presented VNS algorithm can search for high-quality solutions for the proposed problem and serves as a framework to integrate the DP, heuristics, local search, and shaking procedures. Experimental results demonstrate that the proposed DP-H-VNS is superior to the other compared algorithms on the quality of the found solutions and the performance. These results confirm the effectiveness of the proposed approach in optimizing the resource allocation in the surgical department and improving patient care.

Keywords: Physician scheduling; Operating room scheduling; Dynamic programming; Variable neighborhood search (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01335-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:50:y:2025:i:1:d:10.1007_s10878-025-01335-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01335-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().