IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v302y2021i2d10.1007_s10479-019-03288-x.html
   My bibliography  Save this article

Modelling history in nurse rostering

Author

Listed:
  • Jeffrey H. Kingston

    (The University of Sydney)

Abstract

Standard data formats for problems and solutions are significant enablers of progress in fields that deal with complex real-world data. This paper makes a contribution to standardizing the nurse rostering problem in the area of history: how solutions to previous instances influence the current instance. Several issues are addressed, including avoiding double counting of penalties, constraining consecutive busy times, and completeness. The work is implemented within the XESTT model of nurse rostering.

Suggested Citation

  • Jeffrey H. Kingston, 2021. "Modelling history in nurse rostering," Annals of Operations Research, Springer, vol. 302(2), pages 391-404, July.
    • Handle: RePEc:spr:annopr:v:302:y:2021:i:2:d:10.1007_s10479-019-03288-x
    DOI: 10.1007/s10479-019-03288-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03288-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-019-03288-x?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.

    References listed on IDEAS

    as
    1. Haroldo G. Santos & Túlio A. M. Toffolo & Rafael A. M. Gomes & Sabir Ribas, 2016. "Integer programming techniques for the nurse rostering problem," Annals of Operations Research, Springer, vol. 239(1), pages 225-251, April.
    2. Stefaan Haspeslagh & Patrick De Causmaecker & Andrea Schaerf & Martin Stølevik, 2014. "The first international nurse rostering competition 2010," Annals of Operations Research, Springer, vol. 218(1), pages 221-236, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sara Ceschia & Rosita Guido & Andrea Schaerf, 2020. "Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods," Annals of Operations Research, Springer, vol. 288(1), pages 95-113, May.
    2. Sara Ceschia & Nguyen Dang & Patrick Causmaecker & Stefaan Haspeslagh & Andrea Schaerf, 2019. "The Second International Nurse Rostering Competition," Annals of Operations Research, Springer, vol. 274(1), pages 171-186, March.
    3. Elín Björk Böðvarsdóttir & Niels-Christian Fink Bagger & Laura Elise Høffner & Thomas J. R. Stidsen, 2022. "A flexible mixed integer programming-based system for real-world nurse rostering," Journal of Scheduling, Springer, vol. 25(1), pages 59-88, February.
    4. Toni I. Wickert & Alberto F. Kummer Neto & Márcio M. Boniatti & Luciana S. Buriol, 2021. "An integer programming approach for the physician rostering problem," Annals of Operations Research, Springer, vol. 302(2), pages 363-390, July.
    5. Florian Mischek & Nysret Musliu, 2019. "Integer programming model extensions for a multi-stage nurse rostering problem," Annals of Operations Research, Springer, vol. 275(1), pages 123-143, April.
    6. Gréanne Leeftink & Erwin W. Hans, 2018. "Case mix classification and a benchmark set for surgery scheduling," Journal of Scheduling, Springer, vol. 21(1), pages 17-33, February.
    7. Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa, 2017. "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 489-502, August.
    8. Frederik Knust & Lin Xie, 2019. "Simulated annealing approach to nurse rostering benchmark and real-world instances," Annals of Operations Research, Springer, vol. 272(1), pages 187-216, January.
    9. George H. G. Fonseca & Túlio A. M. Toffolo, 2022. "A fix-and-optimize heuristic for the ITC2021 sports timetabling problem," Journal of Scheduling, Springer, vol. 25(3), pages 273-286, June.
    10. Kjartan Kastet Klyve & Ilankaikone Senthooran & Mark Wallace, 2023. "Nurse rostering with fatigue modelling," Health Care Management Science, Springer, vol. 26(1), pages 21-45, March.
    11. Mohammad Reza Hassani & J. Behnamian, 2021. "A scenario-based robust optimization with a pessimistic approach for nurse rostering problem," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 143-169, January.
    12. Fügener, Andreas & Pahr, Alexander & Brunner, Jens O., 2018. "Mid-term nurse rostering considering cross-training effects," International Journal of Production Economics, Elsevier, vol. 196(C), pages 176-187.
    13. Emir Demirović & Nysret Musliu & Felix Winter, 2019. "Modeling and solving staff scheduling with partial weighted maxSAT," Annals of Operations Research, Springer, vol. 275(1), pages 79-99, April.
    14. Wolbeck, Lena Antonia, 2019. "Fairness aspects in personnel scheduling," Discussion Papers 2019/16, Free University Berlin, School of Business & Economics.
    15. Suk Ho Jin & Ho Yeong Yun & Suk Jae Jeong & Kyung Sup Kim, 2017. "Hybrid and Cooperative Strategies Using Harmony Search and Artificial Immune Systems for Solving the Nurse Rostering Problem," Sustainability, MDPI, vol. 9(7), pages 1-19, June.
    16. Zachary Steever & Chase Murray & Junsong Yuan & Mark Karwan & Marco Lübbecke, 2022. "An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1849-1870, July.
    17. Ceschia, Sara & Di Gaspero, Luca & Schaerf, Andrea, 2023. "Educational timetabling: Problems, benchmarks, and state-of-the-art results," European Journal of Operational Research, Elsevier, vol. 308(1), pages 1-18.
    18. Reshma Chirayil Chandrasekharan & Pieter Smet & Tony Wauters, 2021. "An automatic constructive matheuristic for the shift minimization personnel task scheduling problem," Journal of Heuristics, Springer, vol. 27(1), pages 205-227, April.
    19. Rahimian, Erfan & Akartunalı, Kerem & Levine, John, 2017. "A hybrid Integer Programming and Variable Neighbourhood Search algorithm to solve Nurse Rostering Problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 411-423.
    20. Lai, David S.W. & Leung, Janny M.Y. & Dullaert, Wout & Marques, Inês, 2020. "A graph-based formulation for the shift rostering problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 285-300.

    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:annopr:v:302:y:2021:i:2:d:10.1007_s10479-019-03288-x. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.