Investigation of a Zero-One Integer Programming Approach to Automating the Scheduling Process at the USAF Test Pilot School
AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING
Pagination or Media Count:
This thesis investigated models that could be used to determine a feasible schedule for the Test Pilot School TPS training program and form the basis for an automated scheduling system. The TPS problem is formulated as a 0-1 integer linear program and is solved using preprocessing techniques and the Branch-and-Bound algorithm. The method produced feasible solutions for small problems that equate to portions of the TPS schedule but cannot efficiently solve large problems like the full TPS problem. More investigation should be conducted to alter the method developed in the study so it could be used for large problems. A promising approach might be to develop a specialized Branch- and-Bound algorithm that uses the preprocessing methods discussed in the study.
- Military Aircraft Operations
- Personnel Management and Labor Relations
- Operations Research