Accession Number:

ADA238384

Title:

A Solution Methodology for the Variable-Level Scheduling Problem

Descriptive Note:

Master's thesis

Corporate Author:

AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING

Personal Author(s):

• Benson, Dennis R.

Report Date:

1991-03-01

Pagination or Media Count:

102.0

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.

Descriptors:

• *HEURISTIC METHODS
• *SCHEDULING
• *ALGORITHMS
• LINEAR PROGRAMMING
• INTEGER PROGRAMMING
• SQUAD LEVEL ORGANIZATIONS
• THESES
• COSTS
• SOLUTIONS(GENERAL)
• UNITED STATES GOVERNMENT
• DEPARTMENT OF DEFENSE
• METHODOLOGY
• SECURITY

Subject Categories:

• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE