IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v54y2022i6p521-536.html
   My bibliography  Save this article

Dynamic multi-type patient advance scheduling for a diagnostic facility considering heterogeneous waiting time targets and equity

Author

Listed:
  • Liping Zhou
  • Na Geng
  • Zhibin Jiang
  • Xiuxian Wang

Abstract

This article studies a dynamic advance scheduling problem where multi-type patients arrive randomly to book the future service of a diagnostic facility in a public healthcare setting. The demand for the diagnostic facility generally arises from multiple sources such as emergency patients, inpatients, and outpatients. It is challenging for public hospital managers to dynamically allocate their limited capacities to serve the incoming multi-type patients not only to achieve their heterogeneous waiting time targets in a cost-effective manner but also to maintain equity among multi-type patients. To address this problem, a finite-horizon Markov Decision Process (MDP) model is proposed to minimize the total expected costs under the constraints of maintaining equity. Because of the complex structure of the feasible region and the high-dimensional state space, the property characterization of optimal scheduling policy and the exact solution of the MDP are intractable. To solve the MDP model with high-dimensional state and action spaces, we reformulate the MDP as a multi-stage stochastic programming model and propose a modified Benders decomposition algorithm based on new dual integer cuts to solve the model. Based on real data from our collaborating hospital, we perform extensive numerical experiments to demonstrate that our proposed approach yields good performance.

Suggested Citation

  • Liping Zhou & Na Geng & Zhibin Jiang & Xiuxian Wang, 2022. "Dynamic multi-type patient advance scheduling for a diagnostic facility considering heterogeneous waiting time targets and equity," IISE Transactions, Taylor & Francis Journals, vol. 54(6), pages 521-536, June.
  • Handle: RePEc:taf:uiiexx:v:54:y:2022:i:6:p:521-536
    DOI: 10.1080/24725854.2021.1957521
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2021.1957521
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2021.1957521?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.

    More about this item

    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:taf:uiiexx:v:54:y:2022:i:6:p:521-536. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.