Skip to main content

Solving Nurse Rostering Problems by a Multiobjective Programming Approach

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7653))

Abstract

In this paper, we present a multiobjective programming approach for solving nurse rostering problems. We first formulate the nurse rostering problems as a multiobjective mixed 0-1 linear program and then prove that finding an efficient solution of the last program leads to solving one mixed 0-1 linear problem. Two benchmark problems are considered and computational experiments are presented.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beaumont, N.: Scheduling staff using mixed integer programming. European Journal of Operation Research 98, 473–484 (1997)

    Article  MATH  Google Scholar 

  2. Berrada, I., Ferland, J.A., Michelon, P.: A Multi-objective Approach to Nurse Scheduling with both Hard and Soft Constraints. Socio-Econ. Plann. Sci. 30(3), 183–193 (1996)

    Article  Google Scholar 

  3. Burke, E.K., De Causmaecker, P., Vanden Berghe, G.: A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem. In: McKay, B., Yao, X., Newton, C.S., Kim, J.-H., Furuhashi, T. (eds.) SEAL 1998. LNCS (LNAI), vol. 1585, pp. 187–194. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Burke, E.K., De Causmaecker, P., Vanden Berghe, G., Van Landeghem, H.: The state of the art of nurse rostering. Journal of Scheduling 7, 441–499 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Burke, E.K., Li, J., Qu, R.: A hybrid model of integer programmming and variable neighbourhood search for highly-constrained nurse rostering problems. European Journal of Operation Research 203, 484–493 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems - A bibliographic survey. European Journal of Operation Research 151, 447–460 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ehrgott, M., Gandibleux, X.: Approximative Solution Methods for Multiobjective Combinatorial Optimization. Sociedad de Estadística e Investigación Operativia 12(1), 1–89 (2004)

    MathSciNet  MATH  Google Scholar 

  8. Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  9. Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: A review of applications, methods and model 153, 3–27 (2004)

    Google Scholar 

  10. Glass, C.A., Knight, R.A.: The nurse rostering problem: A critical apparaisal of the problem structure. European Journal of Operation Research 202, 379–389 (2010)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pham, V.N., Le Thi, H.A., Pham Dinh, T. (2012). Solving Nurse Rostering Problems by a Multiobjective Programming Approach. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34630-9_56

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34630-9_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34629-3

  • Online ISBN: 978-3-642-34630-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics