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

DOI10.1016/j.cor.2005.09.010zbMath1144.90498MaRDI QIDQ869001

Alain Hertz, Michel Gamache, Jérôme Olivier Ouellet

Publication date: 26 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.09.010

zbMATH Keywords

tabu search; graph coloring; crew scheduling; preferential bidding

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B35: Deterministic scheduling theory in operations research

Related Items

Fuzzy colouring of fuzzy graphs, A graph coloring approach to the deployment scheduling and unit assignment problem, New secure partial encryption method for medical images using graph coloring problem, An exact algorithm with learning for the graph coloring problem, A hybrid scatter search heuristic for personalized crew rostering in the airline industry, A search space ``cartography for guiding graph coloring heuristics, A memetic algorithm for graph coloring, Coloring large graphs based on independent set extraction, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm, On the complexity of the selective graph coloring problem in some special classes of graphs, On some applications of the selective graph coloring problem

Uses Software

• Tabu search

Cites Work

• Using tabu search techniques for graph coloring
• Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
• Precoloring extension. I: Interval graphs
• The Preferential Bidding System at Air Canada
• A Column Generation Approach for Large-Scale Aircrew Rostering Problems
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Unnamed Item