IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v325y2025i1p20-37.html
   My bibliography  Save this article

Patient-to-room assignment with single-rooms entitlements: Combinatorial insights and integer programming formulations

Author

Listed:
  • Brandt, Tabea
  • Büsing, Christina
  • Engelhardt, Felix

Abstract

Patient-to-room assignment (PRA) is a scheduling problem in decision support for hospitals. It consists of assigning patients to rooms during their stay at a hospital according to certain conditions and objectives, e.g., ensuring gender separated rooms, avoiding transfers and respecting single-room requests. This work presents combinatorial insights about the feasibility of PRA and about how (many) single-room requests can be respected. We further compare different integer programming (IP) formulations for PRA as well as the influence of different objectives on the runtime using real-world data. Based on these results, we develop a fast IP-based solution approach, which obtains high quality solutions. In contrast to previous IP-formulations, the results of our computational study indicate that large, real-world instances can be solved to a high degree of optimality within (fractions of) seconds. We support this result by a computational study using a large set of realistic but randomly generated instances with 50% to 95% capacity utilisation.

Suggested Citation

  • Brandt, Tabea & Büsing, Christina & Engelhardt, Felix, 2025. "Patient-to-room assignment with single-rooms entitlements: Combinatorial insights and integer programming formulations," European Journal of Operational Research, Elsevier, vol. 325(1), pages 20-37.
    • Handle: RePEc:eee:ejores:v:325:y:2025:i:1:p:20-37
    DOI: 10.1016/j.ejor.2025.02.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725001389
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.02.018?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 search for a different version of it.

    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:eee:ejores:v:325:y:2025:i:1:p:20-37. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.