A Graph Partitioning Approach to Airline Crew Scheduling

In this paper, we present a computerized procedure for scheduling airline crews. The procedure performs set partitioning on a graph by decomposing the problem into a series of subproblems which are solved as matching problems. Computational tests of the algorithm reveal consistent performance in producing efficient solutions to the air crew scheduling problem.

[1]  Kurt Spielberg,et al.  Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..

[2]  Edward K. Baker,et al.  THE DEVELOPMENT AND IMPLEMENTATION OF A HEURISTIC SET COVERING BASED SYSTEM FOR AIR CREW SCHEDULING , 1985 .

[3]  R. E. Marsten,et al.  A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem , 1980 .

[4]  Roy E. Marsten,et al.  Crew Planning at Flying Tiger: A Successful Application of Integer Programming , 1979 .

[5]  Roy E. Marsten,et al.  Exact solution of crew scheduling problems using the set partitioning model: Recent successful applications , 1981, Networks.

[6]  A. M. Geoffrion.  Integer Programming by Implicit Enumeration and Balas’ Method , 1967 .

[7]  J. Rubin.  A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling , 1973 .

[8]  Javier Etcheberry,et al.  The Set-Covering Problem: A New Implicit Enumeration Algorithm , 1977, Oper. Res..

[9]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[10]  Ulrich Derigs,et al.  An analysis of alternative strategies for implementing matching algorithms , 1983, Networks.

[11]  R. E. Marsten.  An Algorithm for Large Set Partitioning Problems , 1974 .

[12]  Edward Keefer Baker,et al.  Efficient heuristic solutions for the airline crew scheduling problem , 1979 .

[13]  D. R. Fulkerson,et al.  MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .

[14]  Ulrich Derigs,et al.  A shortest augmenting path method for solving minimal perfect matching problems , 1981, Networks.

[15]  J. P. Arabeyre,et al.  The Airline Crew Scheduling Problem: A Survey , 1969 .

[16]  Lawrence Bodin,et al.  A Matching Based Heuristic for Scheduling Mass Transit Crews and Vehicles , 1983 .

[17]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[18]  Nicos Christofides,et al.  Note—A Computational Survey of Methods for the Set Covering Problem , 1975 .

[19]  Herv Thiriez,et al.  Airline crew scheduling : a group theoretic approach , 1969 .