We present a crew scheduling problem with time windows in the context of
scheduling train personnel, which encompasses not only assignment of resources
to tasks but also the introduction of extra tasks, passive journeys, depending
on the problem instance.
The representation of the problem is made as a constraint program, which
relies heavily on some global constraints, notably a constraint for expressing
non-overlap between rectangles on a surface.
A search algorithm is described and we also point out some problems and
deficiencies of the current model and its computational behaviour