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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Concepts in Distributed Scheduling and Control

To support instrument and experiment operations effectively in the Space Station era, planning, scheduling and control must allow for: interactive, realtime, remote operations; responsive scheduling and rescheduling; support of the full range of distributed science, application and commercial users; interaction and cooperation among distributed users; and efficient use of on-board, communications, and ground-based resources. We suggest conceptual and managerial approaches that address these needs. Specifically, we describe an approach to distributed planning, scheduling and control functions that is based on resources and on a distributed knowledge hierarchy. We describe these functions as components of an integrated management system. We discuss automated scheduling assistants and integration of planning and scheduling functions with realtime operations control. The suggested approach, taken from a users' point-of-view, has resulted in the Science User Resource Planning and Scheduling System (SURPASS). In this paper, we describe the major components of SURPASS and discuss the features of this innovative prototype. Further ideas concerning instrument planning, scheduling, and control may be found in the Space Station Instrument Control System Study.

Hansen, Elaine R.↗
NASA NTRS2011

Mission Operations Planning and Scheduling System (MOPSS)

MOPSS is a generic framework that can be configured on the fly to support a wide range of planning and scheduling applications. It is currently used to support seven missions at Goddard Space Flight Center (GSFC) in roles that include science planning, mission planning, and real-time control. Prior to MOPSS, each spacecraft project built its own planning and scheduling capability to plan satellite activities and communications and to create the commands to be uplinked to the spacecraft. This approach required creating a data repository for storing planning and scheduling information, building user interfaces to display data, generating needed scheduling algorithms, and implementing customized external interfaces. Complex scheduling problems that involved reacting to multiple variable situations were analyzed manually. Operators then used the results to add commands to the schedule. Each architecture was unique to specific satellite requirements. MOPSS is an expert system that automates mission operations and frees the flight operations team to concentrate on critical activities. It is easily reconfigured by the flight operations team as the mission evolves. The heart of the system is a custom object-oriented data layer mapped onto an Oracle relational database. The combination of these two technologies allows a user or system engineer to capture any type of scheduling or planning data in the system's generic data storage via a GUI.

Wood, Terri↗
NASA NTRS2015

Assessment of New Load Schedules for the Machine Calibration of a Force Balance

New load schedules for the machine calibration of a six-component force balance are currently being developed and evaluated at the NASA Ames Balance Calibration Laboratory. One of the proposed load schedules is discussed in the paper. It has a total of 2082 points that are distributed across 16 load series. Several criteria were applied to define the load schedule. It was decided, for example, to specify the calibration load set in force balance format as this approach greatly simplifies the definition of the lower and upper bounds of the load schedule. In addition, all loads are assumed to be applied in a calibration machine by using the one-factor-at-a-time approach. At first, all single-component loads are applied in six load series. Then, three two-component load series are applied. They consist of the load pairs (N1, N2), (S1, S2), and (RM, AF). Afterwards, four three-component load series are applied. They consist of the combinations (N1, N2, AF), (S1, S2, AF), (N1, N2, RM), and (S1, S2, RM). In the next step, one four-component load series is applied. It is the load combination (N1, N2, S1, S2). Finally, two five-component load series are applied. They are the load combination (N1, N2, S1, S2, AF) and (N1, N2, S1, S2, RM). The maximum difference between loads of two subsequent data points of the load schedule is limited to 33 % of capacity. This constraint helps avoid unwanted load "jumps" in the load schedule that can have a negative impact on the performance of a calibration machine. Only loadings of the single- and two-component load series are loaded to 100 % of capacity. This approach was selected because it keeps the total number of calibration points to a reasonable limit while still allowing for the application of some of the more complex load combinations. Data from two of NASA's force balances is used to illustrate important characteristics of the proposed 2082-point calibration load schedule.

wind tunnel testing↗
NASA NTRS2014

Automated Scheduling of Personnel to Staff Operations for the Mars Science Laboratory

