Search NASA⌕ Search

SEARCH · Search NASA

Results for “Generation 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

End-Use Savings Shapes Measure Documentation: Dispatch Schedule Generation for Demand Flexibility Measures

This supplemental document describes the methodology used for determining the dispatch timing of various EUSS demand flexibility measures. Demand flexibility measures are designed to reduce/dispatch electricity demand in buildings during especially beneficial/critical times. The method used in this work utilizes predictions of building loads to generate a schedule that reflects the periods when the building's daily peak load occurs to support decision making in demand flexibility measures. The dispatch schedule generation method described in this document creates an hourly schedule that includes a load dispatch (peak) window for each day for a whole year based on load prediction, with options using different prediction methods: perfect prediction, bin-sampling method, fixed schedule, and outdoor air temperature (OAT)-based prediction method. The perfect prediction method performs a simulation to obtain the annual load profile as predicted load, representing the scenario of perfect load prediction. The bin-sampling method (1) categorizes days into representative bins by temperature characteristics, (2) performs simulations on sample days from each of those bins to create representative (or predicted) load, and (3) assigns representative loads for all days in a year based on the bin categorization. The fixed schedule method defines uniform start and end time of peak window with assumed fixed daily peak time, for all days in a season or a year. The OAT-based prediction method uses the statistics of OAT (minimum and maximum) as the indicators of peak load, with specified delay response time from building loads to temperature. Given the load prediction, daily peak periods are determined as a time window with specified length in each day that include the predicted daily peak load and with a secondary rule such as maximizing energy saving potential. The dispatch schedule generation method is not a standalone measure and is intended to be combined with other demand flexibility measures that could leverage the peak schedule and apply demand controls on specific systems or devices for demand response, such as measures described in "Measure Documentation - Thermostat Control for Load Shedding" and "Measure Documentation - Thermostat Control for Load Shifting".

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Robustness: The Missing Ingredient in Generation Scheduling

This article highlights robustness as an essential factor to cope with the ever-increasing levels of uncertainty in generation scheduling under significant renewable energy penetration, as is the case in Brazil and Spain. To that end, robust generation scheduling is framed within the different optimization-based approaches that are available for uncertainty handling. In addition, the suitability of robust optimization to accommodate practical security criteria in generation scheduling is also emphasized. Interestingly, this article points out the existence of an effective algorithm allowing the discovery of critical or so-called umbrella scenarios, which paves the way for the implementation of robust generation scheduling in industry practice.

Street, Alexandre↗
NASA NTRS1996

A System for Automatically Generating Scheduling Heuristics

The goal of this research is to improve the performance of automated schedulers by designing and implementing an algorithm by automatically generating heuristics by selecting a schedule. The particular application selected by applying this method solves the problem of scheduling telescope observations, and is called the Associate Principal Astronomer. The input to the APA scheduler is a set of observation requests submitted by one or more astronomers. Each observation request specifies an observation program as well as scheduling constraints and preferences associated with the program. The scheduler employs greedy heuristic search to synthesize a schedule that satisfies all hard constraints of the domain and achieves a good score with respect to soft constraints expressed as an objective function established by an astronomer-user.

Morris, Robert↗
NASA NTRS1990

Schedule-Report-Generator Computer Program

Schedule Report Generator provides simple method for generating periodic schedule reports. Enables engineering manager to monitor tasks assigned to staff members on weekly basis. Sorts three types of reports by use of one or more data fields as sorting keys. Schedule Organizer (SO) (COSMIC program MSC-21525), Schedule Tracker (ST) (COSMIC program MSC-21526), and Schedule Report Generator (SRG) computer programs manipulating data-base files in ways advantageous in scheduling. Written in PL/1 and DEC Command Language (DCL).

Collazo, Fernando F.↗
NASA NTRS1990

The Traffic Management Advisor

The traffic management advisor (TMA) is comprised of algorithms, a graphical interface, and interactive tools for controlling the flow of air traffic into the terminal area. The primary algorithm incorporated in it is a real-time scheduler which generates efficient landing sequences and landing times for arrivals within about 200 n.m. from touchdown. A unique feature of the TMA is its graphical interface that allows the traffic manager to modify the computer-generated schedules for specific aircraft while allowing the automatic scheduler to continue generating schedules for all other aircraft. The graphical interface also provides convenient methods for monitoring the traffic flow and changing scheduling parameters during real-time operation.

Nedell, William↗
NASA NTRS2020

Using Explainable Scheduling for the Mars 2020 Rover Mission

