Scalable Load Balancing in Nurse to Patient Assignment Problems
(2009) 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems — Location: Pittsburgh (27.May.2009)
Files
cpaior09-nurses.pdf
Restricted Access - Adobe PDF
- 437.48 KB
Details
- Authors
- Abstract
- This paper considers the daily assignment of newborn infant patients to nurses in a hospital. The objective is to balance the workload of the nurses, while satisfying a variety of side constraints. Prior work proposed a MIP model for this problem, which unfortunately did not scale to large instances and only approximated the objective function, since minimizing the variance cannot be expressed in a linear model. This paper presents constraint programming (CP) models of increasing complexity to solve large instances with hundreds of patients and nurses in a few seconds using the Comet optimization system. The CP models use the recent spread global constraint to minimize the variance, as well as an exact decomposition technique.
- Affiliations
Citations
Schaus, P., Van Hentenryck, P., & Regin, J.-C. (2009). Scalable Load Balancing in Nurse to Patient Assignment Problems. Lecture Notes in Computer Science, 5547, 248-262. https://doi.org/10.1007/978-3-642-01929-6_19 (Original work published 2009)