Heuristics for Scheduling Aircraft and Crew during Airlift Operations

Michael G. Sklar, R. D. Armstrong and S. Samn
Additional contact information
Michael G. Sklar: Emory University, Atlanta, Georgia 30322
R. D. Armstrong: Rutgers University, Newark, New Jersey 07102
S. Samn: School of Aerospace Medicine, Brooks Air Force Base, San Antonio, Texas 78235

Transportation Science, 1990, vol. 24, issue 1, 63-76

Abstract: The Air Force is frequently placed in a situation where a large quantity of goods must be transported between various locations in a specified time period by Air Force personnel. The goods are of different and interrelated types; thus, the sequence of missions is specified to maintain a proper balance of goods at each location. Other vital considerations include both aircraft maintenance and health and alertness maintenance for pilots and personnel. Nevertheless, economy in operations needs to be demonstrated. Thus, the problem addressed in this paper is one of minimizing the number of crews used in the airlift, subject to crew rest requirements and the completion of all missions within the specified time frame. It is assumed that all routes, missions, and aircraft are predefined with limited crew availability. Results of computational testing are provided where the proposed algorithms are compared to the current Air Force methods.

Date: 1990
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.24.1.63 (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:24:y:1990:i:1:p:63-76

Access Statistics for this article

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