Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
| Hi-index | 0.00 |
1 CFFTS trains Air Combat Systems Officers (ACSO) and Airborne Electronic Sensor Operators (AESOp). The operation of the school is stochastic and dynamic in nature and a resource allocation planning tool has been built to simulate the interactions of its various components. For example, it takes into account weather, aircraft reliability, instructor availability and student failure. This presentation gives an overview of the school's operation, describes how it is simulated with a custom built C++ application and shows how the tool has been used to estimate average course duration, to determine what resources are the most significant bottlenecks and to study the effects of changes to parts of the school's operation. The tool was instrumental in showing that one of the offered courses will take much more time to complete than was anticipated and that a small improvement in the availability of the most constraining resource could produce significant benefits.