Models for Global Constraint Applications
Constraints
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Bound-consistent deviation constraint
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The steel mill slab design problem revisited
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Load balancing and almost symmetries for RAMBO quorum hosting
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Solving problems with CP: four common pitfalls to avoid
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Synthesis of search algorithms from high-level CP models
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The balanced academic curriculum problem revisited
Journal of Heuristics
Activity-Based search for black-box constraint programming solvers
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
FOCUS: a constraint for concentrating high costs
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Planning oncologists of ambulatory care units
Decision Support Systems
Three generalizations of the FOCUS constraint
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
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.