A network model for airline cabin crew scheduling

Shangyao Yan, Yu Ping Tu

Research output: Contribution to journalArticlepeer-review

60 Scopus citations


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.

Original languageEnglish
Pages (from-to)531-540
Number of pages10
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - 1 Aug 2002


  • Airline crew scheduling
  • Flow decomposition
  • Network simplex
  • Pure network problem
  • Set covering (partitioning) problem


Dive into the research topics of 'A network model for airline cabin crew scheduling'. Together they form a unique fingerprint.

Cite this