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

被引：46

作者：

Gamache, Michel ^{[1
]}

Hertz, Alain

Ouellet, Jerome Olivier

机构：

[1] Ecole Polytech, Dept Genies Civil Geol & Mines, Montreal, PQ H3C 3A7, Canada

[2] Ecole Polytech, Dept Math & Genie Ind, Montreal, PQ H3C 3A7, Canada

来源：

COMPUTERS & OPERATIONS RESEARCH | 2007年 / 34卷 / 08期

关键词：

graph coloring; crew scheduling; preferential bidding; tabu search;

D O I：

10.1016/j.cor.2005.09.010

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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. (c) 2005 Published by Elsevier Ltd.

引用

页码：2384 / 2395

页数：12