IDEAS home Printed from https://ideas.repec.org/a/taf/thssxx/v10y2021i2p118-130.html
   My bibliography  Save this article

Minimax cth percentile of makespan in surgical scheduling

Author

Listed:
  • Vikas Agrawal
  • Aber Elsaleiby
  • Yue Zhang
  • P. S. Sundararaghavan
  • Andrew Casabianca

Abstract

In this paper, we address the problem of finding an assignment of n surgeries to be performed in one of m parallel identical operating rooms (ORs), given each surgery has a stochastic duration with a known mean and standard deviation. The objective is to minimise the maximum of the cth percentile of makespan of any OR. We formulate this problem as a nonlinear integer program, and small-sized instances are solved using the GAMS BONMIN solver. We develop a greedy heuristic and a genetic algorithm procedure for solving large-sized instances. Using real data from a major U.S. teaching hospital and benchmarking datasets from the literature, we report on the performance of the heuristics as compared to the GAMS BONMIN solver.

Suggested Citation

  • Vikas Agrawal & Aber Elsaleiby & Yue Zhang & P. S. Sundararaghavan & Andrew Casabianca, 2021. "Minimax cth percentile of makespan in surgical scheduling," Health Systems, Taylor & Francis Journals, vol. 10(2), pages 118-130, April.
    • Handle: RePEc:taf:thssxx:v:10:y:2021:i:2:p:118-130
    DOI: 10.1080/20476965.2019.1700763
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/20476965.2019.1700763
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/20476965.2019.1700763?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:thssxx:v:10:y:2021:i:2:p:118-130. 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/thss .

    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.