Airline Crew Scheduling with Regularity
Diego Klabjan,
Ellis L. Johnson,
George L. Nemhauser,
Eric Gelman and
Srini Ramaswamy
Additional contact information
Diego Klabjan: Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, Urbana, IL 61801
Ellis L. Johnson: School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205
George L. Nemhauser: School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332-0205
Eric Gelman: Research and Development, Information Services Division, United Airlines
Srini Ramaswamy: Research and Development, Information Services Division, United Airlines
Transportation Science, 2001, vol. 35, issue 4, 359-374
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.
Date: 2001
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
http://dx.doi.org/10.1287/trsc.35.4.359.10437 (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:ortrsc:v:35:y:2001:i:4:p:359-374
Access Statistics for this article
More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().