Leveraging previous work on scheduling personnel for space mission operations, we have adapted ASPEN (Activity Scheduling and Planning Environment) [1] to the domain of scheduling personnel for operations of the Mars Science Laboratory. Automated scheduling of personnel is not new. We compare our representations to a sampling of employee scheduling systems available with respect to desired features. We described the constraints required by MSL personnel schedulers and how each is handled by the scheduling algorithm.

MSL↗
NASA NTRS2017

Systematic Hybrid Network Scheduling for Multiple Traffic Classes with Host Timing and Phase Constraints

Systems and methods for systematic hybrid network scheduling for multiple traffic classes with host timing and phase constraints are provided. In certain embodiments, a method of scheduling communications in a network comprises scheduling transmission of virtual links pertaining to a first traffic class on a global schedule to coordinate transmission of the virtual links pertaining to the first traffic class across all transmitting end stations on the global schedule; and scheduling transmission of each virtual link pertaining to a second traffic class on a local schedule of the respective transmitting end station from which each respective virtual link pertaining to the second traffic class is transmitted such that transmission of each virtual link pertaining to the second traffic class is coordinated only at the respective end station from which each respective virtual link pertaining to the second traffic class is transmitted.

Varadarajan, Srivatsan↗
NASA NTRS2021

Scheduling and Operations of the Orbiting Carbon Observatory-3 Mission

This paper describes the development and use of an automated scheduling system for the National Aeronautics and Space Administration’s (NASA) Orbiting Carbon Observatory-3 (OCO-3) Mission. OCO-3 measures atmospheric carbon dioxide from space. Made from the spare instrument built as a backup to the Orbiting Carbon Observatory-2 (OCO-2), OCO-3 extends the rich set of data collected by OCO-2. OCO-3 is outfitted with an agile Pointing Mirror Assembly (PMA) that allows for more detailed types of observations and rapid mode transitions. The mission uses an adaptation of the Compressed Large-scale Activity Scheduling and Planning (CLASP) system for scheduling nominal operations, as well as a separate automated scheduling system developed for scheduling observations for the calibration of the PMA. CLASP is used to schedule the four types of observational modes: Nadir, Glint, Target, and Snapshot Area Map. OCO-3 has a variety of complex mission-specific geometric constraints that were incorporated into CLASP to produce schedules that ensure instrument safety.

Moy, Alan↗
NASA NTRS2021

Ground and Onboard Automated Scheduling for the Mars 2020 Rover Mission

The Mars 2020 Rover mission is using automated scheduling in two capacities. As of March 2021 a ground-based scheduler automatically schedules rover wake/sleep and preheats to support Mars 2020 daily operations. Included in the ground system is an explainable scheduling tool that allows users in-sight into the schedule developed by the automated scheduler. An onboard scheduler that will allow the rover autonomously better account for variations in execution is in development for use later in the mission.

Towey, Shannon↗
NASA NTRS2022

SatNet: A Benchmark for Satellite Scheduling Optimization

Satellites provide essential services such as networking and weather tracking, and the number of near-earth and deep space satellites are expected to grow rapidly in the coming years. Communications with terrestrial ground stations is one of the critical functionalities of any space mission. Satellite scheduling is a problem that has been scientifically investigated since the 1970s. A central aspect of this problem is the need to consider resource contention and satellite visibility constraints as they require line of sight. Due to the combinatorial nature of the problem, prior solutions such as linear programs and evolutionary algorithms require extensive compute capabilities to output a feasible schedule for each scenario. Machine learning based scheduling can provide an alternative solution by training a model with historical data and generating a schedule quickly with model inference. We present SatNet, a benchmark for satellite scheduling optimization based on historical data from the NASA Deep Space Network. We propose formulation of the satellite scheduling problem as a Markov Decision Process and use reinforcement learning (RL) policies to generate schedules. The nature of constraints imposed by SatNet differ from other combinatorial optimization problems such as vehicle routing studied in prior literature. Our initial results indicate that RL is an alternative optimization approach that can generate candidate solutions of comparable quality to existing state-of-the-practice results. However, we also find that RL policies overfit to the training dataset and do not generalize well to new data, thereby necessitating continued research on reusable and generalizable agents.

