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 1,369 records · Page 76

Separation at Crossing Waypoints Under Wind Uncertainty in Urban Air Mobility

To enable high-density operations in major metropolitan areas, urban air mobility networks are anticipated to have air traffic management with higher levels of autonomy. To ensure that this type of autonomy is feasible, one of the critical steps from a safety and efficiency perspective is understanding various factors that affect the spatial separation between airborne flights and ensure that these factors can be managed. In terms of separation assurance and scheduling, an important real-world concern is that future states of aircraft cannot be perfectly predicted. The focus of this research paper is to understand how these prediction errors affect separation and scheduling services and to explore mitigation strategies to handle these errors. In this research, we have simulated these types of uncertainty by adding wind-prediction errors to trajectory predictions for separation. With these wind-prediction errors, we decompose the problem into two separate questions. First, using both simulation and analytical methods, we look at conflict-detection-only scenarios to understand how the wind errors affect required minimum temporal separation between crossing flights to ensure a specific spatial separation. Next, we study how trajectory errors effect conflict resolution, and we explore different combinations of scheduling and separation assurance to mitigate the effects of uncertainty between crossing flights. The conflict resolution algorithm aims to minimize necessary temporal separation between crossing flights under uncertainty, still ensuring safety-critical spatial separation. In summary, this research suggests that the required minimum temporal separation at a crossing waypoint is dependent on factors such as inbound crossing angle, the relative angle between wind direction and bearing of each route, wind magnitude, wind magnitude uncertainty, nominal cruise airspeed of aircraft, and look-ahead time of the conflict detection algorithm. This research also suggests that different combinations of scheduling and separation have different qualitative results. Using a combination of strategic, flow-based scheduling, tactical scheduling at crossings, speed control near crossing points, and separation management leads to a system that is insensitive to trajectory prediction errors with high throughput and flexibility for aircraft away from shared resources.

urban air mobility↗

The Role of Trust and Usability in Enabling Spaceflight Crew Autonomy

Future long duration exploration missions will require an increased use of onboard automated systems as spaceflight crews venture further than before and have longer communications delays with ground support. The design of these systems must support appropriate crew trust and have sufficient usability to enable spaceflight crew autonomy or risk being misused while crews wait to communicate with ground support. We evaluated trust & usability in our self-scheduling tool, Playbook, for crew mission timelines. Data was collected in a controlled lab experiment with 31 participants. Participants in the study conducted two tasks: scheduling, where participants were responsible for scheduling a majority of a day's operational tasks, and rescheduling, where participants were provided a schedule and asked to reschedule higher priority activities. We found a significant correlation between system trust and usability, irrespective of self-scheduling tasks. We conclude that system usability may play a bigger role in how trust is learned while conducting novel crew autonomy tasks such as self-scheduling. Future research should investigate the role of usability to encourage appropriate trust in onboard automated crew systems and enable crew autonomy.

crew autonomy↗

SMART-COM – Scalable Multi-Agent Adaptive Resolution Tools for Collaborative Outage Management

The purpose of this grant was to conduct scientific research and prototype applications to support NPP outage staff in their adaptive decision-making in efficient scheduling and resource allocation while preventing violation of safety technical specifications. The project contributed to scientific knowledge and engineering methods in (1) user interface design, (2) scheduling optimization and risk estimation, and (2) natural language processing that would benefit the nuclear power plants in minimizing schedule overruns and even unexpected shutdowns. The research team conducted site visits at a test reactor facility and an operating nuclear power plant to gather necessary information and inputs for research and development of a software application to support NPP staff in executing their outages. The final software application consisted of three modules. First, the natural language processing module supports interactive processing of technical documentation to build a database for outage staff to query non-permissible actions on system components. This module can alleviate outage staff from reviewing extensive documentation and minimize violation of technical specifications, especially in time-sensitive situations. Second, the schedule optimization module schedules outage activities and compute risk indices that outperform existing software and current practice. This module can reduce completion time of an outage that typically have too many activities for human to optimize based on current practice that does not apply the latest operations research. Finally, the visualization module presents progress and risk information of the overall outage and individual activities, as well as enabling access to the natural language processing and schedule optimization modules. This module can provide outage staff with situation awareness that are necessary to make risk-informed decisions in response to unexpected events during the execution of an outage.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗

SMC 2021 : Analyzing Resource Utilization and User Behavior on Titan Supercomputer

