Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedules”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Multi-Size Proppant Pumping Schedule of Hydraulic Fracturing: Application to a MP-PIC Model of Unconventional Reservoir for Enhanced Gas Production

Slickwater hydraulic fracturing is becoming a prevalent approach to economically recovering shale hydrocarbon. It is very important to understand the proppant’s transport behavior during slickwater hydraulic fracturing treatment for effective creation of a desired propped fracture geometry. The currently available models are either oversimplified or have been performed at limited length scales to avoid high computational requirements. Another limitation is that the currently available hydraulic fracturing simulators are developed using only single-sized proppant particles. Motivated by this, in this work, a computationally efficient, three-dimensional, multiphase particle-in-cell (MP-PIC) model was employed to simulate the multi-size proppant transport in a field-scale geometry using the Eulerian–Lagrangian framework. Instead of tracking each particle, groups of particles (called parcels) are tracked, which allows one to simulate the proppant transport in field-scale geometries at an affordable computational cost. Then, we found from our sensitivity study that pumping schedules significantly affect propped fracture surface area and average fracture conductivity, thereby influencing shale gas production. Motivated by these results, we propose an optimization framework using the MP-PIC model to design the multi-size proppant pumping schedule that maximizes shale gas production from unconventional reservoirs for given fracturing resources.

42 ENGINEERING↗
NASA NTRS2005

Automating Deep Space Network scheduling and conflict resolution

The Deep Space Network (DSN) is a central part of NASA's infrastructure for communicating with active space missions, from earth orbit to beyond the solar system. We describe our recent work in modeling the complexities of user requirements, and then scheduling and resolving conflicts on that basis. We emphasize our innovative use of background 'intelligent' assistants' that carry out search asynchrnously while the user is focusing on various aspects of the schedule.

conflict resolution↗
NASA NTRS2002

The JPL Resource Allocation Planning and Scheduling Office (RAPSO) process

The Jet Propulsion Laboratory's Resource Allocation Planning and Scheduling Office is chartered to divide the limited amount of tracking hours of the Deep Space Network amongst the various missions in as equitable allotment as can be achieved. To best deal with this division of assets and time, an interactive process has evolved that promotes discussion with agreement by consensus between all of the customers that use the Deep Space Network (DSN). Aided by a suite of tools, the task of division of asset time is then performed in three stages of granularity. Using this approach, DSN loads are either forecasted or scheduled throughout a moving 10-year window.

RAPSO Resource Allocation Planning and Scheduling ↗
NASA NTRS2005

Automated Planning and Scheduling for Space Mission Operations

Research Trends: a) Finite-capacity scheduling under more complex constraints and increased problem dimensionality (subcontracting, overtime, lot splitting, inventory, etc.) b) Integrated planning and scheduling. c) Mixed-initiative frameworks. d) Management of uncertainty (proactive and reactive). e) Autonomous agent architectures and distributed production management. e) Integration of machine learning capabilities. f) Wider scope of applications: 1) analysis of supplier/buyer protocols & tradeoffs; 2) integration of strategic & tactical decision-making; and 3) enterprise integration.

scheduling↗
NASA NTRS2012

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

Mixed Integer Programming↗
NASA NTRS2013

Estimation of Airline Benefits from Avionics Upgrade under Preferential Merge Re-sequence Scheduling

Modernization of the airline fleet avionics is essential to fully enable future technologies and procedures for increasing national airspace system capacity. However in the current national airspace system, system-wide benefits gained by avionics upgrade are not fully directed to aircraft/airlines that upgrade, resulting in slow fleet modernization rate. Preferential merge re-sequence scheduling is a best-equipped-best-served concept designed to incentivize avionics upgrade among airlines by allowing aircraft with new avionics (high-equipped) to be re-sequenced ahead of aircraft without the upgrades (low-equipped) at enroute merge waypoints. The goal of this study is to investigate the potential benefits gained or lost by airlines under a high or low-equipped fleet scenario if preferential merge resequence scheduling is implemented.

air traffic management↗
NASA NTRS2011

Runway Scheduling Using Generalized Dynamic Programming

A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.

