IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v50y2025i1d10.1007_s10878-025-01335-x.html
   My bibliography  Save this article

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

Author

Listed:
  • Yuli Wang

    (Hefei University of Technology)

  • Wenjuan Fan

    (Hefei University of Technology
    Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education)

  • Shaowen Lan

    (Fuzhou University)

  • Shuwan Zhu

    (Hefei University of Technology
    Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education)

  • Jianmei Du

    (Hefei University of Technology
    Key Laboratory of Process Optimization and Intelligent Decision-making of Ministry of Education)

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.

Suggested Citation

  • Yuli Wang & Wenjuan Fan & Shaowen Lan & Shuwan Zhu & Jianmei Du, 2025. "An integrated operating room and physician scheduling problem solved by a hybrid variable neighborhood search-based algorithm," Journal of Combinatorial Optimization, Springer, vol. 50(1), pages 1-35, August.
  • Handle: RePEc:spr:jcomop:v:50:y:2025:i:1:d:10.1007_s10878-025-01335-x
    DOI: 10.1007/s10878-025-01335-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01335-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-025-01335-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:50:y:2025:i:1:d:10.1007_s10878-025-01335-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.