Skip to main content
SpringerLink
Log in
Book cover

Scalable Optimization via Probabilistic Modeling pp 315–332Cite as

BOA for Nurse Scheduling

  • Chapter

Part of the book series: Studies in Computational Intelligence ((SCI,volume 33))

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Aickelin U, Dowsland K (2000) Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling 3: 139-153

    Article  MATH  MathSciNet  Google Scholar 

  2. Aickelin U, Dowsland K (2003) An indirect genetic algorithm for a nurse scheduling problem. Computers and Operations Research 31: 761-778

    Article  Google Scholar 

  3. Aickelin U, White P (2004) Building better nurse scheduling algorithms. Annals of Operations Research 128: 159-177

    Article  MATH  Google Scholar 

  4. Baker K (1976) Workforce allocation in cyclical scheduling problems: a survey. Operational Research 27: 155-167

    Article  Google Scholar 

  5. Bechtold SE, Brusco MJ, Showalter MJ (1991) A comparative evaluation of labor tour scheduling methods. Decision Sciences 22: 683-699

    Article  Google Scholar 

  6. Blau R, Sear A (1983) Nurse scheduling with a microcomputer. Journal of Ambulance Care Management 6: 1-13

    Google Scholar 

  7. Bradley D, Martin J (1990) Continuous personnel scheduling algorithms: a literature review. Journal of the Society for Health Systems 2: 8-23

    Google Scholar 

  8. Burke EK, Kendall G, Soubeiga E (2003) A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics 9: 451-470

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Chen JG, Yeung T (1993) Hybrid expert system approach to nurse scheduling. Computers in Nursing 11: 183-192

    Google Scholar 

  12. Dowsland K (1998) Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research 106: 393-407

    Article  MATH  Google Scholar 

  13. Dowsland K, Thompson JM (2000) Nurse scheduling with knapsacks, networks and tabu search. Journal of Operational Research Society 51: 825-833

    Article  MATH  Google Scholar 

  14. Ernst AT, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research 153: 3-27

    Article  MATH  MathSciNet  Google Scholar 

  15. Goldberg DE (1989) Genetic algorithms in search, optimization and machine leaning. Addison-Wesley, Reading, MA

    Google Scholar 

  16. Li J, Aickelin U (2003) A Bayesian optimization algorithm for the nurse scheduling problem. In Proceedings of Congress on Evolutionary Computation. IEEE Press, pp. 2149-2156

    Google Scholar 

  17. Li J, Aickelin U (2004) The application of Bayesian optimization and classifier systems in nurse scheduling. In Yao X et al. (eds) Proceedings of the 8th International Conference on Parallel Problem Solving from Nature. Springer, LNCS, Berlin Heidelberg, New York 3242: 581-590

    Google Scholar 

  18. Miller HE, Pierskalla W, Rath G (1976) Nurse scheduling using mathe-matical programming. Operations Research 24: 857-870

    Article  MATH  Google Scholar 

  19. Mühlenbein H, Mahnig T (1999) FDA - a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation 7: 45-68

    Article  Google Scholar 

  20. Okada M, Okada M (1988) Prolog-based system for nursing staff scheduling implemented on a personal computer. Computers and Biomedical Research 21: 53-63

    Article  Google Scholar 

  21. Pearl J (1988) Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann, San Franscisco, CA

    Google Scholar 

  22. Pelikan M (2005) Hierarchical Bayesian optimization algorithm - toward a new generation of evolutionary algorithms. Springer, Berlin Heidelberg New York

    MATH  Google Scholar 

  23. Pelikan M, Goldberg D, Cantu-Paz E (1999) BOA: the Bayesian optimization algorithm. IlliGAL Report No. 99003, University of Illinois

    Google Scholar 

  24. Scott S, Simpson RM (1998) Case-bases incorporating scheduling constraint dimensions: experiences in nurse rostering. In Smyth S, Cunningham P (eds) Advances in case-based reasoning, Springer, Berlin Heidelberg New York LNAI 1488: 392-401

    Chapter  Google Scholar 

  25. Sitompul D, Randhawa S (1990) Nurse scheduling models: a state-of-the-art review. Journal of the Society of Health Systems 2: 62-72

    Google Scholar 

  26. Smith LD, Bird D, Wiggins A (1979) A computerized system to schedule nurses that recognizes staff preferences. Hospital Health Service Admin-istration 24: 19-35

    Google Scholar 

  27. Tien JM, Kamiyama A (1982) On manpower scheduling algorithms. Society for Industrial and Applied Mathematics 24: 275-287

    MATH  MathSciNet  Google Scholar 

  28. Trivedi VM, Warner M (1976) A branch and bound algorithm for opti-mum allocation of float nurses. Management Science 22: 972-981

    Article  MATH  Google Scholar 

  29. Warner M, Prawda J (1972) A mathematical programming model for scheduling nursing personnel in a hospital. Management Science 19: 411-422

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Nottingham, NG8 IBB, Nottingham, UK

    Jingpeng Li

  2. University of Nottingham, NG8 IBB, Nottingham, UK

    Uwe Aickelin

Authors
  1. Jingpeng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uwe Aickelin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Math. And Computer Science, University of Missouri at St. Louis, One University Blvd., 320 CCB, MO 63121, St. Louis, USA

    Martin Pelikan

  2. Department of Industrial and Enterprise Systems Engineering, Illinois Genetic Algorithms Laboratory, 414 TB, 104 S. Mathews Ave., IL 61801, Urbana, USA

    Kumara Sastry

  3. Yahoo! Inc., 701 First Avenue, CA 94809, Sunnyvale, USA

    Erick CantúPaz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Li, J., Aickelin, U. (2006). BOA for Nurse Scheduling. In: Pelikan, M., Sastry, K., CantúPaz, E. (eds) Scalable Optimization via Probabilistic Modeling. Studies in Computational Intelligence, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-34954-9_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-34954-9_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34953-2

  • Online ISBN: 978-3-540-34954-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation