Date of Award

3-1991

Document Type

Thesis

Degree Name

Master of Science in Operations Research

Department

Department of Operational Sciences

First Advisor

James Chrissis, PhD

Abstract

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.

AFIT Designator

AFIT-GOR-ENS-91M-7

DTIC Accession Number

ADA238569

Comments

The author's Vita page is omitted

Download

Share

COinS