IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v194y2012i1p365-38410.1007-s10479-010-0808-9.html
   My bibliography  Save this article

A comparison of two approaches to nurse rostering problems

Author

Listed:
  • Sanja Petrovic
  • Greet Berghe

Abstract

Despite decades of research into automated methods for nurse rostering and some academic successes, one may notice that there is no consistency in the knowledge that has been built up over the years and that many healthcare institutions still resort to manual practices. One of the possible reasons for this gap between the nurse rostering theory and practice is that often the academic community focuses on the development of new techniques rather than developing systems for healthcare institutions. In addition, methods suitable for one problem are usually not easily transferable to other problems. In real-world healthcare environments, a personnel manager cannot afford to model a problem and construct a roster using available approaches in order to quantitatively determine which one suits best. There is a lack of criteria for the comparison of approaches to provide a clear picture about their advantages and disadvantages and therefore their suitability to a problem in hand. This paper introduces seven criteria: expressive power, flexibility, algorithmic power, learning capabilities, maintenance, rescheduling capabilities, and parameter tuning, that may offer guidance to researchers and developers of systems for nurse rostering. Two approaches to nurse rostering, which are of very different nature, are evaluated and compared against the introduced criteria. One approach is based on meta-heuristics, while the other employs case-based reasoning. Copyright Springer Science+Business Media, LLC 2012

