Single-Pass Serial Scheduling Heuristic for Eglin AFB Range Services Division Schedule
Abstract
The Air Armament Center (AAC) located at Eglin Air Force Base (AFB) Florida, conducts test and evaluation of United States Air Force (USAF) weapons systems. To enable this, the AAC operates the Eglin Test and Training Complex (ETTC), the largest test range in the United States. InDyne Corporation's Range Services Division (RSD) builds and maintains the infrastructure necessary to conduct world class test and training on the ETTC. The purpose of this research is to create a scheduling tool for the RSD that maximizes the number of prioritized jobs scheduled and reduces the man-hours required to create a weekly schedule without exceeding a job's deadline, manpower, or equipment constraints. RSD's schedule belongs to a class of scheduling problems called Resource Constrained Project scheduling Problems (RCPSP). RCPSPs attempt to schedule activities of either a known (deterministic) or variable (stochastic) duration in a defined sequence given a finite amount of resources. Many analytical methods have been created to solve these types of scheduling problems. Analytical solution methods which guarantee optimal solutions were not feasible due to the computational complexity of this RCPSP. Instead, a greedy solution method is explored that uses a single-pass serial scheduling algorithm. A schedule construction algorithm is provided in the form of pseudo code to enable further research and development of a scheduling tool for this RCPSP. Research on a schedule improvement metaheuristics and coding of the complete algorithm is required before it can be assimilated into existing scheduling software.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 2009
- Accession Number
- ADA501189
Entities
People
- Matthew Liljenstolpe
Organizations
- Air Force Institute of Technology