We study a unique challenge in the crew rostering problem faced by a large airline in China, where fairness for crewmembers is the main concern. The fairness aspect of rosters produced by a commercial optimizer is not satisfactory. We discuss the challenges imposed by the fairness constraint and devise a greedy heuristic to directly address these challenges. The resulting algorithm is not only much faster but also produces a more balanced plan based on actual data from the airline in question. © 2011 Springer-Verlag.
CITATION STYLE
Chen, Q., Lim, A., & Zhu, W. (2011). A greedy heuristic for airline crew rostering: Unique challenges in a large airline in China. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6704 LNAI, pp. 237–245). https://doi.org/10.1007/978-3-642-21827-9_24
Mendeley helps you to discover research relevant for your work.