Stochastic programming for nurse assignment

Authors:
Prattana Punnakitikashem;Jay M. Rosenberger;Deborah Buckley Behan
Affiliations:
School of Business Administration, National Institute of Development Administration, Bangkok, Thailand 10240;Department of Industrial and Manufacturing Systems Engineering, The University of Texas at Arlington, Arlington, USA 76019-0407;School of Nursing, The University of Texas at Arlington, Arlington, USA 76019-0017
Venue:
Computational Optimization and Applications
Year:
2008

Citing 7
Cited 0

L-shaped decomposition of two-stage stochastic programs with integer recourse

Mathematical Programming: Series A and B
A Memetic Approach to the Nurse Rostering Problem

Applied Intelligence
Nurse Rostering at the Hospital Authority of Hong Kong

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Improving Discrete Model Representations via Symmetry Considerations

Management Science
An indirect genetic algorithm for a nurse-scheduling problem

Computers and Operations Research
The State of the Art of Nurse Rostering

Journal of Scheduling
A stochastic integer programming approach to solving a synchronous optical network ring design problem

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a brief overview of four phases of nurse planning. For the last phase, which assigns nurses to patients, a stochastic integer programming model is developed. A Benders' decomposition approach is proposed to solve this problem, and a greedy algorithm is employed to solve the recourse subproblem. To improve the efficiency of the algorithm, we introduce sets of valid inequalities to strengthen a relaxed master problem. Computational results are provided based upon data from Baylor Regional Medical Center in Grapevine, Texas. Finally, areas of future research are discussed.