Resource utilization statistics of submitted jobs on a supercomputer can help us understand how users from various scientific domains use HPC platforms and better design a job scheduler. We explore to generate insight regarding workload distribution and usage pattern domains from job scheduler trace, GPU failure information, and project-specific information collected from Titan supercomputer. Furthermore, we want to know how the scheduler performance varies over time and how the users' scheduling behavior changes following a system failure. These observations have the potential to provide valuable insight, which is helpful to prepare for system failures. These practices will help us develop and apply novel machine learning algorithms in understanding system behavior, requirement, and better scheduling of HPC systems. There are two datasets, RUR and GPU. RUR: This dataset is the job scheduler traces collected from the Titan supercomputerfrom 01/01/2015 to 07/31/2019 (2015.csv - 2019.csv). These were collected usingResource Utilization Report (RUR), a Cray-developed resource-usage data collectionand reporting system. It contains the usage information of its critical resources (CPU,Memory, GPU, and I/O) of each running job on Titan during that period [2]. ProjectAreas: Every job is associated with a project ID. TheProjectAreas.csvdatasetprovides a mapping of the project ID to its domain science. GPU: There have been some hardware-related issues in the GPUs in Titan that caused some GPUs to fail, sometimes irrecoverably during some job runs. This dataset provides information regarding these failures during the execution of the submitted jobs. GPUs on Titan are uniquely identified by a serial number (SN), and they are installed in a location. A GPU can be installed in a location, then removed from that location following a failure, and then re-installed in a different location after fixing the problem. If the failure can't be recovered, the GPU might be removed entirely from Titan. There are two prominent types of failures that resulted in the removal of GPUs from Titan: Double Bit Error (DBE) and Out of the Bus (OTB). The dataset (gc_full.csv) has the following fields: 1. SN : Serial number of a GPU 2. location : The location where it is installed 3. insert : The time when it was inserted into that location 4. remove : The time when it was removed from that location 5. duration : Amount of time the GPU spent in this location 6. out : If the device was taken out entirely w/o a re-installment into a new location. 7. event : If the GPU was taken out entirely, the reason for its removal. To learn more about this dataset, please refer to the git repositoryhttps://github.com/olcf/TitanGPULifeand the related publication [1]. References [1] George Ostrouchov, Don Maxwell, Rizwan A Ashraf, Christian Engelmann, MallikarjunShankar, and James H Rogers. Gpu lifetimes on titan supercomputer: Survival analysisand reliability. InSC20: International Conference for High Performance Computing,Networking, Storage and Analysis, pages 1-14. IEEE, 2020. [2] Feiyi Wang, Sarp Oral, Satyabrata Sen, and Neena Imam. Learning from five-yearresource-utilization data of titan system. In2019 IEEE International Conference onCluster Computing (CLUSTER), pages 1-6. IEEE, 2019.

42 ENGINEERING↗

SMC 2021 Data Challenge: Analyzing Resource Utilization and User Behavior on Titan Supercomputer

Resource utilization statistics of submitted jobs on a supercomputer can help us understand how users from various scientific domains use HPC platforms and better design a job scheduler. We explore to generate insight regarding workload distribution and usage pattern domains from job scheduler trace, GPU failure information, and project-specific information collected from Titan supercomputer. Furthermore, we want to know how the scheduler performance varies over time and how the users' scheduling behavior changes following a system failure. These observations have the potential to provide valuable insight, which is helpful to prepare for system failures. These practices will help us develop and apply novel machine learning algorithms in understanding system behavior, requirement, and better scheduling of HPC systems. There are two datasets, RUR and GPU: RUR dataset is the job scheduler traces collected from the Titan supercomputer from 01/01/2015 to 07/31/2019 (2015.csv - 2019.csv). These were collected using resource Utilization Report (RUR), a Cray-developed resource-usage data collection and reporting system. It contains the usage information of its critical resources (CPU, Memory, GPU, and I/O) of each running job on Titan during that period (https://ieeexplore.ieee.org/abstract/document/8891001). It includes ProjectAreas as additional information, every job is associated with a project ID. TheProjectAreas.csv dataset provides a mapping of the project ID to its domain science. GPU dataset has information regarding GPU failure on Titan. There have been some hardware-related issues in the GPUs in Titan that caused some GPUs to fail, sometimes irrecoverably during some job runs. This dataset provides information regarding these failures during the execution of the submitted jobs. GPUs on Titan are uniquely identified by a serial number (SN), and they are installed in a location. A GPU can be installed in a location, then removed from that location following a failure, and then re-installed in a different location after fixing the problem. If the failure can't be recovered, the GPU might be removed entirely from Titan. There are two prominent types of failures that resulted in the removal of GPUs from Titan: Double Bit Error (DBE) and Out of the Bus (OTB). The dataset (gc_full.csv) has seven attributes, we provided a short description of these attributes in the ReadMe file. To learn more about this dataset, please refer to the git repository https://github.com/olcf/TitanGPULife and the related publication (https://ieeexplore.ieee.org/abstract/document/9355319).

