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.
graph coloring crew scheduling preferential bidding tabu search