IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v37y2007i4p355-369.html
   My bibliography  Save this article

Nurse Scheduling: From Academia to Implementation or Not?

Author

Listed:
  • Deborah L. Kellogg

    (School of Business, University of Colorado at Denver and Health Science Center, PO Box 173364, Campus Box 165, Denver, Colorado 80217-3364)

  • Steven Walczak

    (School of Business, University of Colorado at Denver and Health Science Center, PO Box 173364, Campus Box 165, Denver, Colorado 80217-3364)

Abstract

The scheduling of nursing staff is a long-standing problem with myriads of research models published by academia. The exploratory research that we discuss examines the models that academia has produced and the models that hospitals have actually used. We use data from many sources, including research articles, e-mail and telephone surveys, an industry database, and a software source catalog. Only 30 percent of systems that research articles discuss are implemented, and there is very little academic involvement in systems that third-party vendors offer. We examine causes for the research-application gap and discuss directions for future academic research to make it more applicable.

Suggested Citation

  • Deborah L. Kellogg & Steven Walczak, 2007. "Nurse Scheduling: From Academia to Implementation or Not?," Interfaces, INFORMS, vol. 37(4), pages 355-369, August.
    • Handle: RePEc:inm:orinte:v:37:y:2007:i:4:p:355-369
    DOI: 10.1287/inte.1070.0291
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1070.0291
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1070.0291?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
    ---><---

    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. Nonobe, Koji & Ibaraki, Toshihide, 1998. "A tabu search approach to the constraint satisfaction problem as a general problem solver," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 599-623, April.
    3. Venkataraman, R. & Brusco, M. J., 1996. "An integrated analysis of nurse staffing and scheduling policies," Omega, Elsevier, vol. 24(1), pages 57-71, February.
    4. Uwe Aickelin & Paul White, 2004. "Building Better Nurse Scheduling Algorithms," Annals of Operations Research, Springer, vol. 128(1), pages 159-177, April.
    5. Dowsland, Kathryn A., 1998. "Nurse scheduling with tabu search and strategic oscillation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 393-407, April.
    6. Margarida Moz & Margarida Pato, 2003. "An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules," Annals of Operations Research, Springer, vol. 119(1), pages 285-301, March.
    7. Berrada, Ilham & Ferland, Jacques A. & Michelon, Philippe, 1996. "A multi-objective approach to nurse scheduling with both hard and soft constraints," Socio-Economic Planning Sciences, Elsevier, vol. 30(3), pages 183-193, September.
    8. Ozkarahan, Irem, 1991. "A disaggregation model of a flexible nurse scheduling support system," Socio-Economic Planning Sciences, Elsevier, vol. 25(1), pages 9-26.
    9. Rosenbloom, E. S. & Goertzen, N. F., 1987. "Cyclic nurse scheduling," European Journal of Operational Research, Elsevier, vol. 31(1), pages 19-23, July.
    10. Franz, Lori S. & Baker, Hope M. & Leong, G. Keong & Rakes, Terry R., 1989. "A mathematical model for scheduling and staffing multiclinic health regions," European Journal of Operational Research, Elsevier, vol. 41(3), pages 277-289, August.
    11. 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.
    12. 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.
    13. Cheang, B. & Li, H. & Lim, A. & Rodrigues, B., 2003. "Nurse rostering problems--a bibliographic survey," European Journal of Operational Research, Elsevier, vol. 151(3), pages 447-460, December.
    14. D. Michael Warner, 1976. "Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach," Operations Research, INFORMS, vol. 24(5), pages 842-856, October.
    15. Millar, Harvey H. & Kiragu, Mona, 1998. "Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming," European Journal of Operational Research, Elsevier, vol. 104(3), pages 582-592, February.
    16. 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.
    17. Siferd, Sue Perrott & Benton, W. C., 1992. "Workforce staffing and scheduling: Hospital nursing specific models," European Journal of Operational Research, Elsevier, vol. 60(3), pages 233-246, August.
    18. Bard, Jonathan F. & Purnomo, Hadi W., 2005. "A column generation-based approach to solve the preference scheduling problem for nurses with downgrading," Socio-Economic Planning Sciences, Elsevier, vol. 39(3), pages 193-213, September.
    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. 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.
    2. 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.
    3. 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.
    4. David Scheinker & Margaret L. Brandeau, 2020. "Implementing Analytics Projects in a Hospital: Successes, Failures, and Opportunities," Interfaces, INFORMS, vol. 50(3), pages 176-189, May.
    5. 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.
    6. 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.
    7. 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.
    8. Tristan Becker & Pia Mareike Steenweg & Brigitte Werners, 2019. "Cyclic shift scheduling with on-call duties for emergency medical services," Health Care Management Science, Springer, vol. 22(4), pages 676-690, December.
    9. 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.
    10. Eyjólfur Ingi Ásgeirsson & Guðríður Lilla Sigurðardóttir, 2016. "Near-optimal MIP solutions for preference based self-scheduling," Annals of Operations Research, Springer, vol. 239(1), pages 273-293, April.
    11. Kayse Lee Maass & Boying Liu & Mark S. Daskin & Mary Duck & Zhehui Wang & Rama Mwenesi & Hannah Schapiro, 2017. "Incorporating nurse absenteeism into staffing with demand uncertainty," Health Care Management Science, Springer, vol. 20(1), pages 141-155, March.
    12. 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.
    13. Patrick De Causmaecker & Greet Vanden Berghe, 2012. "Towards a reference model for timetabling and rostering," Annals of Operations Research, Springer, vol. 194(1), pages 167-176, April.
    14. 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.
    15. 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.
    16. Mark W. Isken & Osman T. Aydas, 2022. "A tactical multi-week implicit tour scheduling model with applications in healthcare," Health Care Management Science, Springer, vol. 25(4), pages 551-573, December.
    17. Castaño, Fabián & Velasco, Nubia, 2020. "Exact and heuristic approaches for the automated design of medical trainees rotation schedules," Omega, Elsevier, vol. 97(C).
    18. Melanie De Grano & D. Medeiros & David Eitel, 2009. "Accommodating individual preferences in nurse scheduling via auctions and optimization," Health Care Management Science, Springer, vol. 12(3), pages 228-242, September.

    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. 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.
    2. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    3. 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.
    4. 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.
    5. 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.
    6. Cheang, B. & Li, H. & Lim, A. & Rodrigues, B., 2003. "Nurse rostering problems--a bibliographic survey," European Journal of Operational Research, Elsevier, vol. 151(3), pages 447-460, December.
    7. 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.
    8. Wright, P. Daniel & Mahar, Stephen, 2013. "Centralized nurse scheduling to simultaneously improve schedule cost and nurse satisfaction," Omega, Elsevier, vol. 41(6), pages 1042-1052.
    9. Belií«n, Jeroen & Demeulemeester, Erik, 2008. "A branch-and-price approach for integrating nurse and surgery scheduling," European Journal of Operational Research, Elsevier, vol. 189(3), pages 652-668, September.
    10. 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.
    11. 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.
    12. 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.
    13. Jonas Baeklund, 2014. "Nurse rostering at a Danish ward," Annals of Operations Research, Springer, vol. 222(1), pages 107-123, November.
    14. Wolbeck, Lena Antonia, 2019. "Fairness aspects in personnel scheduling," Discussion Papers 2019/16, Free University Berlin, School of Business & Economics.
    15. Chern, Ching-Chin & Chien, Pei-Szu & Chen, Shu-Yi, 2008. "A heuristic algorithm for the hospital health examination scheduling problem," European Journal of Operational Research, Elsevier, vol. 186(3), pages 1137-1157, May.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Uwe Aickelin & Jingpeng Li, 2007. "An estimation of distribution algorithm for nurse scheduling," Annals of Operations Research, Springer, vol. 155(1), pages 289-309, November.

    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:inm:orinte:v:37:y:2007:i:4:p:355-369. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.