Airline crew scheduling with regularity

Diego Klabjan*, Ellis L. Johnson, George L. Nemhauser, Eric Gelman, Srini Ramaswamy

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

Abstract

The airline crew scheduling problem is the problem of assigning crew itineraries to flights. The problem is hard due to a large number of itineraries and the complicated cost function of an itinerary. The classic approach, which uses a set partitioning formulation, only captures the objective function of minimizing cost. We add a second goal of maximizing the repetition or regularity of itineraries over a weekly horizon and we develop models that capture regularity. We present a new algorithm that solves the crew scheduling problem over a weekly horizon. Solutions are reported that improve on existing solutions used by an airline.

Original languageEnglish (US)
Pages (from-to)359-374
Number of pages16
JournalTransportation Science
Volume35
Issue number4
DOIs
StatePublished - Jan 1 2001

ASJC Scopus subject areas

  • Transportation

Fingerprint Dive into the research topics of 'Airline crew scheduling with regularity'. Together they form a unique fingerprint.

Cite this