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

Engineering Commons

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

Air Force Institute of Technology

Operational Research

Scheduling

Articles 1 - 11 of 11

Full-Text Articles in Engineering

Optimal Scheduling Of Aircraft Test And Evaluation Fleets To Balance Availability For Testing And Training, Sarah E. Hoops Dec 2022

Optimal Scheduling Of Aircraft Test And Evaluation Fleets To Balance Availability For Testing And Training, Sarah E. Hoops

Theses and Dissertations

The 96th Test Wing at Eglin Air Force Base manually schedules a fleet of approximately 26 aircraft to conduct a range of missions over a one-to-two year planning period. This study automates the scheduling process, does so in a manner that optimizes multiple planning goals related to aircraft availability for training, and provides the 96th Test Wing with a software tool for the implementation that can be used by operational analysts within the command. We formulate the scheduling problem as a multiobjective, nonlinear, binary integer math program that seeks to maximize both the lowest percent of time any aircraft is …


Methods To Support The Project Selection Problem With Non-Linear Portfolio Objectives, Time Sensitive Objectives, Time Sensitive Resource Constraints, And Modeling Inadequacies, Neil C. Ranly Sep 2018

Methods To Support The Project Selection Problem With Non-Linear Portfolio Objectives, Time Sensitive Objectives, Time Sensitive Resource Constraints, And Modeling Inadequacies, Neil C. Ranly

Theses and Dissertations

The United States Air Force relies upon information production activities to gain insight regarding uncertainties affecting important system configuration and in-mission task execution decisions. Constrained resources that prevent the fulfillment of every information production request, multiple information requestors holding different temporal-sensitive objectives, non-constant marginal value preferences, and information-product aging factors that affect the value-of-information complicate the management of these activities. This dissertation reviews project selection research related to these issues and presents novel methods to address these complications. Quantitative experimentation results demonstrate these methods’ significance.


The Developmental Test Scheduling Problem, Joseph E. Schoenbeck Mar 2018

The Developmental Test Scheduling Problem, Joseph E. Schoenbeck

Theses and Dissertations

Developmental testing of aircraft systems in the United States Air Force requires a complex set of resources for each test. The optimal scheduling of those resources is the job of the 412th Test Wing at Edwards Air Force Base. With more than 20 different Combined Task Forces requesting resources for roughly 300 flying missions each week, manual scheduling is a difficult task. The current process takes a team of schedulers several days to get a workable result from which they can start tailoring the final schedule. While concepts and techniques can be taken from industry scheduling problems, the body of …


Sortie Generation Simulation Of A Fighter Squadron, Abdurrahman Sevimli Mar 2016

Sortie Generation Simulation Of A Fighter Squadron, Abdurrahman Sevimli

Theses and Dissertations

The Turkish Air Force utilizes several fighter squadrons to enhance its military capabilities. One of the most critical challenges for these squadrons is generating sorties to meet the currency and demand during both peacetime and wartime. This sortie generation process directly affects the success of both training and operations. In this study, this process is assessed using a discrete event simulation. Air Force decision makers require a simulation tool to conduct “what-if” analysis on how potential changes in the environment affect an F-16 fighter squadron’s sortie generation process. Creating a usable simulation provides decision makers with a flexible tool to …


Vehicle Minimization For The Multimodal Pickup And Delivery Problem With Time Windows, Benjamin A . Clapp Mar 2013

Vehicle Minimization For The Multimodal Pickup And Delivery Problem With Time Windows, Benjamin A . Clapp

Theses and Dissertations

The algorithm proposed here is used for heuristic solutions for the Multimodal Multiple Vehicle Routing Problem with Unloading Capacity, Pickup and Dropoff, and Time Windows, solved so as to minimize the number of vehicles used, subject to varying objective function values for each vehicle. The MVRP is simplified and split into a routing problem and a scheduling problem. The routing problem is addressed by Dijkstra's Algorithm. This generates a new network for the second stage of the algorithm. It is assumed that the shortest path is the correct path to use, and shipments each travel unimodally. The scheduling problem is …


