A HEURISTIC APPROACH TO PILOT SCHEDULING
Abstract
A large number of pilots in the Air Force are being utilized today in fields not involving primary aircrew positions. While in these fields of endeavor pilots are required by the Air Force to maintain flying proficiency. Most Air Force bases maintain personnel and aircraft specifically to fulfill this requirement and much time is expended in the scheduling of these attached pilots. The aircraft and pilot availabilities must be considered, of course, in this scheduling process. Air Force restrictions and local flight policies add to the complexity of the problem. The pilot scheduling problem is further confounded by errors introduced by the human scheduler. It is the purpose of this thesis to develop a technique, employing a computer, to produce a feasible flight schedule. The specific problem under consideration to illustrate the technique is the scheduling of Air Force pilots attending the University of Pittsburgh. These pilots are attached to the 911th Troop Carrier Group at the Greater Pittsburgh Airport for flying. The aircraft provided is the C-47 (DC-3, Douglas 'Skytrain'). The computer program is written in the Fortran language for the IBM 7090 computer system utilizing the Michigan Executive System.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1964
- Accession Number
- AD0603478
Entities
People
- Robert A. Green
Organizations
- University of Pittsburgh