Computational Optimization and Applications

, Volume 40, Issue 3, pp 321-349

First online:

Stochastic programming for nurse assignment

  • Prattana PunnakitikashemAffiliated withSchool of Business Administration, National Institute of Development Administration Email author 
  • , Jay M. RosenbergerAffiliated withDepartment of Industrial and Manufacturing Systems Engineering, The University of Texas at Arlington
  • , Deborah Buckley BehanAffiliated withSchool of Nursing, The University of Texas at Arlington

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.


Nurse assignment Stochastic programming Benders’ decomposition L-shaped method