Optimization Model For Base-Level Delivery Routes And Crew Scheduling, Young-Ho Cha Mar 2005

Optimization Model For Base-Level Delivery Routes And Crew Scheduling, Young-Ho Cha

Theses and Dissertations

In the U.S. Air Force, a Logistic Readiness Squadron (LRS) provides material management, distribution, and oversight of contingency operations. Dispatchers in the LRS must quickly prepare schedules that meet the needs of their customers while dealing with real-world constraints, such as time windows, delivery priorities, and intermittent recurring missions. Currently, LRS vehicle operation elements are faced with a shortage of manpower and lack an efficient scheduling algorithm and tool. The purpose of this research is to enhance the dispatchers' capability to handle flexible situations and produce "good" schedules within current manpower restrictions. In this research, a new scheduling model and …


A Combined Adaptive Tabu Search And Set Partitioning Approach For The Crew Scheduling Problem With An Air Tanker Crew Application, Todd E. Combs Aug 2002

A Combined Adaptive Tabu Search And Set Partitioning Approach For The Crew Scheduling Problem With An Air Tanker Crew Application, Todd E. Combs

Theses and Dissertations

This research develops the first metaheuristic approach to the complete air crew scheduling problem. It develops the first dynamic, integrated, set-partitioning based vocabulary scheme for metaheuristic search. Since no benchmark flight schedules exist for the tanker crew scheduling problem, this research defines and develops a Java™ based flight schedule generator. The robustness of the tabu search algorithms is judged by testing them using designed experiments. An integer program is developed to calculate lower bounds for the tanker crew scheduling problem objectives and to measure the overall quality of solutions produced by the developed algorithms.


A Value Focused Thinking Approach To Academic Course Scheduling, Shane A. Knighton Mar 1998

A Value Focused Thinking Approach To Academic Course Scheduling, Shane A. Knighton

Theses and Dissertations

In 1997, the School of Engineering of the United States Air Force Institute of Technology began exploring ways of automating the academic course scheduling process. The administration desired an expedient approach for course scheduling which supports the institute's mission of "providing scientific and technological education" to officers from all branches of military service, as well as international military forces. The scheduling approach needed to be flexible, efficient, and represent the institute's values and principles. Decision Analysis (DA) and specifically, Value Focused Thinking (VFT), is used to decompose the complex problem of academic course scheduling and determine the factors that are …


Scheduling And Sequencing Arrivals To A Stochastic Service System, Peter M. Vanden Bosch Nov 1997

Scheduling And Sequencing Arrivals To A Stochastic Service System, Peter M. Vanden Bosch

Theses and Dissertations

Optimization of scheduled arrival times to an appointment system is approached from the perspectives of both queueing and scheduling theory. The appointment system is modeled as a one-server, first-come-first-served, transient queue with independent, distinctly distributed service times and no-show rates. If a customer does show, it is assumed to be punctual. The cost of operating the appointment system is a convex combination of customers' waiting times and the server's overtime. While techniques for finding the optimal static and dynamic schedules of arrivals have been proposed by other researchers, they mainly have focused on identical customers and strictly punctual arrivals. This …


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 …


An Improved Heuristic For Intercontinental Ballistic Missile Crew Scheduling, Michael D. Shirley Jr. Dec 1994

An Improved Heuristic For Intercontinental Ballistic Missile Crew Scheduling, Michael D. Shirley Jr.

Theses and Dissertations

Creating monthly schedules for missile crews is a complex and time-consuming problem. Thousands of events must be scheduled for several hundred missile officers. The rules and regulations governing the problem are numerous, and there are currently no established measures for missile crew schedules. The scheduling software currently available only schedules a fraction of the events. The objectives of this research were to create a rule-based heuristic which could quickly produce feasible or near-feasible schedules, to make the scheduling process paperless, and to develop possible measures of effectiveness for missile crew schedules. The research was successful in each of these areas. …