Maintenance and Crew Considerations in Fleet Assignment

L. W. Clarke, C. A. Hane, E. L. Johnson and G. L. Nemhauser
Additional contact information
L. W. Clarke: Georgia Institute of Technology, Atlanta, Georgia 30332
C. A. Hane: CAPS Logistics, Atlanta, Georgia 30339
E. L. Johnson: Georgia Institute of Technology, Atlanta, Georgia 30332
G. L. Nemhauser: Georgia Institute of Technology, Atlanta, Georgia 30332

Transportation Science, 1996, vol. 30, issue 3, 249-260

Abstract: Given a flight schedule, which is a set of flight segments with specified departure and arrival times, and a set of aircraft, the fleet assignment problem is to determine which aircraft type should fly each flight segment. The objective is to maximize revenue minus operating costs. In the basic fleet assignment problem considered by Hane et al. (Hane, C. A., C. Barnhart, E. L. Johnson, R. E. Marsten, G. L. Nemhauser, G. Sigismondi. 1995. The fleet assignment problem: Solving a large-scale integer program. Math. Programming 70 211--232.) a daily, domestic fleet assignment problem is modeled and solved with up to eleven fleets and 2,500 flight legs. This paper provides modeling devices for including maintenance and crew considerations into the basic model while retaining its solvability.

Date: 1996
References: Add references at CitEc
Citations: View citations in EconPapers (40)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.30.3.249 (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:30:y:1996:i:3:p:249-260

Access Statistics for this article

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