42 ENGINEERING↗

Models and Strategies for Optimal Demand Side Management in the Chemical Industries

Deregulation and the increase of renewable electricity generation from wind and solar photovoltaics have transformed the U.S. electricity market. Economic and environmental benefits notwithstanding, the presence of renewables has increased variability and uncertainty on the supply side of the grid. Managing demand, rather than generation – a strategy referred to as “demand response (DR)” – is an attractive approach for mitigating this imbalance. DR efforts aim to reduce electricity usage during peak demand times, lessening stress on the grid. Industrial users are particularly attractive entities for DR participation since they present large, localized loads that can provide significant relief on grid demand and –unlike other large loads, such as buildings – are minimally dependent on human needs and preferences. In this project, we accomplished three main objectives. (1) We developed data-driven low-order DR scheduling-relevant dynamic models of chemical processes. Concurrently, we studied the formulation and solution of the associated optimal DR production scheduling problems. (a) A prototype air separation unit (ASU) model was used to generate simulated operating data for initial modeling efforts, which enabled the later use of industrial data for data-driven modeling. (b) We utilized Hammerstein-Wiener (HW) and Finite Step Response (FSR) models to represent nonlinear plant dynamics. (c) The HW models were linearized using exact linearization so they could potentially be embedded in power system models, which are formulated as mixed integer linear programs (MILPs). (d) We solved DR optimization problems under uncertainty and found that even naïve predictions of electricity price and product demand led to significant cost savings benefits. (2) Our DR scheduling optimization problem formulations are amenable to real-time solution. (a) We utilized Lagrangian Relaxation (LR) to efficiently solve the optimization problem by decoupling subproblems linked by complicating constraints. (b) We have achieved computation times for the 3-day DR scheduling problem of an ASU as low as 1.88 minutes. (3) Our representations of the DR behavior of chemical process as grid-level batteries were embedded in power system models. (a) For a small-scale grid, we found that incorporating the dynamics of the chemical plant in the optimal power flow calculations resulted in better resource management leading to up to 15% and 46% cost reduction for the grid and chemical plant operations, respectively, during periods of power line congestion. We have published several works dedicated to modeling and solving DR optimization problems from the user side. These were published in top peer-reviewed journals and are summarized in this report. The most recent work (and papers in preparation) considers DR scheduling from the grid side. Future efforts will consider networked plants (e.g., air separation units operating on a common pipeline) for DR participation, which is expected to amplify the capabilities of industrial DR participants to perform load-shifting. Our consideration of uncertainty in DR has inspired future directions in this area as well: we plan to develop multistage methods to fully account for the effects of uncertainty in DR scheduling.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Project resource reallocation algorithm

A methodology for adjusting baseline cost estimates according to project schedule changes is described. An algorithm which performs a linear expansion or contraction of the baseline project resource distribution in proportion to the project schedule expansion or contraction is presented. Input to the algorithm consists of the deck of cards (PACE input data) prepared for the baseline project schedule as well as a specification of the nature of the baseline schedule change. Output of the algorithm is a new deck of cards with all work breakdown structure block and element of cost estimates redistributed for the new project schedule. This new deck can be processed through PACE to produce a detailed cost estimate for the new schedule.

Myers, J. E.↗

Dynamic load-sharing using predicted process resource requirements

