Pilot Scheduling in a Fighter Squadron.

Abstract

Air Force fighter pilots, in order to remain combat qualified, must complete flight training every 6 months as specified by Tactical Air Command Manual (TACM) 51-50. Presently, scheduling is manual. As a result, pilots do not receive an optimum flow of training and often do not complete their required training. We propose a computer model, and integer program, based on branch and bound techniques to solve the problem on a micro-computer. The model includes complicating constraints such a screw rest restrictions and absences from duty and ensures that each pilot receives at least a minimum, or no more than a maximum, number of lights per week. Our method involves relaxing some of the constraints (e.g. crew rest constraints) to obtain a network flow problem. We tighten the relaxation by solving small set covering problems derived from the relaxed constraints. The model was developed and tested on an IBM personal computer.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1983
Accession Number
ADA126947

Entities

People

  • William Henry Roege

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Aircrafts
  • Algorithms
  • Computer Programming
  • Computers
  • Instructors
  • Linear Programming
  • Mathematical Models
  • Mathematical Programming
  • Operations Research
  • Optimization
  • Personal Computers
  • Personnel Management
  • Simplex Method
  • Students
  • Tanker Aircraft
  • United States

Fields of Study

  • Computer science

Readers

  • Aviation Science / Aeronautics.
  • Computer Science.
  • Operations Research