Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474256 | Computers & Operations Research | 2007 | 12 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Michel Gamache, Alain Hertz, Jérôme Olivier Ouellet,