Stochastic programming for nurse assignment

Stochastic programming for nurse assignment

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 subpr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computational optimization and applications 2008-07, Vol.40 (3), p.321-349
Hauptverfasser: Punnakitikashem, Prattana, Rosenberger, Jay M., Buckley Behan, Deborah
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Budgeting
Budgets
Convex and Discrete Geometry
Hospitals
Integer programming
Management Science
Mathematical models
Mathematics
Mathematics and Statistics
Nurses
Nursing
Older people
Operations Research
Operations Research/Decision Theory
Optimization
Optimization algorithms
Patients
Planning
Schedules
Scheduling
Statistical analysis
Statistics
Stochastic models
Studies
Workloads
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-007-9084-2