G-2005-34
A Graph Coloring Model for a Feasibility Problem in Crew Scheduling
, et référence BibTeX
We consider a 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.
Paru en avril 2005 , 24 pages
Axe de recherche
Applications de recherche
Document
G-2005-34.pdf (210 Ko)