Heuristics which use predicted process resource requirements to make scheduling decisions are proposed. Four heuristics are presented. The first two, MINQ and SMPL, employ centralized scheduling and the remaining two, DMINQ and FDMINQ, use distributed scheduling. These heuristics are first compared against random scheduling and then against two conventional heuristics, CENTEX and DISTED, which schedule processes solely based on system state information. Results based on trace-driven simulations show that the proposed centralized heuristics offer significantly improved mean response time and they require fewer status update messages. In experiments using the same status update rates, SMPL response times were, on the average, 22 percent lower than those for CENTEX; MINQ response times were, on the average, 18 percent lower. The simulations also showed that MINQ and SMPL can perform as well as, or better than, CENTEX while using up to 70 percent fewer status update messages. The use of fewer status update messages imposes less overhead on the system. The use of prediction for distributed scheduling produced similar results. When prediction was used to filter small processes and execute them locally a 50 percent improvement in response times was obtained.

Goswami, Kumar K.↗

Resource representation in COMPASS

A set of viewgraphs on resource representation in COMPASS is given. COMPASS is an incremental, interactive, non-chronological scheduler written in Ada with an X-windows user interface. Beginning with an empty schedule, activities are added to the schedule one at a time, taking into consideration the placement of the activities already on the timeline and the resources that have been reserved for them. The order that the activities are added to the timeline and their location on the timeline are controlled by selection and placement commands invoked by the user. The order that activities are added to the timeline and their location are independent. The COMPASS code library is a cost effective platform for the development of new scheduling applications. It can be effectively used off the shelf for compatible scheduling applications or it can be used as a parts library for the development of custom scheduling systems.

Fox, Barry R.↗

Operations mission planner beyond the baseline

The scheduling of Space Station Freedom must satisfy four major requirements. It must ensure efficient housekeeping operations, maximize the collection of science, respond to changes in tasking and available resources, and accommodate the above changes in a manner that minimizes disruption of the ongoing operations of the station. While meeting these requirements the scheduler must cope with the complexity, scope, and flexibility of SSF operations. This requires the scheduler to deal with an astronomical number of possible schedules. The Operations Mission Planner (OMP) is centered around minimally disruptive replanning and the use of heuristics limit search in scheduling. OMP has already shown several artificial intelligence based scheduling techniques such as Interleaved Iterative Refinement and Bottleneck Identification using Process Chronologies.

Biefeld, Eric↗

A practical approach to astronomy mission replanning

The schedule editing concept called EDTRON is presented and its features and functions in the overall mission planning scheme and the experience obtained from its first use during the Astro-1 mission are presented. This EDTRON program was designed specifically to edit the astronomy schedules generated by the ASTAR project, but any schedule with the same on/off format can be successfully changed. Though designed for the real-time environment concept, it can also be employed premission for schedule modification in situations where elements of the baseline schedule need to be preserved or when new requirements emerge that cannot be defined in existing scheduling algorithms.

Guffin, O. T.↗

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↗

Real-time design with peer tasks

We introduce a real-time design methodology for large scale, distributed, parallel architecture, real-time systems (LDPARTS), as an alternative to those methods using rate or dead-line monotonic analysis. In our method the fundamental units of prioritization, work items, are domain specific objects with timing requirements (deadlines) found in user's specification. A work item consists of a collection of tasks of equal priority. Current scheduling theories are applied with artifact deadlines introduced by the designer whereas our method schedules work items to meet user's specification deadlines (sometimes called end-to-end deadlines). Our method supports these scheduling properties. Work item scheduling is based on domain specific importance instead of task level urgency and still meets as many user specification deadlines as can be met by scheduling tasks with respect to urgency. Second, the minimum (closest) on-line deadline that can be guaranteed for a work item of highest importance, scheduled at run time, is approximately the inverse of the throughput, measured in work items per second. Third, throughput is not degraded during overload and instead of resorting to task shedding during overload, the designer can specify which work items to shed. We prove these properties in a mathematical model.

Goforth, Andre↗

Explicit and Implicit Resources: A Simplified Approach to User Requirements Modeling

The International Space Station (ISS) program is dependent on the concept of distributed planning, which places a large responsibility in the hands of the science users. The users assume the responsibility in submitting the operations scheduling requirements in the format required by the scheduling software. The concept of explicit and implicit resources, developed to facilitate the operations scheduling of ISS by non-scheduling experts, is presented. The proposed concepts are defined and examples of scheduling requirements, implemented using explicit and implicit resources, are described together with the requirements modeling and scheduler formatting functions. The software developed to support the implicit and explicit resources concept is discussed.

Hagopian, Jeff↗

