Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Quantum/AI Topology-Aware Latency-Adaptive HPC Workflow Scheduling Optimization

The growing demand for more powerful high-performance computing (HPC) systems has led to a steady rise in energy consumption by supercomputing worldwide. This study is focused on comparing our Application-Topology Mapper (ATMapper) to the popular Simple Linux Utility for Resource Management (SLURM) for the purpose of exploring methods that can further optimize job-scheduling within HPC systems. ATMapper is an Artificial-Intelligence based approach to job-scheduling that is currently being enhanced with quantum annealing (QA) to generate optimal schedules faster. We are applying QA to speedup our ATMapper process to achieve higher computing efficiency, thereby reducing HPC energy consumption. Here, we examine how four job-scheduling approaches perform in processor node assignment when using an example network architecture of 4 interconnected nodes. Using a specialized script, we are assessing the schedule of a computation flow with 11 interdependent tasks. The data movements among nodes were tracked to count for the number of interactions (network hops) between nodes needed to complete the tasks. The total number of hops and the job completion time were then used to quantify the efficiency of the different mapping approaches. In addition to SLURM, we also compare our ATMapper to the QA-enabled LBNL TIGER and the D-Wave Distributed Computing processor assignment approaches. The preliminary results showed that our topology-aware, latency-adaptive ATMapper is significantly more efficient when compared to the other scheduling approaches due to its load-imbalance network allocation. The scheduler displayed a computing efficiency of 53% by performing significantly fewer network hops than its alternatives. By reducing the number of hops, ATMapper was able to perform all 11 tasks by using only 3 nodes out of given 4. This research indicates the potential to use QA/AI for HPC job-scheduling. Later, we will test a SLURM simulator program to draw further comparisons on the effectiveness of ATMapper's scheduling approach. The results of this comparison will serve as a baseline for later improving SLURM's performance using a QA-enhanced ATMapper approach.

