Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scheduling”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS2021

Simulation Study for Interoperability of Urban Air Mobility Scheduling and Separation Services in Ideal Conditions

Provision of strategic scheduling and tactical separation services is vital to the safe and efficient operation of vehicles in the urban airspace. This paper describes the efforts made towards the integration of two such services in a simulation environment under ideal conditions and the subsequent studies done on evaluation of system performance. The scheduling and separation services are set up to complement each other to ensure safe separation between airborne aircraft. The utility of these services will become important as the level of traffic increases. This paper describes the simulation experiments conducted to identify cases where the system performance measured by the number of observed losses of separation degrades even with the scheduling and separation services active. From the results obtained, we identify conditions under which the required maneuvers increase and when we observe airborne conflicts even with separation service active. Results obtained will inform requirements for future advancements both in these services independently and in their joint operations.

Urban Air Mobility↗
NASA NTRSDate not supplied

Simulation Study for Interoperability of Urban Air Mobility Scheduling and Separation Services in Ideal Conditions

Provision of strategic scheduling and tactical separation services is vital to the safe and efficient operation of vehicles in the urban airspace. This paper describes the efforts made towards the integration of two such services in a simulation environment under ideal conditions and the subsequent studies done on evaluation of system performance. The scheduling and separation services are set up to complement each other to ensure safe separation between airborne aircraft. The utility of these services will become important as the level of traffic increases. This paper describes the simulation experiments conducted to identify cases where the system performance measured by the number of observed losses of separation degrades even with the scheduling and separation services active. From the results obtained, we identify conditions under which the required maneuvers increase and when we observe airborne conflicts even with separation service active. Results obtained will inform requirements for future advancements both in these services independently and in their joint operations.

Urban Air Mobility↗
NASA NTRSDate not supplied

Separation Assurance in Urban Air Mobility Systems Using Shared Scheduling Protocols

Ensuring safe separation between aircraft is a critical challenge in air traffic management, particularly in urban air mobility (UAM) environments where high traffic density and low altitudes require precise control. In these environments, conflicts often arise at the intersections of flight corridors, posing significant risks. We propose a tactical separation approach leveraging shared scheduling protocols, originally designed for Ethernet networks and operating systems, to coordinate access to these intersections. Using a decentralized Markov decision process framework, the proposed approach enables aircraft to autonomously adjust their speed and timing as they navigate these critical areas, maintaining safe separation without a central controller. We evaluate the effectiveness of this approach in simulated UAM scenarios, demonstrating its ability to reduce separation violations to zero while acknowledging trade-offs in flight times as traffic density increases. Additionally, we explore the impact of non-compliant aircraft, showing that while shared scheduling protocols can no longer guarantee safe separation, they still provide significant improvements over systems without scheduling protocols.

Separation Assurance↗
NASA NTRSDate not supplied

Separation Assurance in Urban Air Mobility Systems Using Shared Scheduling Protocols

Ensuring safe separation between aircraft is a critical challenge in air traffic management, particularly in urban air mobility (UAM) environments where high traffic density and low altitudes require precise control. In these environments, conflicts often arise at the intersections of flight corridors, posing significant risks. We propose a tactical separation approach leveraging shared scheduling protocols, originally designed for Ethernet networks and operating systems, to coordinate access to these intersections. Using a decentralized Markov decision process framework, the proposed approach enables aircraft to autonomously adjust their speed and timing as they navigate these critical areas, maintaining safe separation without a central controller. We evaluate the effectiveness of this approach in simulated UAM scenarios, demonstrating its ability to reduce separation violations to zero while acknowledging trade-offs in flight times as traffic density increases. Additionally, we explore the impact of non-compliant aircraft, showing that while shared scheduling protocols can no longer guarantee safe separation, they still provide significant improvements over systems without scheduling protocols.

system safety↗
DOE OSTI2025

Energy Scheduling-based Operating Envelopes including a Distribution System Branch Screening Algorithm

This paper presents an energy scheduling-based formulation for computing operating envelopes including a distribution branch screening algorithm, termed DBS-ES. The contribution of the paper is two-fold: firstly, it presents an innovative methodology for calculating operating envelopes using energy scheduling (baseline), and secondly, it enhances this methodology by incorporating a custom distribution branch screening algorithm (DBS-ES). The custom algorithm leverages power system knowledge to reduce both model build time and total processing time while maintaining the same scheduling results as the baseline. The effectiveness of the proposed approach is demonstrated through experiments on the IEEE13, IEEE123, and EPRI Secondary test feeders. Results highlight a 24.5% decrease in model build time and an 8.17% decrease in total processing time when using DBS-ES compared to the baseline, specifically for the IEEE123 test feeder. Additionally, the paper briefly discusses the influence of utility-controlled storage on computing operating envelopes, noting a general incre

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Leveraging Pre-Built Catalogs and Object-Level Scheduling to Eliminate I/O Bottlenecks in HPC Environments