Science Planning for Multi-Spacecraft Coordinated Observations

Fulfilling the promise of an era of great observatories, NASA now has more than three space-based astronomical telescopes operating in different wavebands. This situation provides astronomers with a unique opportunity to simultaneously observe with multiple observatories. Yet scheduling multiple observatories simultaneously is highly inefficient when compared to single observatory observations. Thus, programs using multiple observatories are limited not due to scientific restrictions, but due to operational inefficiencies. Each year, a number of proposals are accepted by a space-based observatory for conduction of astronomical observations and gathering of science data for the study of galactic events. Since each space-based observatory uses a set of instruments designed to operate in specific energy regions, most such studies are conducted by submitting observation proposals to multiple observatories, with requests to coordinate among themselves. To assure that the proposed observations can be scheduled, each observatory's staff has to check that the observations are valid and meet all the constraints for their own observatory; in addition, they have to verify that the observations satisfy the constraints of the other observatories. Thus, coordinated observations require painstaking manual collaboration among the observatory staff at each observatory. In order to exploit new paradigms for observatory operation, the Goddard Space Flight Center's Advanced Architectures and Automation Branch has developed a prototype tool called the Visual Observation Layout Tool (VOLT). The main objective of VOLT is to provide a visual tool to automate the science planning of coordinated observations for multiple spacecraft, as well as to increase the scheduling probability of observations. However, VOLT is also useful for single observatory planning to optimize observatory control. Three space-based missions are interested in using VOLT (the Hubble Space Telescope, the Chandra X-Ray Observatory, and the Far Ultraviolet Spectroscopic Explorer). The VOLT team members have collaborated with these missions to gather requirements and obtain feedback on their mission planning processes. VOLT has been developed as a cross-platform Java client application for use by scientists and observatory science planning staff to visualize scheduling options and constraints. It also supports a lightweight graphical user interface for remote viewing via a Web front end. Additionally, it uniquely supports the ability to interact with multiple, diverse scheduling packages in order to determine windows of opportunity for observations and visually portray the constraints of each observation request. VOLT enables science data capture scenarios which are currently either impossible, or which require extensive time and manpower to coordinate amongst multiple observatories. it supports early detection of planning conflicts by generating coordinated solutions based on observatory schedulability and constraints. The project development approach has included frequent prototype demonstrations to our interested missions to obtain feedback after each release of the software. We will present an overview of our lessons learned in infusing the VOLT tool into the operations of the missions we have collaborated with and a brief demonstration of the software.

Maks, Lori↗

A System for Planning Ahead

A software system that uses artificial intelligence techniques to help with complex Space Shuttle scheduling at Kennedy Space Center is commercially available. Stottler Henke Associates, Inc.(SHAI), is marketing its automatic scheduling system, the Automated Manifest Planner (AMP), to industries that must plan and project changes many different times before the tasks are executed. The system creates optimal schedules while reducing manpower costs. Using information entered into the system by expert planners, the system automatically makes scheduling decisions based upon resource limitations and other constraints. It provides a constraint authoring system for adding other constraints to the scheduling process as needed. AMP is adaptable to assist with a variety of complex scheduling problems in manufacturing, transportation, business, architecture, and construction. AMP can benefit vehicle assembly plants, batch processing plants, semiconductor manufacturing, printing and textiles, surface and underground mining operations, and maintenance shops. For most of SHAI's commercial sales, the company obtains a service contract to customize AMP to a specific domain and then issues the customer a user license.

Source record↗

Power Management for Space Advanced Life Support

Space power systems include the power source, storage, and management subsystems. In current crewed spacecraft, solar cells are the power source, batteries provide storage, and the crew performs any required load scheduling. For future crewed planetary surface systems using Advanced Life Support, we assume that plants will be grown to produce much of the crew's food and that nuclear power will be employed. Battery storage is much more costly than nuclear power capacity and so is not likely to be used. We investigate the scheduling of power demands by the crew or automatic control, to reduce the peak power load and the required generating capacity. The peak to average power ratio is a good measure of power use efficiency. We can easily schedule power demands to reduce the peak power from its maximum, but simple scheduling approaches may not find the lowest possible peak to average power ratio. An initial power scheduling example was simple enough for a human to solve, but a more complex example with many intermittent load demands required automatic scheduling. Excess power is a free resource and can be used even for minor benefits.

Jones, Harry↗