Crew Scheduling problems at the planning level have typically been solved in two steps, creating working patterns and then assigning these to the individual crew. The first part of the problem can be solved by a set covering model and the latter can be modelled as set partitioning. At the operational level the (re)planning period is considerably smaller than during the strategic planning phase.

The paper discusses an integrated model to solve the problems arising on the day of operations. We describe solution techniques based on simple tree search and more sophisticated column generation and shortest-path algorithms.