Skip to main navigation Skip to search Skip to main content

Stochastic programming for nurse assignment

  • National Institute of Development Administration
  • University of Texas at Arlington College of Engineering
  • University of Texas at Arlington

Research output: Contribution to journalArticlepeer-review

67 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)321-349
Number of pages29
JournalComputational Optimization and Applications
Volume40
Issue number3
DOIs
Publication statusPublished - Jul 2008
Externally publishedYes

Keywords

  • Benders' decomposition
  • L-shaped method
  • Nurse assignment
  • Stochastic programming

Fingerprint

Dive into the research topics of 'Stochastic programming for nurse assignment'. Together they form a unique fingerprint.

Cite this