Crew Scheduling Approach to Calculate the Crew Productivity of Flight Schedules

Master thesis (2018)

Authors

M.C. Vonk Electrical Engineering, Mathematics and Computer Science

Contributors

Dion Gijswijt (supervisor 1)
J. Rezaei (coach)
J.H. Weber (coach)
Faculty
Electrical Engineering, Mathematics and Computer Science
Copyright: © 2018 Maarten Vonk
ILP Network Flow Min Cost Flow Set Cover Crew Pairing Column Generating Crew Scheduling Crew Rostering Matchings
More Info
expand_more

Published Date

05-12-2018

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

With cockpit crew costs being the second largest costs of an airline, making optimal use of the available crew is very important. The productivity of the crew is limited by the labor agreement and law regulations, which prevent the crew members from working irregularly or excessively. In this thesis we present several methods to solve the crew scheduling problem as to calculate the crew productivity based on the labor agreements and law regulations.
The crew scheduling problem is decomposed into the crew pairing problem and the crew rostering problem. A set covering approach is used to solve the traditional crew pairing problem and a matching algorithm is used to solve the crew pairing problem that arises when we allow flights being retimed. The crew rostering problem is tackled by a minimum cost flow network method and a column generation approach. All the methods are tested on a variety of flight schedules deviating in the number of night flights included.