Abstract
The nurse scheduling problem (NSP) has a great impact on the quality and efficiency of health care operations. Healthcare Operations Analysts have to assign daily shifts to nurses over the planning horizon, so that operations costs are minimized, health care quality is improved, and the nursing staff is satisfied. Due to conflicting objectives and a myriad of restrictions imposed by labor laws, company requirements, and other legislative laws, the NSP is a hard problem. In this paper we present a particle swarm optimization-based algorithm that relies on a heuristic mechanism that incorporates hard constraints to improve the computational efficiency of the algorithm. Further, we incorporate soft constraints into objective function evaluation to guide the algorithm. Results from illustrative examples show that the algorithm is effective and efficient, even over large scale problems.