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

  • Gamache M
  • Hertz A
  • Ouellet J
  • 23


    Mendeley users who have this article in their library.
  • 35


    Citations of this article.


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. © 2005.

Author-supplied keywords

  • Crew scheduling
  • Graph coloring
  • Preferential bidding
  • Tabu search

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Michel Gamache

  • Alain Hertz

  • Jérôme Olivier Ouellet

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free