Understanding the reasoning behind the behavior of an auto- mated scheduling system is essential to ensure that it will be trusted and consequently used to its full capabilities in critical applications. In cases where a scheduler schedules activities in an invalid location, it is usually easy for the user to infer the missing constraint by inspecting the schedule with the in- valid activity to determine the missing constraint. If a sched- uler fails to schedule activities because constraints could not be satisfied, determining the cause can be more challenging. In such cases it is important to understand which constraints caused the activities to fail to be scheduled and how to al- ter constraints to achieve the desired schedule. In this pa- per, we describe such a scheduling system for NASA’s Mars 2020 Perseverance Rover, as well as Crosscheck, an explain- able scheduling tool that explains the scheduler behavior. The scheduling system and Crosscheck are the baseline for oper- ational use to schedule activities for the Mars 2020 rover. As we describe, the scheduler generates a schedule given a set of activities and their constraints and Crosscheck: (1) provides a visual representation of the generated schedule; (2) analyzes and explains why activities failed to schedule given the con- straints provided; and (3) provides guidance on potential con- straint relaxations to enable the activities to schedule in future scheduler runs.

Chien, Steve↗
DOE OSTI2022

Probabilistic Modeling of Commercial Building Occupancy Patterns Using Location-Based Map Data: Preprint

Considering occupancy patterns is crucial to simulate buildings' energy use. Current energy models use inputs that simplify the actual diversity in occupancy into static occupancy patterns and are not able to represent the numerous variations in occupancy patterns between buildings and across different locations. Recently, inferring occupancy schedules from metered electricity consumption data was used to model occupancy in commercial buildings. However, the translation from metered data to occupancy schedules requires many assumptions that might not capture the reality, and the process is hindered by the availability of data from advanced metering infrastructure. With the development of information technologies, occupancy modeling should not be limited to traditional approaches. The prevalence of social networks and location services with real-time user feedback provides publicly accessible data via Maps Application Programming Interfaces (APIs) such as Google Maps, SafeGraph, Mapbox, Foursquare, etc. This paper presents an automated framework for modeling parametric occupancy patterns using such APIs to calibrate commercial district buildings' energy models. This process includes three main steps: data extraction and processing, parametric schedules generation, and schedules integration. We demonstrated this framework in districts where we used maps API to generate more accurate behavioral patterns for operations and electric vehicle charging events. We used these patterns to determine differences in energy use across key sociodemographic and spatial parameters. The presented method has the potential for worldwide applications. Users can utilize this framework to extract data for selected locations of interest to create more realistic behavioral patterns for commercial facilities across different districts.

building energy modeling↗
DOE OSTI2022

Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach

We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.

25 ENERGY STORAGE↗
NASA NTRS1996

An Intelligent Crop Planning Tool for Controlled Ecological Life Support Systems

This paper describes a crop planning tool developed for the Controlled Ecological Life Support Systems (CELSS) project which is in the research phases at various NASA facilities. The Crop Planning Tool was developed to assist in the understanding of the long term applications of a CELSS environment. The tool consists of a crop schedule generator as well as a crop schedule simulator. The importance of crop planning tools such as the one developed is discussed. The simulator is outlined in detail while the schedule generator is touched upon briefly. The simulator consists of data inputs, plant and human models, and various other CELSS activity models such as food consumption and waste regeneration. The program inputs such as crew data and crop states are discussed. References are included for all nominal parameters used. Activities including harvesting, planting, plant respiration, and human respiration are discussed using mathematical models. Plans provided to the simulator by the plan generator are evaluated for their 'fitness' to the CELSS environment with an objective function based upon daily reservoir levels. Sample runs of the Crop Planning Tool and future needs for the tool are detailed.

Whitaker, Laura O.↗
NASA NTRS1992

Constraint monitoring in TOSCA

The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the allowable number of machine setups) which must be satisfied for a schedule to be valid. The identification of constraint violations and the monitoring of constraint threats plays a vital role in schedule generation in terms of the following: (1) directing the scheduling process; and (2) informing scheduling decisions. This paper describes a general mechanism for identifying constraint violations and monitoring threats to the satisfaction of constraints throughout schedule generation.

Beck, Howard↗
NASA NTRS1986

Development of a takeoff performance monitoring system

