Date of Award

3-1991

Document Type

Thesis

Degree Name

Master of Science

Department

Department of Operational Sciences

First Advisor

Yupo Chan, PhD

Second Advisor

James Chrissis, PhD

Abstract

This study looked at a specific scheduling problem for a Department of Defense agency. A heuristic algorithms was developed to solve a general variable-level scheduling problem and was applied to this specific problem. This heuristic used linear programming and integer programming to find the minimum number of weekly billable hours for five alternative schedules. The best alternative schedule was further developed into a spreadsheet designed, squad level, master schedule. The result of this study was a proposed schedule that would save the United States government 8.2% of their security costs for this one part of the governmental agency. These savings would add up to over $300, 000.00 in a period of one year.

AFIT Designator

AFIT-GOR-ENS-91M-2

DTIC Accession Number

ADA238384

Comments

The author's Vita page is omitted

Download

Share

COinS