LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Brucker, Peter; Qu, Rong; Burke, Edmund; Post, Gerhard (2005)
Languages: English
Types: Unknown
Subjects:
This paper presents our work on decomposing a specific nurse rostering problem by cyclically assigning blocks of shifts, which are designed considering both hard and soft constraints, to groups of nurses. The rest of the shifts are then assigned to the nurses to construct a schedule based on the one cyclically generated by blocks. The schedules obtained by decomposition and construction can be further improved by a variable neighborhood search. Significant results are obtained and compared with a genetic algorithm and a variable neighborhood search approach on a problem that was presented to us by our collaborator, ORTEC bv, The Netherlands. We believe that the approach has the potential to be further extended to solve a wider range of nurse rostering problems.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • Adbennadher S. and Schlenker H.: Nurse Scheduling using Constraint Logic Programming, Eleventh Annual Conference on Innovative Applications of Artificial Intelligence, IAAI-99 (1999), 838-843.
    • Aickelin U. and Dowsland K.: An Indirect Genetic Algorithm for a Nurse Scheduling Problem. JORS, (2003) 31(5): 761-778.
    • Aickelin U. and White P.: Building Better Nurse Scheduling Algorithms. Annals of Operations Research, (2004), 128:159-177.
    • Bailey J. and Field J.: Personnel Scheduling with Flexshift Models. Journal of Operations Management, (1985) 5(3): 327-338.
    • Bard J. and Purnomo H.W.: Preference Scheduling for Nurses using Column Generation, EJOR, (2005), 164: 510- 534.
    • Beaumont N.: Scheduling Staff using Mixed Integer Programming. EJOR, (1997) 98: 473-484.
    • Beddoe G. and Petrovic S.: Determining Feature Weights Using a Genetic Algorithm in a Case-Based Reasoning Approach to Personnel Rostering. Accepted for publication in EJOR, (2005).
    • Berrada I., Ferland J.A. and Michelon P.: A Multi-objective Approach to Nurse Scheduling with both Hard and Soft Constraints. Socio-Economic Planning Science, (1996), 30(3): 183-193.
    • Valouxis C. and Housos E.: Hybrid Optimisation Techniques for the Workshift and Rest Assignment of Nursing Personnel. Artificial Intelligence in Medicine, (2000), 20: 155-175.
    • Warner M.: Scheduling Nursing Personnel According to Nurse Preference: a Mathematical Programming Approach. OR, (1976) 24: 842-856.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article