Suggested Citation

  • Sanja Petrovic & Greet Berghe, 2012. "A comparison of two approaches to nurse rostering problems," Annals of Operations Research, Springer, vol. 194(1), pages 365-384, April.
  • Handle: RePEc:spr:annopr:v:194:y:2012:i:1:p:365-384:10.1007/s10479-010-0808-9
    DOI: 10.1007/s10479-010-0808-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0808-9
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-010-0808-9?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. Mark Isken, 2004. "An Implicit Tour Scheduling Model with Applications in Healthcare," Annals of Operations Research, Springer, vol. 128(1), pages 91-109, April.
    2. Beddoe, Gareth R. & Petrovic, Sanja, 2006. "Selecting and weighting features using a genetic algorithm in a case-based reasoning approach to personnel rostering," European Journal of Operational Research, Elsevier, vol. 175(2), pages 649-671, December.
    3. B. Maenhout & M. Vanhoucke, 2005. "New Computational Results for the Nurse Scheduling Problem: A Scatter Search Algorithm," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 05/341, Ghent University, Faculty of Economics and Business Administration.
    4. Margarida Moz & Margarida Pato, 2004. "Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models," Annals of Operations Research, Springer, vol. 128(1), pages 179-197, April.
    5. Eliezer Kaplansky & Amnon Meisels, 2007. "Distributed personnel scheduling—negotiation among scheduling agents," Annals of Operations Research, Springer, vol. 155(1), pages 227-255, November.
    6. Deborah L. Kellogg & Steven Walczak, 2007. "Nurse Scheduling: From Academia to Implementation or Not?," Interfaces, INFORMS, vol. 37(4), pages 355-369, August.
    7. Uwe Aickelin & Paul White, 2004. "Building Better Nurse Scheduling Algorithms," Annals of Operations Research, Springer, vol. 128(1), pages 159-177, April.
    8. D. Parr & J. Thompson, 2007. "Solving the multi-objective nurse scheduling problem with a weighted cost function," Annals of Operations Research, Springer, vol. 155(1), pages 279-288, November.
    9. G Beddoe & S Petrovic, 2007. "Enhancing case-based reasoning for personnel rostering with selected tabu search concepts," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1586-1598, December.
    10. Hadi W. Purnomo & Jonathan F. Bard, 2007. "Cyclic preference scheduling for nurses using branch and price," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 200-220, March.
    11. B. Maenhout & M. Vanhoucke, 2005. "An Electromagnetic Meta-Heuristic for the Nurse Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 05/316, Ghent University, Faculty of Economics and Business Administration.
    12. Bellanti, F. & Carello, G. & Della Croce, F. & Tadei, R., 2004. "A greedy-based neighborhood search approach to a nurse rostering problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 28-40, February.
    13. Bard, Jonathan F. & Purnomo, Hadi W., 2005. "Preference scheduling for nurses using column generation," European Journal of Operational Research, Elsevier, vol. 164(2), pages 510-534, July.
    14. Marc Asunción & Luis Castillo & Juan Fernández-Olivares & Oscar García-Pérez & Antonio González & Francisco Palao, 2007. "Handling fuzzy temporal constraints in a planning environment," Annals of Operations Research, Springer, vol. 155(1), pages 391-415, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Paveena Chaovalitwongse & Krongsin Somprasonk & Naragain Phumchusri & Joseph Heim & Zelda B. Zabinsky & W. Art Chaovalitwongse, 2017. "A decision support model for staff allocation of mobile medical service," Annals of Operations Research, Springer, vol. 249(1), pages 433-448, February.
    2. Böðvarsdóttir, Elín Björk & Smet, Pieter & Vanden Berghe, Greet & Stidsen, Thomas J.R., 2021. "Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds," European Journal of Operational Research, Elsevier, vol. 292(3), pages 980-995.
    3. 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.
    4. Gülcin Ermis & Can Akkan, 2019. "Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure," Annals of Operations Research, Springer, vol. 275(1), pages 101-121, April.
    5. 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.
    6. Leung, Polly P.L. & Wu, C.H. & Kwong, C.K. & Ip, W.H. & Ching, W.K., 2021. "Digitalisation for optimising nursing staff demand modelling and scheduling in nursing homes," Technological Forecasting and Social Change, Elsevier, vol. 164(C).
    7. Sanja Petrovic, 2019. "“You have to get wet to learn how to swim” applied to bridging the gap between research into personnel scheduling and its implementation in practice," Annals of Operations Research, Springer, vol. 275(1), pages 161-179, April.
    8. Ademir Constantino & Dario Landa-Silva & Everton Melo & Candido Mendonça & Douglas Rizzato & Wesley Romão, 2014. "A heuristic algorithm based on multi-assignment procedures for nurse scheduling," Annals of Operations Research, Springer, vol. 218(1), pages 165-183, July.
    9. Christopher N. Gross & Andreas Fügener & Jens O. Brunner, 2018. "Online rescheduling of physicians in hospitals," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 296-328, June.

    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. 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.
    2. Vanhoucke, Mario & Maenhout, Broos, 2009. "On the characterization and generation of nurse scheduling problem instances," European Journal of Operational Research, Elsevier, vol. 196(2), pages 457-467, July.
    3. Deborah L. Kellogg & Steven Walczak, 2007. "Nurse Scheduling: From Academia to Implementation or Not?," Interfaces, INFORMS, vol. 37(4), pages 355-369, August.
    4. E K Burke & T Curtois & L F van Draat & J-K van Ommeren & G Post, 2011. "Progress control in iterated local search for nurse rostering," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 360-367, February.
    5. Edmund K. Burke & Timothy Curtois & Rong Qu & Greet Vanden Berghe, 2013. "A Time Predefined Variable Depth Search for Nurse Rostering," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 411-419, August.
    6. E K Burke & T Curtois & R Qu & G Vanden Berghe, 2010. "A scatter search methodology for the nurse rostering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1667-1679, November.
    7. De Bruecker, Philippe & Beliën, Jeroen & Van den Bergh, Jorne & Demeulemeester, Erik, 2018. "A three-stage mixed integer programming approach for optimizing the skill mix and training schedules for aircraft maintenance," European Journal of Operational Research, Elsevier, vol. 267(2), pages 439-452.
    8. Edmund Burke & Jingpeng Li & Rong Qu, 2012. "A Pareto-based search methodology for multi-objective nurse scheduling," Annals of Operations Research, Springer, vol. 196(1), pages 91-109, July.
    9. E. Veen & J. L. Hurink & J. M. J. Schutten & S. T. Uijland, 2016. "A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering," Annals of Operations Research, Springer, vol. 239(1), pages 189-206, April.
    10. Manion Anderson & Merve Bodur & Scott Rathwell & Vahid Sarhangian, 2023. "Optimization Helps Scheduling Nursing Staff at the Long-Term Care Homes of the City of Toronto," Interfaces, INFORMS, vol. 53(2), pages 133-154, March.
    11. Jingpeng Li & Uwe Aickelin & Edmund K. Burke, 2009. "A Component-Based Heuristic Search Method with Evolutionary Eliminations for Hospital Personnel Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 468-479, August.
    12. Burke, Edmund K. & Curtois, Timothy & Post, Gerhard & Qu, Rong & Veltman, Bart, 2008. "A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem," European Journal of Operational Research, Elsevier, vol. 188(2), pages 330-341, July.
    13. Burak Bilgin & Patrick Causmaecker & Benoît Rossie & Greet Vanden Berghe, 2012. "Local search neighbourhoods for dealing with a novel nurse rostering model," Annals of Operations Research, Springer, vol. 194(1), pages 33-57, April.
    14. Burke, Edmund K. & Curtois, Tim, 2014. "New approaches to nurse rostering benchmark instances," European Journal of Operational Research, Elsevier, vol. 237(1), pages 71-81.
    15. Hadi W. Purnomo & Jonathan F. Bard, 2007. "Cyclic preference scheduling for nurses using branch and price," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 200-220, March.
    16. 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.
    17. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    18. Amy Cohn & Sarah Root & Carisa Kymissis & Justin Esses & Niesha Westmoreland, 2009. "Scheduling Medical Residents at Boston University School of Medicine," Interfaces, INFORMS, vol. 39(3), pages 186-195, June.
    19. Pieter Smet & Burak Bilgin & Patrick De Causmaecker & Greet Vanden Berghe, 2014. "Modelling and evaluation issues in nurse rostering," Annals of Operations Research, Springer, vol. 218(1), pages 303-326, July.
    20. B Maenhout & M Vanhoucke, 2009. "The impact of incorporating nurse-specific characteristics in a cyclical scheduling approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1683-1698, December.

    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:194:y:2012:i:1:p:365-384:10.1007/s10479-010-0808-9. 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.