Skip to main content
Springer Nature Link
Log in

A subproblem-centric model and approach to the nurse scheduling problem

  • Published:
Mathematical Programming Submit manuscript

Abstract.

The number of hospitals in Japan exceeds 10,000, and every month nurses are scheduled to shifts in about 30,000 units in total. There is serious demand for automating this scheduling task. In this paper, we introduce a mathematical programming formulation of the nurse scheduling problem in Japan, and develop a meta-heuristic approach to solve the problem. This scheduling problem is a hard combinatorial problem due to tight constraints involving such factors as the skill level of a team, the need to balance workload among nurses, and the consideration of nurses' preferences, even though the number of the nurses to be scheduled is not large, at between 20 and 40. The performance of our approach is demonstrated by the successful solution of data taken from actual scheduling problems. The proposed model and approach can be adapted for the majority of hospitals in Japan, as well as for some hospitals in other countries, and is likely applicable to many other scheduling problems in the fields of business and logistics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aickelin, U., Dowsland, K.A.: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling 3, 139–153 (2000)

    Google Scholar 

  2. Arther, J.L., Ravindran, A.: A multiple objective nurse scheduling model. AIIE transactions 13, 55–60 (1981)

    Google Scholar 

  3. Bell, P.C., Hay, G., Liang, Y.: A visual interactive decision support system for workforce (nurse) scheduling. INFOR 24, 134–145 (1986)

    Google Scholar 

  4. Chan, L.K., Falkenberg, J., Rosenbloom, E.S.: Implementation problems of a nurse preference mathematical programming approach to scheduling. Congressus Numerantium 56, 251–260 (1987)

    Google Scholar 

  5. Chvatal, V.: Linear programming. W.H. Freeman and Company. New York, 1983

  6. Dowsland, K.A.: Nurse scheduling with tabu search and strategic oscillation. Euro. J. Oper. Res. 106, 393–407 (1998)

    Google Scholar 

  7. Dowsland, K.A., Thompson, J.M.: Solving a nurse scheduling with tabu search and strategic oscillation. J. Oper. Res. Society 51, 825–833 (2000)

    Google Scholar 

  8. Ikegami, A., Aizawa, M., Ohkura, M., Wakasa, K., Matsudaira, N., Kosugo, R.: A preliminary study on the development of a scheduling system for hospital nurses. The Journal of Science of Labour 71, 413–412 (1995), (in Japanese)

    Google Scholar 

  9. Ikegami, A., Niwa, A., Ohkura, M.: Nurse scheduling in Japan. Commun. Oper. Res. Society of Japan 41, 436–442 (1996) (in Japanese)

    Google Scholar 

  10. Ikegami, A., Niwa, A.: An efficient approach to nurse scheduling – Implementation for a 2-shift case. J. Oper. Res. Society of Japan 41, 572–586 (1998) (in Japanese)

    Google Scholar 

  11. Ikegami, A.: Improvement on the 2-shift nurse scheduling algorithm. J. Oper. Res. Society of Japan 43, 365–381 (2000) (in Japanese)

  12. Ikegami, A.: Nurse scheduling in Japan -Modeling and solution-. Doctoral Dissertation, Seikei University, Tokyo (in Japanese), 2001

  13. Jaumard, B., Semet, F., Vovor, T.: A generalized linear programming model for nurse scheduling. Europ. J. Oper. Res. 107, 1–18 (1998)

    Google Scholar 

  14. Kostreva, M.M., Jennings, K.S.B.: Nurse scheduling on microcomputer. Comp. Oper. Res. 18, 731–739 (1991)

    Google Scholar 

  15. Li, L.X., Benton, W.C.: Performance measurement criteria in health care organization: Review and future research directions. Europ. J. Oper. Res. 93, 449–468 (1996)

    Google Scholar 

  16. Megeath J.D.: Successful hospital personnel scheduling. Interfaces 8, 55–59 (1978)

    Google Scholar 

  17. Meyer auf'm Hofe, H.: Nurse rostering as constraint satisfaction with Fuzzy constraints and inferred control strategies. DIMACS Series in Discrete Mathematics and Theoritical Computer Science 57, 67–99 (2001)

  18. Millar, H.H., Kiragu, M.: Cyclic and non-cyclic scheduling of 12 h shift nurses by network programming. Europ. J. Oper. Res. 104, 582–592 (1998)

    Google Scholar 

  19. Miller, H.E., Pierskalla, W.P., Rath, G.J.: Nurse scheduling using mathematical programming. Operations Research 24, 857–870 (1976)

    Google Scholar 

  20. Musa, A.A., Saxena, U.: Scheduling nurses using goal-programming techniques. IIE transactions 16, 216–221 (1984)

    Google Scholar 

  21. Nagano, H., Niyazaki, S.: Approach to nurse scheduling problem with individual difference of preference in work hours. Journal of Japan Industrial Management Association 47, 143–149 (1996) (in Japanese)

    Google Scholar 

  22. Nonobe, K., Ibaraki, T.: A tabu search approach to the constraint satisfaction problem as a general problem solver. Europ. J. Oper. Res. 106, 599–623 (1998)

    Google Scholar 

  23. Osogami, T., Imai, H.: Classification of various neighborhood operations for the nurse scheduling problem. Lecture Notes in Computer Science 1969, 72–83 (2000)

  24. Ozkarahan, I., Bailey, J.E.: Goal programming model subsystem of a flexible nurse scheduling support system. IIE Transactions 20, 306–316 (1988)

    Google Scholar 

  25. Randhawa, S.U., Sitompul, D.: A heuristic-based computerized nurse scheduling system. Computer & Operations Research 20, 837–844 (1993) Dental practice management: the economics of staffing and scheduling. European Journal of Operational Research 31, 19–23

    Google Scholar 

  26. Rosenbloom, E.S., Goertzen, N.F.: Cyclic nurse scheduling. Europ. J. Oper. Res. 31, 19–23 (1987)

    Google Scholar 

  27. Siferd, S.P., Benton, W.C.: Workforce staffing and scheduling: hospital nursing specific models. Europ. J. Oper. Res. 60, 223–246 (1992)

    Google Scholar 

  28. Smith-Daniels, V.L., Schweikhert, S.B., Smith-Daniels, D.E.: Capacity management in health care services: Review and future research directions. Decision Sciences 19, 889–919 (1988)

    Google Scholar 

  29. Wandel, S.E., Hershey J.C.: Evaluation of nurse staffing policies using a manpower planning and scheduling model. Operational Research `75, North-Holland, Amsterdam, 561–580 (1976)

  30. Warner, D.M.: Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Operations Research 24, 842–856 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Information Sciences, Seikei University, 3-3-1, Kichijoji-Kitamachi, Musashino-shi, Tokyo, 180-8633, Japan

    Atsuko Ikegami & Akira Niwa

Authors
  1. Atsuko Ikegami
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Akira Niwa
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Atsuko Ikegami.

Additional information

Key words. nurse scheduling – block-angular problem – subproblem – integer programming – relaxation – tabu search – branch-and-bound

Mathematics Subject Classification (1991): 20E28, 20G40, 20C20

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ikegami, A., Niwa, A. A subproblem-centric model and approach to the nurse scheduling problem. Math. Program., Ser. B 97, 517–541 (2003). https://doi.org/10.1007/s10107-003-0426-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-003-0426-2

Keywords