IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_55.html
   My bibliography  Save this book chapter

Real-World Staff Rostering via Branch-and-Price in a Declarative Framework

In: Operations Research Proceedings 2018

Author

Listed:
  • Marco Bender

    (Workforce Management Division)

  • Sebastian Berckey

    (Workforce Management Division)

  • Michael Elberfeld

    (Workforce Management Division)

  • Jörg Herbers

    (Workforce Management Division)

Abstract

An important problem in staff scheduling is roster generation. The task is to find an assignment of shifts to employees, such that qualification restrictions and demands are met as well as possible. This assignment problem is in particular challenging due to business rules concerning working time, day on/off patterns, rest times, or employee preferences. The present paper outlines INFORM’s staff rostering optimizer that is used to solve large-scale real-world rostering instances, and evaluates the performance of the optimizer on nurse rostering data. Moreover, we describe how we integrate the optimizer into our system and adapt it to the needs of our customers using a declarative programming framework.

Suggested Citation

  • Marco Bender & Sebastian Berckey & Michael Elberfeld & Jörg Herbers, 2019. "Real-World Staff Rostering via Branch-and-Price in a Declarative Framework," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 445-451, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_55
    DOI: 10.1007/978-3-030-18500-8_55
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-030-18500-8_55. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.