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

Automating Satellite Range Scheduling, S. Michael Schalck Dec 1993

Automating Satellite Range Scheduling, S. Michael Schalck

Theses and Dissertations

The objective of this study was to develop a computer based satellite range scheduling SRS algorithm to create a 24 hour satellite support schedule. The algorithms goal was to schedule as many satellite support requests as possible. An iterative heuristic approach was used to schedule satellite support requests in three successive sub problems. The first sub problem involves scheduling low altitude satellite support requests using a mixed integer programming approach. The next two sub problems each involve scheduling 12 hour blocks of medium and high altitude satellite support requests, again using a mixed integer programming approach. Fourteen 24 hour schedules …


Crew Scheduling Of Space Operations Squadrons (Sops), Marianne Idzi Nov 1993

Crew Scheduling Of Space Operations Squadrons (Sops), Marianne Idzi

Theses and Dissertations

The mission of Space Operations Squadrons is continuous support of military satellite systems. The scheduling problem associated with conducting continuous operations is threefold. The first problem is finding cyclical crew shift schedules that meet daily manning requirements, adhere to current regulations, contain a minimum number of workshift changes during consecutive duty days, and maximize the non-duty time allowed between duty shifts. The second problem is to establish a sea of criteria to evaluate alternative shift schedules. Finally, the third problem is to minimize the number of personnel required to meet the scheduling requirements stated in the first problem. This study …


Scheduling A Medium-Sized Manufacturing Shop: A Simulation Study, Daniel J. Mcfeely Sep 1993

Scheduling A Medium-Sized Manufacturing Shop: A Simulation Study, Daniel J. Mcfeely

Theses and Dissertations

This study examined the application of simple-to-use, low cost scheduling methods to the operating environment of a medium-sized manufacturing shop. Computer simulation was used to evaluate eighteen different scheduling algorithms, each the result of the combination of a loading and a sequencing rule; due date setting was not considered since due dates are exogenously set. The loading rules investigated were Minimum Machine Required, Lowest Average WIP, and Lowest Average Aggregate Priority Level. The sequencing rules investigated were Priority, EDD, FIS, SPT, Slack, and Slack Ratio. The scheduling algorithms were evaluated against performance measures of mean tardiness, mean flowtime, mean percentage …


Scheduling Air Mobility Command's Channel Cargo Missions, Gregory S. Rau Mar 1993

Scheduling Air Mobility Command's Channel Cargo Missions, Gregory S. Rau

Theses and Dissertations

Through the use of a linear programming model, this research revised the initial schedule for AMC's channel cargo missions to eliminate any excess delay enroute by minimizing the cumulative, weighted time-in-system for all cargo, according to a given cargo flow. In fact, the revised schedule minimizes any assigned nonnegative weighting of the time-in-system, due to the properties of equivalent measures of performance. When combined with Step One of a proposed two-step process for revising AMC's channel mission schedule, this research can be used to improve the current schedule based on Step One's cargo flow. By carefully defining the notation and …


Estimating Test Range Capacity, Paul A. Mcdaniel Mar 1993

Estimating Test Range Capacity, Paul A. Mcdaniel

Theses and Dissertations

The main focus of this thesis effort was to develop a means to estimate the capacity of the test range complex at Eglin AFB, Florida. For the purposes of this study, test range capacity was defined as the maximum number of missions, of a given set, that could possibly be supported by range resources on any given day. In trying to determine this number, the complexities of the overall multi-resource constrained scheduling problem dictated a more practical approach be taken in modeling the allocation process of range resources to test missions. Therefore, a series of three single-resource, 0-1 integer programming …


Optimal Scheduling Of Thermal Generating Units In Electric Power Systems, Narsimha Misra Jan 1993

Optimal Scheduling Of Thermal Generating Units In Electric Power Systems, Narsimha Misra

UNLV Retrospective Theses & Dissertations

The Unit Commitment Problem (UCP) in electric power system problem that consists of finding the startup and shutdown schedule of generating units over a period of time (e.g., 24 hrs) so that the operating cost is minimized; The UCP is often characterized by its prohibitive computational time and memory space requirement. The thesis investigates some computational aspects of the problem in an effort to improve the CPU time as well as the quality of the solution. Two algorithms that show significant improvement over existing methods are presented: One is based on the dynamic programming approach and designed for implementation on …