Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedule”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

DeepSurveySim: Simulation Software and Benchmark Challenges for Astronomical Observation Scheduling

Modern astronomical surveys have multiple competing scientific goals. Optimizing the observation schedule for these goals presents significant computational and theoretical challenges, and state-of-the-art methods rely on expensive human inspection of simulated telescope schedules. Automated methods, such as Reinforcement Learning (RL), have recently been explored to accelerate scheduling. DeepSurveySim provides methods for tracking and approximating sky conditions for a set of observations from a user-supplied telescope configuration.

79 ASTRONOMY AND ASTROPHYSICS↗
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 OSTI2017

Scheduling Non-Preemptible Jobs to Minimize Peak Demand

Our paper examines an important problem in smart grid energy scheduling; peaks in power demand are proportionally more expensive to generate and provision for. The issue is exacerbated in local microgrids that do not benefit from the aggregate smoothing experienced by large grids. Demand-side scheduling can reduce these peaks by taking advantage of the fact that there is often flexibility in job start times. We then focus attention on the case where the jobs are non-preemptible, meaning once started, they run to completion. The associated optimization problem is called the peak demand minimization problem, and has been previously shown to be NP-hard. These results include an optimal fixed-parameter tractable algorithm, a polynomial-time approximation algorithm, as well as an effective heuristic that can also be used in an online setting of the problem. Simulation results show that these methods can reduce peak demand by up to 50% versus on-demand scheduling for household power jobs.

97 MATHEMATICS AND COMPUTING↗
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)↗
DOE OSTI2019

Using OpenMP for HEP Framework Algorithm Scheduling [Slides]

The OpenMP standard is the primary mechanism used at high performance computing facilities to allow intra-process parallelization. In contrast, many HEP specific software (such as CMSSW, GaudiHive, and ROOT) make use of Intel's Threading Building Blocks (TBB) library to accomplish the same goal. In this talk we will discuss our work to compare TBB and OpenMP when used for scheduling algorithms to be run by a HEP style data processing framework (i.e. running hundreds of interdependent algorithms at most once for each event read from the detector). This includes both scheduling of different algorithms to be run concurrently as well as scheduling concurrent work within one algorithm. As part of the discussion we present an overview of the OpenMP threading model. We also explain how we used OpenMP when creating a simplified HEP-like processing framework. Using that simplified framework, and a similar one written using TBB, we will present performance comparisons between TBB and different compiler versions of OpenMP.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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.↗
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 NTRS1986

On scheduling tasks with a quick recovery from failure

Multiprocessors used in life-critical real-time systems must recover quickly from failure. Part of this recovery consists of switching to a new task schedule which ensures that hard deadlines for critical tasks continue to be met. A dynamic programming algorithm is presented that ensures that backup, or contingency, schedules can be efficiently embedded within the original, 'primary' schedule to ensure that hard deadlines continue to be met in the face of up to a given maximum number of processor failures. Several illustrative examples are included.

Krishna, C. M.↗
NASA NTRS1987

The resource envelope as a basis for space station management system scheduling

The Platform Management System (PMS) Resource Envelope Scheduling System (PRESS) expert system prototype developed for space station scheduling is described. The purpose of developing the prototype was too investigate the resource envelope concept in a practical scheduling application, using a commercially available expert system shell. PRESS is being developed on an IBM PC/AT using Teknowledge, Inc.'s M.1 expert system shell.

Bush, Joy↗
NASA NTRS1987

Range and mission scheduling automation using combined AI and operations research techniques

Ground-based systems for Satellite Command, Control, and Communications (C3) operations require a method for planning, scheduling and assigning the range resources such as: antenna systems scattered around the world, communications systems, and personnel. The method must accommodate user priorities, last minute changes, maintenance requirements, and exceptions from nominal requirements. Described are computer programs which solve 24 hour scheduling problems, using heuristic algorithms and a real time interactive scheduling process.

Arbabi, Mansur↗
NASA NTRS1987

Expert systems tools for Hubble Space Telescope observation scheduling

This paper discusses the utility of expert systems techniques for Hubble Space Telescope (HST) planning and scheduling and describes a plan for development of expert system tools which will augment the existing ground system. Additional capabilities provided by these tools will include graphics-oriented plan evaluation, long-range analysis of the observation pool, analysis of optimal scheduling time intervals, constructing sequences of spacecraft activities which minimize operational overhead, and optimization of linkages between observations. Initial prototyping of a scheduler used the Automated Reasoning Tool running on a LISP workstation.

Miller, Glenn↗
NASA NTRS1987

Deep space network resource scheduling approach and application

Deep Space Network (DSN) resource scheduling is the process of distributing ground-based facilities to track multiple spacecraft. The Jet Propulsion Laboratory has carried out extensive research to find ways of automating this process in an effort to reduce time and manpower costs. This paper presents a resource-scheduling system entitled PLAN-IT with a description of its design philosophy. The PLAN-IT's current on-line usage and limitations in scheduling the resources of the DSN are discussed, along with potential enhancements for DSN application.

Eggemeyer, William C.↗