Stochastic programming for nurse assignment
- First Online:
- Cite this article as:
- Punnakitikashem, P., Rosenberger, J.M. & Buckley Behan, D. Comput Optim Appl (2008) 40: 321. doi:10.1007/s10589-007-9084-2
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.