The development and testing of a real-time takeoff performance monitoring system is discussed. The algorithm is madeup of two segments: a pretakeoff segment and a real-time segment. One-time inputs of ambient conditions and airplane configuration information are used in the pretakeoff segment to generate schedule performance data for that takeoff. The real-time segment uses the scheduled performance data generated in the pretakeoff segment, runway length data, and measured parameters to monitor the performance of the airplane throughout the takeoff roll. Airplane and engine performance deficiencies are detected and annunciated. An important feature of this algorithm is the one-time estimation of the runway rolling friction coefficient. The algorithm was tested using a six degree of freedom airplane model in a computer simulation. Results from a series of sensitivity analysis are also included.

Srivatsan, R.↗
NASA NTRS1987

Development of a takeoff performance monitoring system

Discussed are the development and testing of a real-time takeoff performance monitoring algorithm. The algorithm is made up of two segments: a pretakeoff segment and a real-time segment. One-time imputs of ambient conditions and airplane configuration information are used in the pretakeoff segment to generate scheduled performance data for that takeoff. The real-time segment uses the scheduled performance data generated in the pretakeoff segment, runway length data, and measured parameters to monitor the performance of the airplane throughout the takeoff roll. Airplane and engine performance deficiencies are detected and annunciated. An important feature of this algorithm is the one-time estimation of the runway rolling friction coefficient. The algorithm was tested using a six-degree-of-freedom airplane model in a computer simulation. Results from a series of sensitivity analyses are also included.

Srivatsan, Raghavachari↗
NASA NTRS1987

Development of a takeoff performance monitoring system

The development and testing of a real-time takeoff performance monitoring system is discussed. The algorithm is made up of two segments: a pretakeoff segment and a real-time segment. One-time inputs of ambient conditions and airplane configuration information are used in the pretakeoff segment to generate schedule performance data for that takeoff. The real-time segment uses the scheduled performance data generated in the pretakeoff segment, runway length data, and measured parameters to monitor the performance of the airplane throughout the takeoff roll. Airplane and engine performance deficiencies are detected and annunciated. An important feature of this algorithm is the one-time estimation of the runway rolling friction coefficient. The algorithm was tested using a six degree of freedom airplane model in a computer simulation. Results from a series of sensitivity analysis are also included.

Srivatsan, R.↗
NASA NTRS1991

A planning language for activity scheduling

Mission planning and scheduling of spacecraft operations are becoming more complex at NASA. Described here are a mission planning process; a robust, flexible planning language for spacecraft and payload operations; and a software scheduling system that generates schedules based on planning language inputs. The mission planning process often involves many people and organizations. Consequently, a planning language is needed to facilitate communication, to provide a standard interface, and to represent flexible requirements. The software scheduling system interprets the planning language and uses the resource, time duration, constraint, and alternative plan flexibilities to resolve scheduling conflicts.

Zoch, David R.↗
NASA NTRS2014

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗
DOE OSTI2024

Battery Degradation Modeling in Hybrid Power Plants: An Island System Unit Commitment Study: Preprint

As hybrid power plants (HPPs), such as photovoltaic (PV) and battery combinations, become increasingly important in power systems with high renewable energy penetration to address PV variability and ensure grid stability. This paper focuses on the urgent need to model the coordination between PV and battery systems in HPPs while accounting for battery degradation. We present a generation scheduling model that explicitly incorporates PV-battery hybridization in the unit commitment problem. Moreover, the cost function of the HPP scheduling problem endogenously considers battery degradation with adjustable weights to strike a balance between minimizing production costs and prolonging battery life, particularly when providing energy arbitrage and ancillary services. Using a realistic island system simulation, we demonstrate that accounting for battery degradation in the scheduling problem can significantly extend battery life with only minor additional production costs.

battery degradation↗
NASA NTRS1988

A space station onboard scheduling assistant

One of the goals for the Space Station is to achieve greater autonomy, and have less reliance on ground commanding than previous space missions. This means that the crew will have to take an active role in scheduling and rescheduling their activities onboard, perhaps working from preliminary schedules generated on the ground. Scheduling is a time intensive task, whether performed manually or automatically, so the best approach to solving onboard scheduling problems may involve crew members working with an interactive software scheduling package. A project is described which investigates a system that uses knowledge based techniques for the rescheduling of experiments within the Materials Technology Laboratory of the Space Station. Particular attention is paid to: (1) methods for rapid response rescheduling to accommodate unplanned changes in resource availability, (2) the nature of the interface to the crew, (3) the representation of the many types of data within the knowledge base, and (4) the possibility of applying rule-based and constraint-based reasoning methods to onboard activity scheduling.

Brindle, A. F.↗