Article | Strategy and Innovation area | Year 2008 | |
Stochastic Programming For Nurse Assignmentby Prattana Punnakitikasem; Jay M Rosenberger; Behan D. Buckley | |
Computational Optimization and Applications 40(3), p.321-349 July 2008 |
AbstractWe 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. © 2007 Springer Science+Business Media, LLC.
Keywords: Benders' decomposition; L-shaped method; Nurse assignment; Stochastic programming Comments: Computational Optimization and Applications |