Modern High-Performance Computing (HPC) environments face mounting challenges due to the shift from large to small file datasets, along with an increasing number of users and parallelized applications. As HPC systems rely on Parallel File Systems (PFS), such as Lustre for data processing, performance bottlenecks stemming from Object Storage Target (OST) contention have become a significant concern. Existing solutions, such as LADS with its object-level scheduling approach, fall short in large-scale HPC environments due to their inability to effectively address metadata I/O bottlenecks and the growing number of I/O processes. This study highlights the pressing need for a comprehensive solution that tackles both OST contention and metadata I/O challenges in diverse HPC workloads. To address these challenges, we propose SwiftLoad, an object-level I/O scheduling framework that leverages a metadata catalog to enhance the performance and efficiency of parallel HPC utilities. The adoption of the metadata catalog mitigates the metadata I/O bottlenecks that commonly occur in HPC utilities, a challenge that is particularly pronounced in object-level I/O scheduling. SwiftLoad addresses OST contention and the uneven distribution of I/O processes across different OSTs through mathematical modeling and incorporates a Loader Configuration Module to regulate the number of I/O processes. Evaluated with two representative utilities—data deduplication profiling and data augmentation—SwiftLoad achieved performance improvements of up to 5.63x and 11.0x, respectively, on a production supercomputer.

HPC↗
DOE OSTI2025

Adaptive PID Gain Scheduling Control for Hydropower Turbine Using Neural CDE and Stochastic Distribution Shaping

This paper introduces a gain-scheduling PID controller design strategy for hydroturbine frequency control mode. This scheme first uses real data to learn the nonlinear dynamics of the hydroturbine using neural controlled differential equations and then perturbs the obtained nonlinear system at different equilibrium points, based on which a static output feedback adaptive dynamic programming algorithm is then used to optimize the PID gains for each equilibrium point. Moreover, a continuous-time version of stochastic distribution control is proposed to further fine-tune the optimized PID gains. Finally, the controller is obtained by implementing linear interpolation between the optimized PID control gains. The simulation results show that the proposed gain-scheduling PID controller can control a larger range of operation points compared with the given fixed PID controller and the baseline method. Compared with the given fixed PID controller, the proposed gain-scheduling PID controller can regulate hydroturbine frequency against disturbances induced by power-load variation with over 50% less overshoot for some operation points.

13 HYDRO ENERGY↗
DOE OSTI2024

IRIS-GNN: Leveraging Graph Neural Networks for Scheduling on Truly Heterogeneous Runtime Systems

The diversity of accelerators in computer systems poses significant challenges for software developers, such as managing vendor-specific compiler toolchains, code fragmentation requiring different kernel implementations, and performance portability issues. To address these, the Intelligent Runtime System (IRIS) was developed. IRIS works across various systems, from smartphones to supercomputers, enabling automatic performance scaling based on available accelerators. It introduces abstract tasks for seamless execution transitions between accelerators while ensuring memory consistency and task dependencies. Although IRIS simplifies system details, optimal dynamic scheduling still requires user input to understand workload structures. To address this, we introduce a new scheduling policy for IRIS, termed IRIS-GNN, which is the first IRIS hybrid policy that operates in conjunction with the dynamic policies. This policy employs a Graph-Neural Network (GNN) to conduct Graph Classification of any task graphs submitted to IRIS. This GNN analyzes the structure and attributes of the task graph, categorizing it as either locality, concurrency, or mixed. This classification subsequently guides the selection of the dynamic policy used by IRIS. We provide a comparison of the performance of IRIS-GNN against the complete spectrum of IRIS’s dynamic policies, assess the overhead introduced by the GNN within this scheduling framework, and ultimately explore its practical application in real-world scenarios.

Johnston, Beau↗
DOE OSTI2025

Flexible Resource Scheduler for FAST-DERMS (FRS-FASTDERMS) v0.9

The Flexible Resource Scheduler is a hierarchical controller that manages the distributed energy resources in a distribution substation or distribution feeder to provide a firm commitment of power flow at the substation or feeder head to be scheduled in transmission-level markets as an aggregated demand resource. It is the reference controller for the FAST-DERMS Architecture, developed in tandem with the architecture under the DOE FAST-DERMS project. It is comprised of a day-ahead stochastic optimization, which schedules substation power flow and reserves, a intra-hour MPC, which generates dispatch base points for DER, and a real-time PID controller maintaining that dispatches DER to maintain the substation power around the base points. The repository also includes a representative aggregator controller, and all of the necessary components to run a simulation using PNNL's GridAPPS-D software with the controller.