Wilson, Brian↗
DOE OSTI2019

Blended service schedule for a power generator

A power generation system includes a power generator operatively connected to a plurality of sensors and a processor. The processor is configured to observe usage-based or event-based data regarding one or more components and consumables of the power generator. A usage-based service schedule is observed for the one or more event-based components and consumables. Operation-based data is received from the plurality of sensors regarding the functioning of the power generation system and one or more operation-based components and consumables of the power generator. An operation-based service schedule is determined for the one or more operation-based components and consumables based on the operation-based data. A blended service schedule is generated, the blended service schedule including the usage-based service schedule and the operation-based service schedule. The blended service schedule is then provided to at least one of a local monitor or a remote monitor.

Keene, Kevin↗
DOE OSTI2023

Energy-efficient cooperative resource allocation and task scheduling for Internet of Things environments

Offloading Internet of Things (IoT) tasks to the cloud for further processing might not always lead to an optimal execution time, particularly in situations such as resource contention, under-provisioning, over-provisioning, and fragmentation. In addition, dynamically optimizing the number of Virtual Machines (VMs) for resource scheduling in order to meet application requirements remains a major research challenge. Further, existing resource scheduling algorithms focus primarily on minimizing operational costs while maximizing resource sharing and utilization. Considering energy utilization as part of the resource allocation and scheduling process as an optimization objective for maintaining load balancing has often been neglected. To address these challenges and more, we propose a cooperative energy-aware resource allocation and scheduling strategy based on a Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) multi-criteria decision-making method. Here we used the Grid Workloads Archive dataset to evaluate our proposed approach named TOPREAL. Experimental results with respect to the allocation of VM resources when considering processing a large segment of tasks indicate that TOPREAL outperforms existing algorithms in terms of energy savings, with an average improvement of 40.25%, while maintaining an average improvement of 16.21% when it comes to execution time. Results also demonstrate that our method can save an average of 78.06 processing hours and 63,215kJ of energy when compared to existing scheduling algorithms. These results demonstrate the effectiveness of our proposed model and the viability of using multi-criteria decision-making techniques such as TOPSIS to solve the resource allocation and scheduling problem in edge environments.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Numerical study of the effect of propped surface area and fracture conductivity on shale gas production: Application for multi-size proppant pumping schedule design

Hydraulic fracturing is a technique extensively used in the oil and gas industry, where water, proppant (sand) and additives are injected into unconventional reservoirs to enhance the recovery of shale hydrocarbon. Although some previous studies have developed pumping schedules that maximize gas production for a single-size proppant, there are very few studies that consider the effect of varying proppant diameters across pumping stages on shale gas production. Motivated by this, we carried out an extensive sensitivity analysis to determine the effect of different proppant diameters on the average fracture conductivity (FC), average propped surface area (PSA) and cumulative shale gas production volume. We found out that the cumulative shale gas production volume depends on both the average PSA and average FC. We also found out that small-diameter proppant resulted in higher average PSA and lower average FC, whereas large-diameter proppant resulted in lower average PSA and higher average FC. Hence, we designed a multi-size proppant pumping schedule considering both of these parameters into account for simultaneously propagating multiple fractures to maximize shale gas production from unconventional reservoirs. Since the size of injected proppant particles determines the average PSA and average FC for the propped hydraulic fractures, we developed a novel framework called Sequentially Interlinked Modeling Structure (SIMS) to predict the average PSA, average FC and cumulative shale gas production volume at the end of 10 years for a given pumping schedule. Then, we used this SIMS framework to obtain a multi-size proppant pumping schedule that maximizes shale gas production. In closing, we demonstrated that the obtained pumping schedule gives a cumulative shale gas production volume greater than the values obtained from the existing pumping schedules.

