Harald Meyer auf'm Hofe: ConPlan/SIEDAplan: Personnel Assignment as a Problem of Hierarchical Constraint Satisfaction
Proceedings
on the 3rd International Conference on Practical Applications of
Constraint Technologies, pages 257-272, Practical Application Company
Ltd.
Abstract: The ConPlan project
conducted by the German Research Center for Artificial Intelligence in
collaboration with the SIEDA Software house aimed at representing and
solving nurse scheduling problems as a problem of optimizing constraint
satisfaction. Shifts are assigned to the personnel complying with legal
regulations, avoiding over-time work as far as possible and meeting as
many additional requirements as possible. These requirements are
encoded in a hierarchical constraint satisfaction problem (HCSP)
comprising 600 to 800 variables. This paper explains on the one hand
how nurse scheduling has been represented as a problem of optimizing
consistency with constraints. On the other hand, the used search
algorithm is described.
|
Impressum