Caraveo, Braulio [University of Huston - Clear Lak↗
DOE OSTI2022

Koopman-based Differentiable Predictive Control for the Dynamics-Aware Economic Dispatch Problem

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, the incorporation of differential equations that govern the system dynamics makes DED an optimization problem that is computationally prohibitive to solve. In this work, we present a new data-driven approach based on differentiable programming to efficiently obtain offline parametric solutions to the underlying DED problem. In particular, we employ the recently proposed differentiable predictive control (DPC) for offline learning of explicit neural control policies based on identified Koopman operator (KO) model of the system dynamics. We demonstrate the high solution quality and five orders of magnitude computational-time savings of the DPC method over the original optimization-based DED approach on a 9-bus test power grid network.

King, Ethan↗
DOE OSTI2021

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗
NASA NTRS1992

Coordinating space telescope operations in an integrated planning and scheduling architecture

The Heuristic Scheduling Testbed System (HSTS), a software architecture for integrated planning and scheduling, is discussed. The architecture has been applied to the problem of generating observation schedules for the Hubble Space Telescope. This problem is representative of the class of problems that can be addressed: their complexity lies in the interaction of resource allocation and auxiliary task expansion. The architecture deals with this interaction by viewing planning and scheduling as two complementary aspects of the more general process of constructing behaviors of a dynamical system. The principal components of the software architecture are described, indicating how to model the structure and dynamics of a system, how to represent schedules at multiple levels of abstraction in the temporal database, and how the problem solving machinery operates. A scheduler for the detailed management of Hubble Space Telescope operations that has been developed within HSTS is described. Experimental performance results are given that indicate the utility and practicality of the approach.

Muscettola, Nicola↗
NASA NTRS1993

ESSOPE: Towards S/C operations with reactive schedule planning

The ESSOPE is a prototype front-end tool running on a Sun workstation and interfacing to ESOC's MSSS spacecraft control system for the exchange of telecommand requests (to MSSS) and telemetry reports (from MSSS). ESSOPE combines an operations Planner-Scheduler, with a Schedule Execution Control function. Using an internal 'model' of the spacecraft, the Planner generates a schedule based on utilization requests for a variety of payload services by a community of Olympus users, and incorporating certain housekeeping operations. Conflicts based on operational constraints are automatically resolved, by employing one of several available strategies. The schedule is passed to the execution function which drives MSSS to perform it. When the schedule can no longer be met, either because the operator interferes (by delays or changes of requirements), or because ESSOPE has recognized some spacecraft anomalies, the Planner produces a modified schedule maintaining the on-going procedures as far as consistent with the new constraints or requirements.

Wheadon, J.↗
DOE OSTI2021

AC Power Flow Based DLMP Calculation and Decomposition Method to Smooth Power Fluctuation of Distributed Renewable Energy Sources

As the penetration of renewable energy sources increases, the growing renewable power variability brings ramping issues to power systems. Meanwhile, the development of distributed energy resources (DERs) makes the distribution systems to provide both energy and ancillary services. To incentivise individual resources and customers to alleviate ramping issues on the demand side, a two-stage distribution locational marginal price (DLMP) calculation and decomposition method is developed to formulate the marginal power ramping price for DERs. In the first stage of the proposed method, a distribution system operator market scheduling model based on AC optimal power flow is designed to estimate the optimal operating point of the distribution system. Subsequently, the voltage and power flow constraints are linearised in stage two to calculate DLMP. Finally, based on the Lagrange function and sensitivity factors, DLMP is decomposed to the marginal costs for active/reactive power, voltage management, power loss and power variability. Case studies demonstrate that the proposed model can effectively smooth the power fluctuation and reduce the ramping flexibility requirements of distribution systems.

AC optimal power flow↗
NASA NTRS1989

Application of a hybrid generation/utility assessment heuristic to a class of scheduling problems

A two-stage heuristic solution approach for a class of multiobjective, n-job, 1-machine scheduling problems is described. Minimization of job-to-job interference for n jobs is sought. The first stage generates alternative schedule sequences by interchanging pairs of schedule elements. The set of alternative sequences can represent nodes of a decision tree; each node is reached via decision to interchange job elements. The second stage selects the parent node for the next generation of alternative sequences through automated paired comparison of objective performance for all current nodes. An application of the heuristic approach to communications satellite systems planning is presented.

Heyward, Ann O.↗
NASA NTRS1998

A Fast-Time Study of Aircraft Reordering in Arrival Sequencing and Scheduling

In order to ensure that the safe capacity of the terminal area is not exceeded, Air Traffic Management ATM often places restrictions on arriving flights transitioning from en route airspace to terminal airspace. This restriction of arrival traffic is commonly referred to as arrival flow management, and includes techniques such as metering, vectoring, fix-load balancing, and the imposition of miles-in-trail separations. These restrictions are enacted without regard for the relative priority which airlines may be placing on individual flights based on factors such as crew criticality, passenger connectivity, critical turn times, gate availability, on-time performance, fuel status, or runway preference. The development of new arrival flow management techniques which take into consideration priorities expressed by air carriers will likely reduce the economic impact of ATM restrictions on the airlines and lead to increased airline economic efficiency by allowing airlines to have greater control over their individual arrival banks of aircraft. NASA and the Federal Aviation Administration (FAA) have designed and developed a suite of software decision support tools (DSTs) collectively known as the Center TRACON Automation System (CTAS). One of these tools, the Traffic Management Advisor (TMA) is currently being used at the Fort Worth Air Route Traffic Control Center to perform arrival flow management of traffic into the Dallas/Fort Worth airport (DFW). The TMA is a time-based strategic planning tool that assists Traffic Management Coordinators (TMCs) and En Route Air Traffic Controllers in efficiently balancing arrival demand with airport capacity. The primary algorithm in the TMA is a real-time scheduler which generates efficient landing sequences and landing times for arrivals within about 200 no a. from touchdown. This scheduler will sequence aircraft so that they arrive in a first- come - first-served (FCFS) order. While FCFS sequencing establishes a fair order based on estimated times of arrival, it does not take into account individual airline priorities among incoming flights. NASA is exploring the possibility of allowing airlines to express relative arrival priorities to air traffic management through the development of new CTAS scheduling algorithms which take into consideration airline arrival preferences. The accommodation of airline priorities in arrival sequencing and scheduling would under most circumstances result in a deviation from a "natural" or FCFS arrival order. As a First step toward developing airline influenced sequencing algorithms, an investigation was conducted to determine the feasibility of reordering arrival traffic from a strict FCFS sequence. A fast-time simulation has been developed which allows statistical evaluation of sequencing and scheduling algorithms for arrival traffic at the Dallas/Fort Worth Airport. In contrast to real-time simulation or field tests, which would require on the order of ninety minutes to examine a single traffic rush period, the fast-time simulation allows examination of multiple rush periods in a matter of seconds.

Carr, Greg↗
NASA NTRS2010

Traffic Flow Management Using Aggregate Flow Models and the Development of Disaggregation Methods

A linear time-varying aggregate traffic flow model can be used to develop Traffic Flow Management (tfm) strategies based on optimization algorithms. However, there are no methods available in the literature to translate these aggregate solutions into actions involving individual aircraft. This paper describes and implements a computationally efficient disaggregation algorithm, which converts an aggregate (flow-based) solution to a flight-specific control action. Numerical results generated by the optimization method and the disaggregation algorithm are presented and illustrated by applying them to generate TFM schedules for a typical day in the U.S. National Airspace System. The results show that the disaggregation algorithm generates control actions for individual flights while keeping the air traffic behavior very close to the optimal solution.

Sun, Dengfeng↗
NASA NTRS2010

An Introduction to Sked

In this note I give an overview of the VLBI scheduling software sked. I describe some of the algorithms used in automatic scheduling and some sked commands which have been introduced at users requests. I also give a cookbook for generating some schedules.

Gipson, John↗
NASA NTRS1993

The mission events graphic generator software: A small tool with big results

Utilization of graphics has long been a useful methodology for many aspects of spacecraft operations. A personal computer based software tool that implements straight-forward graphics and greatly enhances spacecraft operations is presented. This unique software tool is the Mission Events Graphic Generator (MEGG) software which is used in support of the Hubble Space Telescope (HST) Project. MEGG reads the HST mission schedule and generates a graphical timeline.

Lupisella, Mark↗
NASA NTRS2019

Constraint-Based Off-Nominal Behavior Modeling for Europa Clipper

The risk analysis for the Europa Clipper mission evaluates the probability of mission failure based on the failure rates of individual components and dependencies among them. The probabilities are calculated by integrating over the intervals of time within which a fault occurs, accounting for an infinite number of cases. The response of the spacecraft to different faults can result in different schedules of activities, changing the intervals of integration. Europa currently uses models of spacecraft systems and components to simulate individual flight scenarios. The goal is to develop a framework for integrating, automating, and improving this modeling process. We describe an approach to generating the schedules for the different fault cases and determining the intervals for faults. It is not enough to just simulate individual cases because we are working with continuous variables that generate an infinite number of possible futures. Instead, we determine time windows within which certain faults can occur and use these time windows as bounds for integration. We found that determining these time windows is a constraint optimization problem. In order to represent these problems, we employ a language based on ontologies of behavior and scenarios. The language enables us to specify constraints in a simple, declarative syntax. A constraint-based analysis engine uses the declarative specification to identify bounds on system parameters and fill in details of behavior. For example, we created a detailed model of power generation, power use, and the corresponding effects on the battery in order to determine when an undervoltage fault can occur. An undervoltage during a trajectory correction maneuver requires that thrusting be interrupted for just enough time to recharge the battery such that the maneuver can be completed within battery limits. This behavior is generated based on the model to minimize the interruption time. For certain scenarios the constraint optimization problems were simple enough to be solved by hand, but the framework made the process substantially faster. It also produced solutions to other problems that we could not solve by hand or with existing tools and allowed us to generate and run many scenarios at once. The scenario language and engine greatly simplified the process of identifying time bounds and separating cases.

Everline, Chester J.↗
DOE OSTI2025

PDPTW-DB: MILP-Based Offline Route Planning for PDPTW with Driver Breaks

The Pickup and Delivery Problem with Time Windows (PDPTW) involves optimizing routes for vehicles to meet pickup and delivery requests within specific time constraints, a challenge commonly faced in logistics and transportation. Microtransit, a flexible and demand-responsive service using smaller vehicles within defined zones, can be effectively modeled as a PDPTW. Yet, the need for driver breaks—a key human constraint—is frequently overlooked in PDPTW solutions, despite being necessary for regulatory compliance. This study presents a novel mixed-integer linear programming formulation for the Pickup and Delivery Problem with Time Windows and Driver Breaks (PDPTW-DB). To the best of our knowledge this formulation is the first to consider mandatory periodic driver breaks within optimized Microtransit routes. The proposed model incorporates regulatory compliant break scheduling directly within the vehicle routing optimization framework. By considering driver break requirements as an integral component of the optimization process, rather than as a post-processing step, the model enables the generation of routes that respect hours of service regulations while minimizing operational costs. This integrated approach facilitates the generation of schedules that are operationally efficient and prioritize driver welfare through driver breaks. We work with a public transit agency from the southern USA, and highlight the specific nuances of driver break optimization, and present a Pickup and Delivery Problem with Time Windows formulation for optimizing Microtransit operations and scheduling driver breaks. We validate our approach using real-world data from the transit agency. Our results validate our formulation in producing cost-effective, and regulation-compliant solutions.

Applied Computing, Transportation↗
NASA NTRS2006

Collaborative Scheduling Using JMS in a Mixed Java and .NET Environment

A collaborative framework/environment was proto-typed to prove the feasibility of scheduling space flight missions on NASA's Deep Space Network (DSN) in a distributed fashion. In this environment, effective collaboration relies on efficient communications among all flight mission and DSN scheduling users. There-fore, messaging becomes critical to timely event notification and data synchronization. In the prototype, a rapid messaging system using Java Message Service (JMS) in a mixed Java and .NET environment is established. This scheme allows both Java and .NET applications to communicate with each other for data synchronization and schedule negotiation. The JMS approach we used is based on a centralized messaging scheme. With proper use of a high speed messaging system, all users in this collaborative framework can communicate with each other to generate a schedule collaboratively to meet DSN and projects tracking needs.

scheduling↗
NASA NTRS1994

Window-Based Graphics For Scheduling

XOPPS computer program generates window-based graphics for scheduling and planning projects. Provides easy and fast on-screen "what-you-see-is-what-you-get" editing capabilities. Object-oriented, but unique in its capability for creating objects that have date attributes. Can be used in conjunction with project-management software. Written in C language for Sunseries workstations running SunOS. XOPPS was developed in 1992, based on the Sunview version of OPPS (NPO-18439) developed in 1990. It is copyrighted work with all copyright vested in NASA.

Mulnix, Cassie↗
DOE OSTI2025

EVI-EnSitePy (Electric Vehicle Infrastructure – Energy Estimation and Site Optimization Tool in Python) [EVI-X Modeling Suite] [SWR-25-07]

EVI-EnSitePy is a comprehensive agent-based tool designed for the analysis and design of high-power charging sites, encompassing a wide array of site agents including Electric Vehicles (EVs), chargers, energy storage units (ESS), renewable energy resources (DER), and loads. This versatile tool offers diverse functionalities and a modular modeling approach, allowing detailed configuration of agents based on power ratings, port numbers, energy capacities, demand requirements, charger interfaces, and flexibility to customize the tool for project specific goals. By simulating agent interactions and employing various metrics, EVI-EnSitePy enables the assessment of site performance, exploration of energy management systems (EMS), and implementation of innovative EV charging policies. Utilizing EV charge schedules and arrival states, the tool performs thorough charging site simulations, with outputs consisting of agent and site-level power profiles and statistical metrics. Employing a tree graph structure, EVI-EnSitePy supports nested site structures and power distribution modeling. The tool's ability to generate charging schedules deterministically or via stochastic analysis further enhances its versatility. Through its features and capabilities, EVI-EnSitePy offers a powerful platform for informed decision-making in the realm of high-power charging site design and operation.

Jackson, Derek [National Renewable Energy Laborato↗
NASA NTRS2008

Automated Planning and Scheduling for Orbital Express (151)

The challenging timeline for DARPA's Orbital Express mission demanded a flexible, responsive, and (above all) safe approach to mission planning. Because the mission was a technology demonstration, pertinent planning information was learned during actual mission execution. This information led to amendments to procedures, which led to changes in the mission plan. In general, we used the ASPEN planner scheduler to generate and validate the mission plans. We enhanced ASPEN to enable it to reason about uncertainty. We also developed a model generator that would read the text of a procedure and translate it into an ASPEN model. These technologies had a significant impact on the success of the Orbital Express mission.

autonomy↗
NASA NTRS2018

Development of the ITACA Network Loading Analysis Tool's Scheduling Techniques

NASA's SCENIC project aims to simplify and reduce the cost of space mission planning by creating analysis capabilities which are integrated with relevant analysis parameters specific to SCaN assets and SCaN supported user missions. The Integrated Tradespace Analysis of Communications Architectures (ITACA) will provide an all-in-one package for various analysis capabilities that normally require add-ons or multiple tools to complete. The ITACA tool will be responsible for assessing the given network architecture and generating a schedule for the missions as well as the assets. ITACA will allow users to evaluate the quality of service of a given network and determine whether or not the network will satisfy the mission's requirements. ITACA is currently under development, and during the spring of 2018 major development in the tools scheduling techniques were completed. A total of seven different techniques were completed.

space communications↗