A Solution Methodology for the Variable-Level Scheduling Problem

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1991
Accession Number
ADA238384

Entities

People

  • Dennis R. Benson

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • C4I
  • Human Systems

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Business Administration
  • Computer Programming
  • Heuristic Methods
  • Integer Programming
  • Linear Programming
  • Literature Surveys
  • Mathematical Models
  • Mathematical Programming
  • Operations Research
  • Personnel Management
  • Scheduling (Production)
  • Standards
  • Systems Engineering
  • United States
  • United States Government

Readers

  • Life Cycle Cost Analysis
  • Operations Research
  • Personnel Management and Statistics in the Military and Department of Defense