Prof. Alain Hertz

November 23, 2007, 14:00, Room GC B3 424 (click here for the map)

A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding

We consider a monthly crew scheduling problem with preferential bidding in the airline industry. We propose a new methodology based on a graph coloring model and a tabu search algorithm for determining if the problem contains at least one feasible solution. We then show how to combine the proposed approach with a heuristic sequential scheduling method that uses column generation and branch-and-bound techniques. (joint work with M. Gamache and J. Ouellet)


[Download the slides here]