IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v61y2010i11d10.1057_jors.2009.118.html
   My bibliography  Save this article

A scatter search methodology for the nurse rostering problem

Author

Listed:
  • E K Burke

    (University of Nottingham)

  • T Curtois

    (University of Nottingham)

  • R Qu

    (University of Nottingham)

  • G Vanden Berghe

    (KaHo St.-Lieven
    K.U.Leuven)

Abstract

The benefits of automating the nurse scheduling process in hospitals include reducing the planning workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and to attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce will lead to higher productivity, increased quality of patient service and a better level of healthcare. This paper presents a scatter search approach for the problem of automatically creating nurse rosters. Scatter search is an evolutionary algorithm, which has been successfully applied across a number of problem domains. To adapt and apply scatter search to nurse rostering, it was necessary to develop novel implementations of some of scatter search's subroutines. The algorithm was then tested on publicly available real-world benchmark instances and compared against previously published approaches. The results show the proposed algorithm is a robust and effective method on a wide variety of real-world instances.

Suggested Citation

  • 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.
  • Handle: RePEc:pal:jorsoc:v:61:y:2010:i:11:d:10.1057_jors.2009.118
    DOI: 10.1057/jors.2009.118
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2009.118
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1057/jors.2009.118?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. 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.
    2. U Aickelin & E K Burke & J Li, 2007. "An estimation of distribution algorithm with intelligent local search for rule-based nurse rostering," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1574-1585, December.
    3. 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.
    4. Jaumard, Brigitte & Semet, Frederic & Vovor, Tsevi, 1998. "A generalized linear programming model for nurse scheduling," European Journal of Operational Research, Elsevier, vol. 107(1), pages 1-18, May.
    5. 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.
    6. 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.
    7. 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.
    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. 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.
    2. Valouxis, Christos & Gogos, Christos & Goulas, George & Alefragis, Panayiotis & Housos, Efthymios, 2012. "A systematic two phase approach for the nurse rostering problem," European Journal of Operational Research, Elsevier, vol. 219(2), pages 425-433.
    3. Lin, Shih-Wei & Ying, Kuo-Ching, 2014. "Minimizing shifts for personnel task scheduling problems: A three-phase algorithm," European Journal of Operational Research, Elsevier, vol. 237(1), pages 323-334.
    4. Federico Della Croce & Fabio Salassa, 2014. "A variable neighborhood search based matheuristic for nurse rostering problems," Annals of Operations Research, Springer, vol. 218(1), pages 185-199, July.
    5. 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.
    6. Turhan, Aykut Melih & Bilgen, Bilge, 2022. "A mat-heuristic based solution approach for an extended nurse rostering problem with skills and units," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    7. Rajeswari Muniyan & Rajakumar Ramalingam & Sultan S. Alshamrani & Durgaprasad Gangodkar & Ankur Dumka & Rajesh Singh & Anita Gehlot & Mamoon Rashid, 2022. "Artificial Bee Colony Algorithm with Nelder–Mead Method to Solve Nurse Scheduling Problem," Mathematics, MDPI, vol. 10(15), pages 1-24, July.
    8. Chiaramonte Michael & Cochran Jeffery & Caswell David, 2015. "Nurse preference rostering using agents and iterated local search," Annals of Operations Research, Springer, vol. 226(1), pages 443-461, March.
    9. 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.
    10. 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.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Ran Liu & Xiaolan Xie, 2018. "Physician Staffing for Emergency Departments with Time-Varying Demand," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 588-607, August.
    9. Topaloglu, Seyda, 2009. "A shift scheduling model for employees with different seniority levels and an application in healthcare," European Journal of Operational Research, Elsevier, vol. 198(3), pages 943-957, November.
    10. Lü, Zhipeng & Hao, Jin-Kao, 2012. "Adaptive neighborhood search for nurse rostering," European Journal of Operational Research, Elsevier, vol. 218(3), pages 865-876.
    11. 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.
    12. Lin, Shih-Wei & Ying, Kuo-Ching, 2014. "Minimizing shifts for personnel task scheduling problems: A three-phase algorithm," European Journal of Operational Research, Elsevier, vol. 237(1), pages 323-334.
    13. Durai Sundaramoorthi & Victoria Chen & Jay Rosenberger & Seoung Kim & Deborah Buckley-Behan, 2009. "A data-integrated simulation model to evaluate nurse–patient assignments," Health Care Management Science, Springer, vol. 12(3), pages 252-268, September.
    14. Elina Rönnberg & Torbjörn Larsson, 2010. "Automating the self-scheduling process of nurses in Swedish healthcare: a pilot study," Health Care Management Science, Springer, vol. 13(1), pages 35-53, March.
    15. Duraikannan Sundaramoorthi & Victoria Chen & Jay Rosenberger & Seoung Kim & Deborah Buckley-Behan, 2010. "A data-integrated simulation-based optimization for assigning nurses to patient admissions," Health Care Management Science, Springer, vol. 13(3), pages 210-221, September.
    16. Jonas Baeklund, 2014. "Nurse rostering at a Danish ward," Annals of Operations Research, Springer, vol. 222(1), pages 107-123, November.
    17. Broos Maenhout & Mario Vanhoucke, 2013. "Analyzing the nursing organizational structure and process from a scheduling perspective," Health Care Management Science, Springer, vol. 16(3), pages 177-196, September.
    18. 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.
    19. Burke, Edmund K. & Li, Jingpeng & Qu, Rong, 2010. "A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems," European Journal of Operational Research, Elsevier, vol. 203(2), pages 484-493, June.
    20. 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.

    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:pal:jorsoc:v:61:y:2010:i:11:d:10.1057_jors.2009.118. 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.palgrave-journals.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.