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

Engineering Commons

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

Articles 1 - 4 of 4

Full-Text Articles in Engineering

A Methodology To Design Pipelined Simulated Annealing Kernel Accelerators On Space-Borne Field-Programmable Gate Arrays, Jeffrey Michael Carver May 2009

A Methodology To Design Pipelined Simulated Annealing Kernel Accelerators On Space-Borne Field-Programmable Gate Arrays, Jeffrey Michael Carver

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Increased levels of science objectives expected from spacecraft systems necessitate the ability to carry out fast on-board autonomous mission planning and scheduling. Heterogeneous radiation-hardened Field Programmable Gate Arrays (FPGAs) with embedded multiplier and memory modules are well suited to support the acceleration of scheduling algorithms. A methodology to design circuits specifically to accelerate Simulated Annealing Kernels (SAKs) in event scheduling algorithms is shown. The main contribution of this thesis is the low complexity scoring calculation used for the heuristic mapping algorithm used to balance resource allocation across a coarse-grained pipelined data-path. The methodology was exercised over various kernels with different …


Project Scheduling To Maximize Positive Impacts Of Reconstruction Operations, Andrew D. Chaney Mar 2009

Project Scheduling To Maximize Positive Impacts Of Reconstruction Operations, Andrew D. Chaney

Theses and Dissertations

Since the decline of the Cold War, the risk of major conflict between powerful industrialized nations has significantly decreased. Insecurity in the twenty-first century is forecast to arise rather from the debris of imploding states. Such situations may require intervention | military or otherwise | by concerned states, and the frequency with which these interventions occur is increasing. To meet this new operational challenge, the US military must adapt its planning procedures to account for Security, Stabilization, Transition, and Reconstruction Operations (SSTRO). This research develops a project scheduling based framework for post-conflict reconstruction that prioritizes and schedules reconstruction activities in …


A Location Analysis Approach For Military Maintenance Scheduling With Geographically Dispersed Service Areas, Dale L. Overholts Ii, John E. Bell, Marvin A. Arostegui Jan 2009

A Location Analysis Approach For Military Maintenance Scheduling With Geographically Dispersed Service Areas, Dale L. Overholts Ii, John E. Bell, Marvin A. Arostegui

U.S. Air Force Research

This research uses a two-stage maximal covering location problem (MCLP) model to develop Intercontinental ballistic missile (ICBM) maintenance schedules for the US Air Force. Solutions are compared to actual missile maintenance activities accomplished at F. E. Warren Air Force Base (AFB), Wyoming in May 2005. Sensitivity analysis is performed to determine the impact of altering security response times and the number of security patrol are as on the quality of daily maintenance schedules and personnel usage. Results indicate marked improvement over traditional Air Force scheduling methods. In addition, sensitivity analysis identifies the levels at which the quality and quantity of …


An Algorithm To Solve The Associative Parallel Machine Scheduling Problem, Mohannad Abdelrahman Shuaib Jan 2009

An Algorithm To Solve The Associative Parallel Machine Scheduling Problem, Mohannad Abdelrahman Shuaib

University of Kentucky Master's Theses

Effective production scheduling is essential for improved performance. Scheduling strategies for various shop configurations and performance criteria have been widely studied. Scheduling in parallel machines (PM) is one among the many scheduling problems that has received considerable attention in the literature. An even more complex scheduling problem arises when there are several PM families and jobs are capable of being processed in more than one such family. This research addresses such a situation, which is defined as an Associative Parallel Machine scheduling (APMS) problem. This research presents the SAPT-II algorithm that solves a highly constrained APMS problem with the objective …