Applying CP(F D), CLP(F D) and CFLP(F D) to a Real-life Employee Timetabling Problem

This paper presents a case study based on a real-life Employee Timetabling Problem, formulating it and then making a com- parison of its modeling and solution with three different programming paradigms embedding Finite Domain constraint solving: Constraint Programming, Constraint Logic Programming and Constraint Functional Logic Programming. The analysis uses the systems Gecode, SICStus clpfd and TOY(F D) (with its two different versions relying on the Gecode and SICStus solvers, resp.) The modeling comparison via code examples points out the different abstraction levels the systems allow. The solving comparison uses different order-of-magnitude instances to perform a head-to-head comparison among the different systems.