BOA for nurse scheduling

3Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA) for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurse's assignment. Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Li, J., & Aickelin, U. (2007). BOA for nurse scheduling. Studies in Computational Intelligence, 33, 315–332. https://doi.org/10.1007/978-3-540-34954-9_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free