Date of Award

3-2023

Document Type

Thesis

Degree Name

Master of Science

Department

Department of Operational Sciences

First Advisor

Jesse G. Wales, PhD

Abstract

This research examines the Cadet to Air Force Specialty Code (AFSC) Matching Problem (CAMP). Currently, the matching problem occurs annually at the Air Force Personnel Center (AFPC) using an integer program and value focused thinking approach. This paper presents a novel method to match cadets with AFSCs using a generalized structure of the Hospitals Residents problem with special emphasis on lower quotas. This paper also examines the United States Army Matching problem and compares it to the techniques and constraints applied to solve the CAMP. The research culminates in the presentation of three algorithms created to solve the CAMP and explores the advantages and disadvantages of each.

AFIT Designator

AFIT-ENS-MS-23-M-139

DTIC Accession Number

AD1341970

Comments

An embargo was observer for posting this thesis on AFIT Scholar.

Approved for public release. Case number on file.

Download

Share

COinS