Paper Info
Title
Scalable Load Balancing in Nurse to Patient Assignment Problems
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.
Year
DOI
Venue
2009
10.1007/978-3-642-01929-6_19
CPAIOR
Keywords
Field
DocType
mip model,scalable load,comet optimization system,side constraint,global constraint,constraint programming,patient assignment problems,objective function,linear model,cp model,daily assignment,large instance,load balance,satisfiability,assignment problem
Mathematical optimization,Workload,Load balancing (computing),Computer science,Linear model,Constraint programming,Scalability
Conference
Volume
ISSN
Citations 
5547
0302-9743
18
PageRank 
References 
Authors
1.09
10
3
Name
Order
Citations
PageRank
Pierre Schaus112724.63
Pascal Van Hentenryck24052425.66
Jean-charles Régin3131296.59