Anesthesiology nurse scheduling using particle swarm optimization

14Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

In this article we present an approach designed to solve a real world problem: the Anesthesiology Nurse Scheduling Problem (ANSP) at a public French hospital. The anesthesiology nurses are one of the most shared resources in the hospital and we attempt to find a fair/balanced schedule for them, taking into account a set of constraints and the nurses’ stated preferences, concerning the different shifts. We propose a particle swarm optimization algorithm to solve the ANSP. Finally, we compare our technique with previous results obtained using integer programming. © 2012, Copyright the authors.

Cite

CITATION STYLE

APA

Altamirano, L., Riff, M. C., Araya, I., & Trilling, L. (2012). Anesthesiology nurse scheduling using particle swarm optimization. International Journal of Computational Intelligence Systems, 5(1), 111–125. https://doi.org/10.1080/18756891.2012.670525

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