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 language | English |
|---|---|
| Pages (from-to) | 321-349 |
| Number of pages | 29 |
| Journal | Computational Optimization and Applications |
| Volume | 40 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - Jul 2008 |
| Externally published | Yes |
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver