论文信息 - A METHOD FOR OPTIMALLY SOLVING THE ROSTERING PROBLEM

A METHOD FOR OPTIMALLY SOLVING THE ROSTERING PROBLEM

This paper presents a prototype method for optimally solving the rostering problem, i.e., constructing work schedules for airline crew members. The main goal is to show the possibilities of solving the rostering problem using optimal methods. The prototype uses a column generation approach embedded in a branch and bound algorithm to solve the rostering problem. To the knowledge of the authors, this prototype is the first optimal method for solving the rostering problem.

Michel Gamache | François Soumis | F. Soumis | M. Gamache

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

[2] Bernardo Nicoletti,et al. Automatic Crew Rostering , 1975 .

[3] C Giafferri,et al. AUTOMATIC MONTHLY ASSIGNMENT OF MEDIUM-HAUL CABIN CREW , 1982 .

[4] W Glanert,et al. A "TIMETABLE" APPROACH TO THE ASSIGNMENT OF PILOTS TO ROTATIONS , 1984 .

[5] Jacques Desrosiers,et al. Routing with time windows by column generation , 1983, Networks.

[6] J Byrne,et al. A PREFERENTIAL BIDDING SYSTEM FOR TECHNICAL AIRCREW , 1988 .

[7] D. Ryan,et al. On the integer properties of scheduling set partitioning models , 1988 .

[8] Martin Desrochers,et al. A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[9] Martin Desrochers,et al. CREW-OPT: Subproblem Modeling in a Column Generation Approach to Urban Crew Scheduling , 1992 .

[10] David M. Ryan,et al. The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .

[11] Jacques Desrosiers,et al. Time Constrained Routing and Scheduling , 1992 .