optmization↗
NASA NTRS2016

Historical Mass, Power, Schedule, and Cost Growth for NASA Spacecraft

Although spacecraft developers have been moving towards standardized product lines as the aerospace industry has matured, NASA's continual need to push the cutting edge of science to accomplish unique, challenging missions can still lead to spacecraft resource growth over time. This paper assesses historical mass, power, cost, and schedule growth for multiple NASA spacecraft from the last twenty years and compares to industry reserve guidelines to understand where the guidelines may fall short. Growth is assessed from project start to launch, from the time of the preliminary design review (PDR) to launch and from the time of the critical design review (CDR) to launch. Data is also assessed not just at the spacecraft bus level, but also at the subsystem level wherever possible, to help obtain further insight into possible drivers of growth. Potential recommendations to minimize spacecraft mass, power, cost, and schedule growth for future missions are also discussed.

Schedule↗
NASA NTRS2018

Increasing Human Spaceflight Capabilities: Demonstration of Crew Autonomy Through Self-Scheduling Onboard International Space Station

For the first time in a spaceflight operational environment, our team enabled an ISS (International Space Station) crewmember to plan, reschedule, and execute their activities in real-time while abiding by flight and scheduling constraints. The Crew Autonomous Scheduling Test (CAST) investigated the novel concept of operations: allowing crew to manage their own timeline.

crew autonomy↗
NASA NTRS2015

Integration of Uncertain Ramp Area Aircraft Trajectories and Generation of Optimal Taxiway Schedules at Charlotte Douglas (CLT) Airport

The integration of aircraft maneuver characteristics into an optimal taxiway scheduling solution is challenging due to the uncertainties that are intrinsic to ramp area aircraft trajectories. To address the challenge, we build a stochastic model of ramp area aircraft trajectories that is used to generate a probabilistic measure of conflict within the Charlotte Douglas International Airport (CLT) ramp area. Parameters of the conflict distributions are estimated and passed to a Mixed Integer Linear Program that solves for an optimal taxiway schedule constrained to be conflict free in the presence of trajectory uncertainties. Here we extend our previous research by accounting for departing and arriving aircraft whereas our prior formulation only accounted for departing aircraft.

taxiway schedule↗
NASA NTRS2019

Alternatives for Scheduling Departures for Efficient Surface Metering in ATD-2: Exploration in a Human-in-the-Loop Simulation

Human-in-the-Loop (HITL) simulation was conducted to explore the impacts of various surface metering goals on operations and Ramp Controllers at Charlotte Douglas International Airport (CLT). Three conditions were compared: Baseline, with no surface metering, instructions to meet advisory times at the gate only, and instructions to meet advisory times at the gate as well as the times at the scheduled taxiway spot, where aircraft are delivered to Air Traffic Control (ATC). Results showed increased compliance for taxiway spot times when compliance was first met for gate advisories. Instructing Ramp Controllers to meet advisory times at the gate improves spot time compliance and therefore surface scheduling predictability at CLT. Results also demonstrated there was increased compliance overall with gate and spot times in the second condition. This was likely due to higher Ramp Controller workload in the third condition.

Airport surface scheduling↗
NASA NTRS2020

ATD-2 Phase 3 Scheduling in a Metroplex Environment Incorporating Trajectory Option Sets

The NASA Airspace Technology Demonstration 2 Phase 1 and 2 Field Evaluations have successfully demonstrated new technologies developed to manage the Integrated Arrival, Departure, and Surface traffic flows at a single airport. The Phase 3 Field Evaluation extends the capabilities to a Metroplex environment where multiple airports are interacting and sharing resources along the terminal boundary. This paper describes the scheduling algorithm enabling the coordinated scheduling and describes the interaction between airports within the Metroplex and the terminal boundary. We describe the metrics developed to inform flight operators about reroute opportunities and discuss the potential benefits to the rerouted flight and the system-wide aggregate benefits of a single reroute. We believe that the capabilities developed and the lessons learned during the Phase 3 Field Evaluation will set up the National Airspace System for future success.

Airspace Technology Demonstration 2↗
NASA NTRS2021

