Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Entire DC Network

The Capacity Of The Air Force Satellite Control Network, Kwangho Jang Dec 1996

The Capacity Of The Air Force Satellite Control Network, Kwangho Jang

Theses and Dissertations

The daily mission objective of the Air Force Satellite Control Network (AFSCN) is to support communication with satellite systems. It is critical that the AFSCN operate 24 hours a day, seven days a week. Previous work on the satellite range scheduling problem has successfully scheduled over 90 percent of the satellite support requests. This research investigates the capacity of the AFSCN using an available satellite scheduling algorithm. This research has three objectives. The first objective is to be able to generate sample data sets which represent a day of satellite support requests for low, medium, and high altitude satellites. The …


Crisis Airlift Management: Effective Scheduling, David C. Penny Sep 1996

Crisis Airlift Management: Effective Scheduling, David C. Penny

Theses and Dissertations

This is a report on the basis, data, findings, and models developed for US Transportation Command and Headquarters Air Mobility Command. Focusing on the dynamic scheduling problem that arises during management of airlift assets into space-constrained airfields during a crisis, this research explains the conditions surrounding this event, discusses several areas of potential cross-functional applications, presents analysis of current performance, and provides several modeling possibilities for schedule efficiency. Past research in the Flow Management Problem (an airline flow control issue) is extensive, but specific applications in crisis airlift are long in coming, primarily due to the complexity of the environment. …


Scalability In Real-Time Systems, Ramesh Yerraballi Jul 1996

Scalability In Real-Time Systems, Ramesh Yerraballi

Computer Science Theses & Dissertations

The number and complexity of applications that run in real-time environments have posed demanding requirements on the part of the real-time system designer. It has now become important to accommodate the application complexity at early stages of the design cycle. Further, the stringent demands to guarantee task deadlines (particularly in a hard real-time environment, which is the assumed environment in this thesis) have motivated both practioners and researchers to look at ways to analyze systems prior to run-time. This thesis reports a new perspective to analyzing real-time systems that in addition to ascertaining the ability of a system to meet …


Development Of A Critical Path Method Specification And A Training Program For Use Of Cpm And Ktc, James D. Stevens, Donn E. Hancher, Ihab M. Hamdi Jun 1996

Development Of A Critical Path Method Specification And A Training Program For Use Of Cpm And Ktc, James D. Stevens, Donn E. Hancher, Ihab M. Hamdi

Kentucky Transportation Center Research Report

The Critical Path Method is a proven management technique used for determining the critical activities that would need additional care in any type of construction projects. The KTC requires that CPM schedules be used on selected highway projects. This research project offers a detailed idea on CPM scheduling application in highway construction projects, as well as current practices in other departments of transportation nationwide, together with specifications for proper application of CPM scheduling.


Procedures For Testing Deterministic Scheduling Models: A Dakota Case Study, Keith H. Mccready Mar 1996

Procedures For Testing Deterministic Scheduling Models: A Dakota Case Study, Keith H. Mccready

Theses and Dissertations

The DAKOTA scheduling system has been proposed for use in the United States Air Forces Europe's (USAFE's) Operational Support Airlift (OSA) scheduling. This thesis examines the OSA scheduling topic and reviews the relevant literature on vehicle routing, concluding that exact methods are intractable for large problem sizes. Consequently, heuristic methods must be considered. This thesis takes a detailed look at the DAKOTA heuristic. It examines the concepts of Validation, Verification and Accreditation (VV&A), particularly as they apply to heuristics and algorithms. It then defines what measures of performance may prove useful in judging heuristics and algorithms in general, and details …


Security-Constrained Optimal Rescheduling Of Real Power Using Hopfield Neural Network, S. Ghosh, Badrul H. Chowdhury Jan 1996

Security-Constrained Optimal Rescheduling Of Real Power Using Hopfield Neural Network, S. Ghosh, Badrul H. Chowdhury

Electrical and Computer Engineering Faculty Research & Creative Works

A new method for security-constrained corrective rescheduling of real power using the Hopfield neural network is presented. The proposed method is based on solution of a set of differential equations obtained from transformation of an energy function. Results from this work are compared with the results from a method based on dual linear programming formulation of the optimal corrective rescheduling. The minimum deviations in real power generations and loads at buses are combined to form the objective function for optimization. Inclusion of inequality constraints on active line flow limits and equality constraint on real power generation load balance assures a …