MacDonald, Jason [Lawrence Berkeley National Labor↗
DOE OSTI2026

Scheduler Modeling of Distributed Energy Resources for Providing Ancillary Services

Distribution energy resources (DERs) have been integral components of modern power systems, and their capability to provide grid services has been widely studied. To promote the deployment of these resources in providing grid services in real-world utility operations, this paper proposes a day-ahead scheduler model for a distribution system connected DER plant. A certain amount of generation capacity of this DER plant is reserved for frequency services, and some ancillary services for the distribution system-including peak load reduction, voltage regulation, and power factor control-are integrated into the model. The model is tested on a real-world distribution system. From the simulation results, the energy and reserve schedule of the solar photovoltaic (PV) unit and battery energy storage system (BESS) can be determined, and voltage and power factor are well maintained. Additionally, in order to demonstrate the specific characteristics of the co-located and hybrid operation modes for the PV and BESS, these two modes are analyzed both theoretically and through real-time simulation. Simulation results show that most of PV's variability is transferred to the net power in the co-located mode, whereas it is transferred to the BESS in the hybrid mode. This proposed scheduler model and the comparison of co-located and hybrid modes can provide practical guidance for the applications of DER plant in the real-world utility.

14 SOLAR ENERGY↗
DOE OSTI2024

Adaptive Framework for Maintenance Scheduling Based on Dynamic Preventive Intervals and Remaining Useful Life Estimation

Data-based prognostic methods exploit sensor data to forecast the remaining useful life (RUL) of industrial settings to optimize the scheduling of maintenance actions. However, implementing sensors may not be cost-effective or practical for all components. Traditional preventive approaches are not based on sensor data; however, they schedule maintenance at equally spaced intervals, which is not a cost-effective approach since the distribution of the time between failures changes with the degradation state of other parts or changes in working conditions. This study introduces a novel framework comprising two maintenance scheduling strategies. In the absence of sensor data, we propose a novel dynamic preventive policy that adjusts intervention intervals based on the most recent failure data. When sensor data are available, a method for RUL prediction, designated k-LSTM-GFT, is enhanced to dynamically account for RUL prediction uncertainty. The results demonstrate that dynamic preventive maintenance can yield cost reductions of up to 51.8% compared to conventional approaches. The predictive approach optimizes the exploitation of RUL, achieving costs that are only 3–5% higher than the minimum cost achievable while ensuring the safety of critical systems since all of the failures are avoided.

Nunes, Pedro (ORCID:0000000180012172)↗
NASA NTRS1971

DSIF station schedules

System manages Deep Space Instrumentation Facilities /DSIF/ equipment construction and modification planning. Versatile program applies to such tasks as employee time and task schedules, pay schedules, operations schedules, and plant and equipment procurement, construction, modification or service.

Flarity, L. D.↗
NASA NTRS1972

STADAN and data relay satellite simulation (emphasis on the scheduler)

A set of computer programs was developed which can be used to simulate the operation of NASA's Satellite Tracking and Data Acquisition Network (STADAN). The simulation consists of two major modules, a computerized algorithmic satellite scheduler (CASS) and a generalized evaluation model simulator (GEMS). CASS generates in-view time intervals of satellites over ground stations, and using these candidate passes, produces a schedule of service times for specific satellites to be serviced by specific ground stations in an attempt to fulfill certain inputted service requirements. GEMS than examines how well STADAN fulfills this schedule in terms of the availability and dependability of different (inputted) complements of equipment at the ground stations. The simulation was modified to allow for the introduction of one or more tracking and data relay satellites, which can serve as orbital receiving and command stations.

Kerne, B.↗
NASA NTRS1973

Scheduling algorithms for multiprogramming in a hard-real-time environment.

The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadlines. A combination of these two scheduling techniques is also discussed.

Liu, C. L.↗
NASA NTRS1977

Study of the impact of cruise speed on scheduling and productivity of commercial transport aircraft

A comparison is made between airplane productivity and utilization levels derived from commercial airline type schedules which were developed for two subsonic and four supersonic cruise speed aircraft. The cruise speed component is the only difference between the schedules which are based on 1995 passenger demand forecasts. Productivity-to-speed relationships were determined for the three discrete route systems: North Atlantic, Trans-Pacific, and North-South America. Selected combinations of these route systems were also studied. Other areas affecting the productivity-to-speed relationship such as aircraft design range and scheduled turn time were examined.

Bond, E. Q.↗
NASA NTRS1983

Time scheduling of a mix of 4D equipped and unequipped aircraft

In planning for a future automated air traffic system, it is necessary to confront the transition situation in which some percentage of the traffic must be handled by conventional means. A safe, efficient transition system is needed since initially not all aircraft will be able to respond to a more automated system. The specific problem addressed was that of time scheduling a mix of 4D-equipped aircraft (aircraft that can accurately meet a controller specified time schedule at selected way points in the terminal area) when operating in conjunction with unequipped aircraft (aircraft that require air traffic handling by means of standard vectoring techniques). First, a relationship between time separation and system capacity was developed. The time separations were incorporated into a set of scheduling algorithms which contain the required elements of flexibility needed for terminal-area operation, such as delaying aircraft and changing time separations. The problem of reducing the size of time separations allotted for vectored aircraft by means of computer assists to the controller was also addressed.

Tobias, L.↗
NASA NTRS1983

Time-critical multirate scheduling using contemporary real-time operating system services

Although real-time operating systems provide many of the task control services necessary to process time-critical applications (i.e., applications with fixed, invariant deadlines), it may still be necessary to provide a scheduling algorithm at a level above the operating system in order to coordinate a set of synchronized, time-critical tasks executing at different cyclic rates. The scheduling requirements for such applications and develops scheduling algorithms using services provided by contemporary real-time operating systems.

Eckhardt, D. E., Jr.↗