Progress in Scheduling Algorithms for a Collaborative Distributed System for Flight Planning

This Technical Memorandum describes four contributions made by the authors to a larger team effort toward developing a distributed system for scheduling commercial flights at navigation fixes and/or airport runways. These contributions are as follows: (1) a proof of correctness for a scheduling algorithm published previously by Meyn, (2) an improvement of Meyn's algorithm from quadratic to linear time, (3) two independent implementations of the algorithm with test results identical to those published, and (4) an extension of Meyn's algorithm to support minimum usable time intervals.

arrival scheduling↗
NASA NTRSDate not supplied

EVM and Schedule Management

The objective of EVMS surveillance is to ensure that the management control processes that support the performance measurement baseline (PMB) are in place, compliant with the EVMS guidelines, are routinely being used, and provide timely and reliable data. The PMB is a triple constraint where the constraints are schedule, budget and scope. For Surveillance, NASA uses the DCMA EVM Compliance Metrics (DECM) Tests that are aligned with the EIA-748 EVM Standard. Guidelines 6 is Scheduling Work, and DECM has 23 Tests for evaluating if the IMS supports project goals in its planning, statusing and forecasting. This session will focus on the Test Metric that analyzes forecast start/finish dates riding the status date of the IMS for two or more consecutive months as an example of how surveillance works in concert with IMS health checks. It will cover how to run the test to recognize trends and how this test helps ensure that the forecast is credible in support of critical path analysis.

EVM↗
NASA NTRS2023

Framework for Extensible, Asynchronous Task Scheduling (FEATS) in Fortran

Most parallel scientific programs contain compiler directives (pragmas) such as those from OpenMP, explicit calls to runtime library procedures such as those implementing the Message Passing Interface (MPI), or compiler-specific language extensions such as those provided by CUDA. By contrast, the recent Fortran standards empower developers to express parallel algorithms without directly referencing lower-level parallel programming models. Fortran’s parallel features place the language within the Partitioned Global Address Space (PGAS) class of programming models. When writing programs that exploit data-parallelism, application developers often find it straightforward to develop custom parallel algorithms. Problems involving complex, heterogeneous, staged calculations, however, pose much greater challenges. Such applications require careful coordination of tasks in a manner that respects dependencies prescribed by a directed acyclic graph. When rolling one’s own solution proves difficult, extending a customizable framework becomes attractive. The paper presents the design, implementation, and use of the Framework for Extensible Asynchronous Task Scheduling (FEATS), which we believe to be the first task-scheduling tool written in modern Fortran. We describe the benefits and compromises associated with choosing Fortran as the implementation language, and we propose ways in which future Fortran standards can best support the use case in this paper.

Modern Fortran↗
NASA NTRSDate not supplied

Aerial Vehicle Routing and Scheduling for UAS Traffic Management: A Hybrid Monte Carlo Tree Search Approach

We present the Multi-Route Weighted Package Delivery Problem (MRWPDP) and a scalable solution methodology as a major step towards enabling an airspace deconfliction service for drone delivery operations. The problem is motivated by Strategic deconfliction under the FAA’s “Unmanned Aircraft Systems Traffic Management” Concept of Operations. MRWPDP falls under a class of vehicle routing and scheduling problems, and as such is NP-Hard. In MRWPDP, a graph network is given which consists of depots, drop-off sites, and multiple routes connecting the two. In addition, routes are weighted by the associated ground risk and total travel distance for package delivery. The goal is to optimally schedule the departure time and assign routes to a known set of vehicles at the depot. We propose a heuristic solution to the problem by borrowing techniques from Mixed Integer Linear Programming (MILP), Constraint Programming, and Monte Carlo Tree Search (MCTS). The resulting hybrid framework is MCTS with Bound-and-Prune (BP) and rapid simulated updates (U), or MCTS-BP-U. This approach is able to quickly provide a feasible solution for MRWPDP, even for large problem instances up to 1000 vehicles. We provide a MILP formulation of MRWPDP and compare its performance against MCTS-BP-U in terms of solution quality. An agent-based model simulation is conducted as a final step to validate the efficacy of our approach.

air traffic scheduling↗