A network model for airline cabin crew scheduling

A network model for airline cabin crew scheduling

0.00 Avg rating0 Votes
Article ID: iaor20031364
Country: Netherlands
Volume: 140
Issue: 3
Start Page Number: 531
End Page Number: 540
Publication Date: Aug 2002
Journal: European Journal of Operational Research
Authors: ,
Keywords: networks: scheduling
Abstract:

Airline crew scheduling problems have been traditionally formulated as set covering problems or set partitioning problems. When flight networks are extended, these problems become more complicated and thus more difficult to solve. From the current practices of a Taiwan airline, whose work rules are relatively simple compared to many airlines in other countries, we find that pure network models, in addition to traditional set covering (partitioning) problems, can be used to formulate their crew scheduling problems. In this paper, we introduce a pure network model that can both efficiently and effectively solve crew scheduling problems for a Taiwan airline using real constraints. To evaluate the model, we perform computational tests concerning the international line operations of a Taiwan airline.

Reviews

Required fields are marked *. Your email address will not be published.