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

Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services

Author

Listed:
  • Zihao Qu

    (The University of Texas at Dallas, Richardson, Texas 75080)

  • Milind Dawande

    (The University of Texas at Dallas, Richardson, Texas 75080)

  • Ganesh Janakiraman

    (The University of Texas at Dallas, Richardson, Texas 75080)

Abstract

Motivated by an application at a postacute healthcare provider, we study an infinite-horizon, stochastic optimization problem with a set of long-term capacity investment decisions and a sequence of real-time order acceptance/rejection decisions. The goal is to maximize the long-run average expected profit per period. The firm employs full-time resources of various kinds, such as nurses and therapists. For each kind of resource, multiple types are available. For example, registered nurses (RNs) are more expensive to employ than licensed practical nurses (LPNs); however, RNs can serve a greater range of patients than LPNs. Thus, the long-term capacity decision for this firm is the number of each type of resource to employ full time. A full-time resource may, at times, become unavailable (i.e., be absent); this absenteeism is stochastic. When the need for resources cannot be met from the pool of full-time employees, the firm has access to on-demand, part-time resources, who are paid a higher hourly rate than an equivalent full-time resource. On the demand side, the firm receives referrals —requests to commit service to patients over a time window (whose duration is stochastic), which is referred to as an episode —in real time. The referral arrival process is stochastic. A referral is characterized by the revenue it provides to the firm, the resources required to serve that patient, the frequency with which each of these resources is required, and the distribution of the episode duration. The decision to accept or reject a referral has to be instantaneous; if accepted, the service episode starts immediately. We develop a simple solution to the optimization problem, derive a worst-case guarantee on its optimality gap, and demonstrate that this gap vanishes in a meaningful asymptotic regime. We also illustrate the impressive performance of our solution numerically on a testbed of problem instances whose input parameters are drawn using publicly available healthcare data.

Suggested Citation

  • Zihao Qu & Milind Dawande & Ganesh Janakiraman, 2022. "Technical Note—A Near-Optimal Algorithm for Real-Time Order Acceptance: An Application in Postacute Healthcare Services," Operations Research, INFORMS, vol. 70(4), pages 2213-2225, July.
  • Handle: RePEc:inm:oropre:v:70:y:2022:i:4:p:2213-2225
    DOI: 10.1287/opre.2022.2278
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1287/opre.2022.2278?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:70:y:2022:i:4:p:2213-2225. 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.