A Mathematical Programming Model for an Aircraft Modification Program.
Abstract
A large fleet of aircraft is to be modified by the installation on each aircraft in the fleet of a certain number of engineering change proposal (ECP) kits. the aircraft are deployed in smaller sub-fleets, called field units, at various locations around the world, and the kit installations are to take place at a single contractor facility. Therefore, each of the aircraft must be taken out of operation in the field and sent in to the contractor facility for modification. Each field unit has an authorized strength of aircraft with a specified operational readiness to maintain, permitting only a certain number of aircraft to be away from each field unit at a given time. Furthermore, ECP kits become available over a period of time. At the beginning of the program only certain types of kits are available, and the last type of kit doesn't become available until some time later. Therefore, an aircraft sent in for modification early in the program will not get all of the ECP kits and must be sent back at least a second time. In order to maintain operational readiness, the aircraft should be sent in as few times as possible and brought back as quickly as possible. An optimum solution to the problem of how many aircraft should be sent in and for how long they should remain can be developed using mathematical programming.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1977
- Accession Number
- ADA042813
Entities
People
- D. Frank Fox