An Evaluation of Heuristic Scheduling Rules by Using a Zero-One Linear Programming Approach.
Abstract
This study attempted to find some heuristic scheduling rules that would consistently generate good schedules in military aircraft maintenance environments. Heuristic rules considered were those commonly used in the military aircraft field or frequently mentioned in scheduling literature. There was no attempt to study heuristic rules exhaustively. To test heuristic rules, ten aircraft maintenance 'scenarios' were created, based on data collected from the 17th Bombardment Wing (SAC). Constraints imposed in these scenarios were: limited resources, precedence relations between jobs; project and job due dates; and concurrent and nonconcurrent job performance requirements. Each maintenance scenario was modeled, using a zero-one linear programming formulation developed by Alan B. Pritsker, et al. and published in a Rand report. By use of an existing computer code to solve this formulation, the optimum solution of each scenario was found.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1975
- Accession Number
- ADA006348
Entities
People
- Doan Minh
Organizations
- Air Force Institute of Technology