03 NATURAL GAS↗
DOE OSTI2020

Optimal charging scheduling and management for a fast-charging battery electric bus system

Herein we discuss how battery electric buses (BEBs) are rapidly being embraced by public transit agencies because of their environmental and economic benefits. To address the problems of limited driving range and time-consuming charging for BEBs, manufacturers have developed rapid on-route charging technology that utilizes typical layovers at terminals to charge buses in operation using high power. With on-route fast-charging, BEBs are as capable as their diesel counterparts in terms of range and operating time. However, on-route fast-charging makes it more challenging to schedule and manage charging events for a BEB system. First, on-route fast-charging may lead to high electricity power demand charges. Second, it may increase electricity energy charges because of charging that occurs during on-peak hours. Without careful charging scheduling and management, on-route fast-charging may significantly increase fuel costs and reduce the economic attractiveness of BEBs. The present study proposes a network modeling framework to optimize the charging scheduling and management for a fast-charging BEB system, effectively minimizing total charging costs. The charging schedule determines when to charge a BEB, while the charging management strategically controls the actual charging power. Charging costs include both electricity demand charges and energy charges. The charging scheduling and management problem is first formulated as a nonlinear nonconvex program with time-continuous variables. A discretizing method and a linear reformulation technique are then adopted to reformulate the model as a linear program, which can be easily solved using off-the-shelf solvers, even for large-scale problems. Finally, the model is demonstrated with extensive numerical studies based on two real-world bus networks. The results demonstrate that the proposed model can effectively determine the optimal charging scheduling and management for a fast-charging BEB system, which carries the potential for use in large-scale real-world bus networks.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS2012

Automating Mid- and Long-Range Scheduling for the NASA Deep Space Network

NASA has recently deployed a new mid-range scheduling system for the antennas of the Deep Space Network (DSN), called Service Scheduling Software, or S(sup 3). This system was designed and deployed as a modern web application containing a central scheduling database integrated with a collaborative environment, exploiting the same technologies as social web applications but applied to a space operations context. This is highly relevant to the DSN domain since the network schedule of operations is developed in a peer-to-peer negotiation process among all users of the DSN. These users represent not only NASA's deep space missions, but also international partners and ground-based science and calibration users. The initial implementation of S(sup 3) is complete and the system has been operational since July 2011. This paper describes some key aspects of the S(sup 3) system and on the challenges of modeling complex scheduling requirements and the ongoing extension of S(sup 3) to encompass long-range planning, downtime analysis, and forecasting, as the next step in developing a single integrated DSN scheduling tool suite to cover all time ranges.

Deep Space Network↗
NASA NTRS2016

The Business Change Initiative: A Novel Approach to Improved Cost and Schedule Management

Goddard Space Flight Center's Flight Projects Directorate employed a Business Change Initiative (BCI) to infuse a series of activities coordinated to drive improved cost and schedule performance across Goddard's missions. This sustaining change framework provides a platform to manage and implement cost and schedule control techniques throughout the project portfolio. The BCI concluded in December 2014, deploying over 100 cost and schedule management changes including best practices, tools, methods, training, and knowledge sharing. The new business approach has driven the portfolio to improved programmatic performance. The last eight launched GSFC missions have optimized cost, schedule, and technical performance on a sustained basis to deliver on time and within budget, returning funds in many cases. While not every future mission will boast such strong performance, improved cost and schedule tools, management practices, and ongoing comprehensive evaluations of program planning and control methods to refine and implement best practices will continue to provide a framework for sustained performance. This paper will describe the tools, techniques, and processes developed during the BCI and the utilization of collaborative content management tools to disseminate project planning and control techniques to ensure continuous collaboration and optimization of cost and schedule management in the future.

Schedule↗
NASA NTRS2018

