Flight Attendant Rostering for Short-Haul Airline Operations

Paul R. Day and David M. Ryan
Additional contact information
Paul R. Day: University of Auckland, Auckland, New Zealand
David M. Ryan: University of Auckland, Auckland, New Zealand

Operations Research, 1997, vol. 45, issue 5, 649-661

Abstract: The construction of flight attendant (cabin crew) rosters for short-haul (domestic) airline flight services that satisfies rostering constraints and employment contract regulations is a combinatorially complex problem. In this paper the problem is described and an effective optimisation-based solution method is introduced. The rostering problem involves the allocation of days-off and various duties to each crew member over a roster period. The days-off and the duty allocation problems are separated into two distinct subproblems. The days-off allocation solution approach involves complete enumeration of all possible days-off lines for each crew member over the roster period, and then the solution of a set partitioning optimisation to determine a best quality feasible days-off roster . The duty allocation solution approach first involves the generation of many lines-of-work consistent with the days-off solution for each crew member over a subroster period and then the solution of a set partitioning optimisation to determine an optimal feasible subroster. These two steps of generation and optimisation are repeated for each subsequent subroster period until a full legal and feasible roster is constructed for the complete roster period. The use of subrosters reduces the combinatorial complexity resulting in problems that can be solved efficiently. After construction of the initial roster, the quality can often be improved using re-rostering techniques. The method leads to efficient construction of good quality legal rosters, and has been used to produce all short-haul flight attendant rosters at Air New Zealand since 1993.

Keywords: transportation; scheduling; personnel; flight attendant rostering; mathematics; combinatorics; set partitioning (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.45.5.649 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:45:y:1997:i:5:p:649-661

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().