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

Decomposition-based heuristics for the integrated physician rostering and surgery scheduling problem

Author

Listed:
  • Christophe Van Huele
  • Mario Vanhoucke

Abstract

In this paper, a comparison and validation of various priority rules for the Integrated Physician Rostering and Surgery Scheduling Problem (IPSSP) under different objective functions is made. We integrate three constructive heuristic types with two corresponding priority rule classes in order to obtain a solution for the combined physician rostering and surgery scheduling problem. Twelve priority rules for the surgery assignments and six priority rules for the physician rostering are used to schedule the surgeries in the operating theatre on a weekly basis, while generating adequate rosters for the physicians that maximizes their preferences. Our goal is to provide a suitable heuristic for every problem type, problem size and problem structure for the hospital manager to use in every possible condition. The problem type represents the most occurring objectives and goals according to literature. The problem size depicts the size of the hospital and its corresponding utilization. The problem structure defines the different demands of the physician roster and the surgery schedule. It can be shown that for every situation a fitting heuristic can be provided. These high-quality decomposition-based constructive heuristics can also be used in meta-heuristics to generate good solutions. Most importantly, we have established general recommendations with respect to the use of the different proposed heuristics in different hospital settings.

Suggested Citation

  • Christophe Van Huele & Mario Vanhoucke, 2015. "Decomposition-based heuristics for the integrated physician rostering and surgery scheduling problem," Health Systems, Taylor & Francis Journals, vol. 4(3), pages 159-175, November.
  • Handle: RePEc:taf:thssxx:v:4:y:2015:i:3:p:159-175
    DOI: 10.1057/hs.2014.27
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/hs.2014.27
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/hs.2014.27?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:4:y:2015:i:3:p:159-175. 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.