Comparison of First-Come First-Served and Optimization Based Scheduling Algorithms for Integrated Departure and Arrival Management

Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA) are investigating scheduling algorithms that will be a part of an integrated arrival and departure management system. Inha University, one of the Korean collaborators of KARI, developed an Extended First-Come First-Served (EFCFS) algorithm that is robust and efficient. However, since the EFCFS algorithm sequentially computes the schedule based on priority, the end results may not be optimal for system efficiency. The approach based on Mixed Integer Linear Programming (MILP) originally developed by NASA and modified by KARI is known to produce better schedules at the expense of computational cost. In this paper, the two different scheduling approaches are compared using common traffic scenarios and constraints at Incheon International Airport. Capabilities to apply weight class based wake turbulence runway separation minima and Miles-in-Trail (MIT) restrictions at selected meter fixes are added to the previously developed EFCFS scheduler. Based on historic data, 40 departures and 20 arrivals are chosen in a one-hour period and 100 scenarios were created by randomly assigning gate numbers, gate departure times, and runway landing times. With the current runway separation requirements, MILP resulted in about ten to twenty percent smaller average delays depending on the constraints. With artificially increased separation minima, the difference between MILP and EFCFS became more noticeable. However, the EFCFS was about ten times faster with smaller variations among different scenarios and constraints. The comparison suggests that the MILP-based algorithm has a small advantage at the current traffic level; however, has potential to be more effective in higher demand or severe weather situations. The EFCFS algorithm may be better suited for real-time applications or investigating larger scale scheduling problems.

air traffic optimization↗
NASA NTRS2019

A Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System

The current system used by the FAA to schedule arrivals is the Traffic Based Flow Manager (TBFM). It is a centralized system that gives an operator (airline) no influence over scheduled times of arrival assigned to its flights. Future systems for managing arrival scheduling are proposed as distributed systems. Such a system is called upon to give operators influence to schedule and negotiate resources for their flights, and to resolve other technical challenges, such as eliminating a single point of failure. A distributed system for managing diverse air traffic will need the capability of computing a schedule for the given arriving flights in a way that complies with the operational constraints. This paper contributes an algorithm that computes such a schedule. Although developed as part of an effort toward a distributed system, the algorithm itself is neither inherently distributed nor inherently centralized and can be used in either type of system.

negotiation↗
NASA NTRS1993

(abstract) FASTER -- A Tool for DSN Forecasting and Scheduling

FASTER, the Forecasting And Scheduling Tool for Earth-based Resources is a suite of software tools developed at JPL to aid in the process of allocating DSN 70 and 34 meter antennas and equipment to support deep space satellites and ground based astronomy. FASTER has been designed for use by a diverse user community, including mid-level managers, data entry and analysis teams, and project scheduling personnel. The system helps to automate many of the previously labor intensive tasks and ensure proper analysis and consistency throughout all phases of the allocation process. FASTER implements an interactive environment for both forecasting and scheduling. This paper will discuss technical aspects of the FASTER system, including forecasting and scheduling algorithms, issues related to large scale use of a scheduling and forecasting system, implications to the process in which a forecasting and scheduling system is embedded, and lessons learned and implications to similar systems.

forecasting↗
NASA NTRS1993

FASTER -- A Tool for DSN Forecasting and Scheduling

FASTER (Forecasting And Scheduling Tool for Earth-based Resources) is a suite of tools designed for forecasting and scheduling of JPL's DSN. The DSN is a set of antennas and other associated resources that must be scheduled for satellite communications, astronomy, maintenance, and testing. FASTER is a MS-Windows based program that replaces two existing programs (RALPH and PC4CAST). FASTER was designed to be more flexible, maintainable, and user friendly. FASTER makes heavy use of commercial software to allow for customization by users. FASTER implements scheduling as a two pass process: the first pass calculates a predictive profile of resource utilization; the second pass uses this information to calculate a cost function used in a dynamic programming optimization step. This information allows the scheduler to "look ahead" at activities that are not as yet scheduled. FASTER has succeeded in allowing wider access to data and tools, reducing the amount of effort expended and increasing the quality of analysis.

forecasting↗