Miniature Membrane Inlet Gas Chromatography for Cone Penetrometers

Not Available Scheduling of the Air Force Satellite Control Network (AFSCN) is key to its effective utilization. As demands increase and resources decrease, scheduling must become more efficient. Current AFSCN scheduling is manpower intensive and complicated. Since this process is mainly a manual one, it can take a new scheduler months to become fully trained. Computer automation and optimization of the process will improve efficiency by reducing the labor needed to prepare the schedules. Computerized scheduling could also find opportunities in those cases where emergencies or other anomalies require that the schedule be reworked quickly. In order for a computerized system to replace the current method, its algorithms must be both fast and accurate, and its solutions must be as good or better than those produced by the present system. The AFSCN scheduling problem is characterized by multiple objectives, priorities, resource allocations, and constraints. This proposal will describe several algorithms that will address the scheduling problem from a generalized standpoint. These algorithms, once developed during Phase I, could be applied to a broad range of scheduling problems, including that of the AFSCN. Any solution to the AFSCN problem could be a candidate to many other scheduling problems found in today's world.