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

Midterm scheduling of physicians with flexible shifts using branch and price

Author

Listed:
  • Jens Brunner
  • Jonathan Bard
  • Rainer Kolisch

Abstract

A methodology is presented to solve the flexible shift scheduling problem of physicians when hospital administrators can exploit flexible start times, variable shift lengths, and overtime to cover demand. The objective is to minimize the total assignment cost subject to individual contracts and prevailing labor regulations. A wide range of legal restrictions, facility-specific staffing policies, individual preferences, and on-call requirements throughout the week are considered. The resulting model constructs shifts implicitly rather than starting with a predefined set of several shift types. To find high-quality rosters, a Branch-and-Price (B&P) algorithm is developed that uses two different branching strategies and generates new rosters as needed. The first strategy centers on the master problem variables and the second is based on the subproblem variables. Using data provided by an anesthesia department of an 1100-bed hospital as well as an extensive set of randomly generated test instances for 15 and 18 physicians, computational results demonstrate the efficiency of the B&P algorithm for planning horizons of up to 6 weeks.

Suggested Citation

  • Jens Brunner & Jonathan Bard & Rainer Kolisch, 2011. "Midterm scheduling of physicians with flexible shifts using branch and price," IISE Transactions, Taylor & Francis Journals, vol. 43(2), pages 84-109.
    • Handle: RePEc:taf:uiiexx:v:43:y:2011:i:2:p:84-109
    DOI: 10.1080/0740817X.2010.504685
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/0740817X.2010.504685
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/0740817X.2010.504685?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jens Brunner & Günther Edenharter, 2011. "Long term staff scheduling of physicians with different experience levels in hospitals using column generation," Health Care Management Science, Springer, vol. 14(2), pages 189-202, June.
    2. Farzad Zaerpour & Marco Bijvank & Huiyin Ouyang & Zhankun Sun, 2022. "Scheduling of Physicians with Time‐Varying Productivity Levels in Emergency Departments," Production and Operations Management, Production and Operations Management Society, vol. 31(2), pages 645-667, February.
    3. Fırat, M. & Briskorn, D. & Laugier, A., 2016. "A Branch-and-Price algorithm for stable workforce assignments with hierarchical skills," European Journal of Operational Research, Elsevier, vol. 251(2), pages 676-685.
    4. Jan Schoenfelder & Christian Pfefferlen, 2018. "Decision Support for the Physician Scheduling Process at a German Hospital," Service Science, INFORMS, vol. 10(3), pages 215-229, September.
    5. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.
    6. De Bruecker, Philippe & Van den Bergh, Jorne & Beliën, Jeroen & Demeulemeester, Erik, 2015. "Workforce planning incorporating skills: State of the art," European Journal of Operational Research, Elsevier, vol. 243(1), pages 1-16.
    7. Rainer Kolisch & Christian Heimerl, 2012. "An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(2), pages 111-127, March.

    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:43:y:2011:i:2:p:84-109. 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.