IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v71y2023i6p2111-2129.html
   My bibliography  Save this article

Data-Driven Hospital Admission Control: A Learning Approach

Author

Listed:
  • Mohammad Zhalechian

    (Operations and Decision Technologies, Kelley School of Business, Indiana University, Bloomington, Indiana 47405)

  • Esmaeil Keyvanshokooh

    (Information and Operations Management, Mays Business School, Texas A&M University, College Station, Texas 77845)

  • Cong Shi

    (Management Science, Herbert Business School, University of Miami, Coral Gables, Florida 33146)

  • Mark P. Van Oyen

    (Industrial and Operations Engineering, University of Michigan, Ann Arbor, Michigan 48105)

Abstract

The choice of care unit upon admission to the hospital is a challenging task because of the wide variety of patient characteristics, uncertain needs of patients, and limited number of beds in intensive and intermediate care units. The care unit placement decisions involve capturing the trade-off between the benefit of better health outcomes versus the opportunity cost of reserving higher level of care beds for potentially more complex patients arriving in the future. By focusing on reducing the readmission risk of patients, we develop an online algorithm for care unit placement under the presence of limited reusable hospital beds. The algorithm is designed to (i) adaptively learn the readmission risk of patients through batch learning with delayed feedback and (ii) choose the best care unit placement for a patient based on the observed information and the occupancy level of the care units. We prove that our online algorithm admits a Bayesian regret bound. We also investigate and assess the effectiveness of our methodology using hospital system data. Our numerical experiments demonstrate that our methodology outperforms different benchmark policies.

Suggested Citation

  • Mohammad Zhalechian & Esmaeil Keyvanshokooh & Cong Shi & Mark P. Van Oyen, 2023. "Data-Driven Hospital Admission Control: A Learning Approach," Operations Research, INFORMS, vol. 71(6), pages 2111-2129, November.
  • Handle: RePEc:inm:oropre:v:71:y:2023:i:6:p:2111-2129
    DOI: 10.1287/opre.2020.0481
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2020.0481
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2020.0481?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
    ---><---

    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:inm:oropre:v:71:y:2023:i:6:p:2111-2129. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.