Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS2009

A Mixed Integer Linear Program for Airport Departure Scheduling

Aircraft departing from an airport are subject to numerous constraints while scheduling departure times. These constraints include wake-separation constraints for successive departures, miles-in-trail separation for aircraft bound for the same departure fixes, and time-window or prioritization constraints for individual flights. Besides these, emissions as well as increased fuel consumption due to inefficient scheduling need to be included. Addressing all the above constraints in a single framework while allowing for resequencing of the aircraft using runway queues is critical to the implementation of the Next Generation Air Transport System (NextGen) concepts. Prior work on airport departure scheduling has addressed some of the above. However, existing methods use pre-determined runway queues, and schedule aircraft from these departure queues. The source of such pre-determined queues is not explicit, and could potentially be a subjective controller input. Determining runway queues and scheduling within the same framework would potentially result in better scheduling. This paper presents a mixed integer linear program (MILP) for the departure-scheduling problem. The program takes as input the incoming sequence of aircraft for departure from a runway, along with their earliest departure times and an optional prioritization scheme based on time-window of departure for each aircraft. The program then assigns these aircraft to the available departure queues and schedules departure times, explicitly considering wake separation and departure fix restrictions to minimize total delay for all aircraft. The approach is generalized and can be used in a variety of situations, and allows for aircraft prioritization based on operational as well as environmental considerations. We present the MILP in the paper, along with benefits over the first-come-first-serve (FCFS) scheme for numerous randomized problems based on real-world settings. The MILP results in substantially reduced delays as compared to FCFS, and the magnitude of the savings depends on the queue and departure fix structure. The MILP assumes deterministic aircraft arrival times at the runway queues. However, due to taxi time uncertainty, aircraft might arrive either earlier or later than these deterministic times. Thus, to incorporate this uncertainty, we present a method for using the MILP with "overlap discounted rolling planning horizon". The approach is based on valuing near-term decision results more than future ones. We develop a model of taxitime uncertainty based on real-world data, and then compare the baseline FCFS delays with delays using the above MILP in a simple rolling-horizon method and in the overlap discounted scheme.

Gupta, Gautam↗
NASA NTRS2010

Timeline-Based Space Operations Scheduling with External Constraints

We describe a timeline-based scheduling algorithm developed for mission operations of the EO-1 earth observing satellite. We first describe the range of operational constraints for operations focusing on maneuver and thermal constraints that cannot be modeled in typical planner/schedulers. We then describe a greedy heuristic scheduling algorithm and compare its performance to both the prior scheduling algorithm - documenting an over 50% increase in scenes scheduled with estimated value of millions of dollars US. We also compare to a relaxed optimal scheduler showing that the greedy scheduler produces schedules with scene count within 15% of an upper bound on optimal schedules.

Chien, Steve↗
NASA NTRS2020

Ground-Based Automated Scheduling for the Mars 2020 Rover

The Mars 2020 Rover Mission will be using an automated ground-based scheduling system called Copilot to schedule the rover’s activities at landing. Using automated scheduling technology will allow for plans to be generated more quickly. Because automated scheduling tools have not been widely used for prior rover missions, developing users’ trust in the system is crucial. An explainable scheduling tool called Crosscheck has been developed to visualize the creation of a schedule, and to explain why activities failed to schedule given their constraints. This will allow science planners to change activity constraints to allow failed activities to successfully schedule, achieving their science goals.

Towey, S.↗
NASA NTRS2021

Scheduling the NASA Deep Space Network with Deep Reinforcement Learning

With three complexes spread evenly across the Earth, NASA’s Deep Space Network (DSN) is the primary means of communications as well as a significant scientific instrument for dozens of active missions around the world. A rapidly rising number of spacecraft and increasingly complex scientific instruments with higher bandwidth requirements have resulted in demand that exceeds the network’s capacity across its 12 antennae. The existing DSN scheduling process operates on a rolling weekly basis and is time-consuming; for a given week, generation of the final baseline schedule of spacecraft tracking passes takes roughly 5 months from the initial requirements submission deadline, with several weeks of peer-to-peer negotiations in between. This paper proposes a deep reinforcement learning (RL) approach to generate candidate DSN schedules from mission requests and spacecraft ephemeris data with demonstrated capability to address real-world operational constraints. A deep RL agent is developed that takes mission requests for a given week as input, and interacts with a DSN scheduling environment to allocate tracks such that its reward signal is maximized. A comparison is made between an agent trained using Proximal Policy Optimization and its random, untrained counterpart. The results represent a proof-of-concept that, given a well-shaped reward signal, a deep RL agent can learn the complex heuristics used by experts to schedule the DSN. A trained agent can potentially be used to generate candidate schedules to bootstrap the scheduling process and thus reduce the turnaround cycle for DSN scheduling.

Wilson, Brian↗
NASA NTRS2022

Foraging with MUSHROOMS: A Mixed-integer Linear Programming Scheduler for Multimessenger Target of Opportunity Searches with the Zwicky Transient Facility

Electromagnetic follow-up of gravitational-wave detections is very resource intensive, taking up hours of limited observation time on dozens of telescopes. Creating more efficient schedules for follow-up will lead to a commensurate increase in counterpart location efficiency without using more telescope time. Widely used in operations research and telescope scheduling, mixed-integer linear programming is a strong candidate to produce these higher-efficiency schedules, as it can make use of powerful commercial solvers that find globally optimal solutions to provided problems. We detail a new target-of-opportunity scheduling algorithm designed with Zwicky Transient Facility in mind that uses mixed-integer linear programming. We compare its performance to gwemopt, the tuned heuristic scheduler used by the Zwicky Transient Facility and other facilities during the third LIGO–Virgo gravitational-wave observing run. This new algorithm uses variable-length observing blocks to enforce cadence requirements and to ensure field observability, along with having a secondary optimization step to minimize slew time. We show that by employing a hybrid method utilizing both this scheduler and gwemopt, the previous scheduler used, in concert, we can achieve an average improvement in detection efficiency of 3%–11% over gwemopt alone for a simulated binary neutron star merger data set consistent with LIGO–Virgo's third observing run, highlighting the potential of mixed-integer target of opportunity schedulers for future multimessenger follow-up surveys.

B Parazin↗
NASA NTRSDate not supplied

Astronaut Sleep Duration Varies by Timing of Scheduled Sleep

INTRODUCTION: Studies find that humans average approximately six hours of sleep per night in space, which is less than they sleep on Earth. Such short sleep duration has been associated with reduced alertness and performance in space. It is unclear whether this sleep loss is related to modifiable factors, such as irregular scheduling, poor sleep environment, and excessive workload or due to features of spaceflight that alter physiology (e.g., microgravity). Recent missions have afforded crew better, more stable sleep and work schedules, and an improved sleep environment. Despite these improvements, schedules do still vary enough to cause decrements in sleep duration. METHODS: Crewmembers (n = 19) who volunteered for the NASA Standard Measures protocol between January 2019 and March 2022 were provided with actiwatches (Phillips, Respironics, Bend OR) that they wore for two bouts of data collection lasting two weeks each before flight (at approximately L-270 and L-180), either continuously (n = 9) or for two weeks every two months while in space (n = 10), and for seven days postflight, immediately upon return to Earth (R+0). A regularly scheduled (or “nominal”) sleep episode would take place between the hours of 9:30pm and 6:00am. We looked at sleep outcomes (sleep duration, wake after sleep onset [WASO], sleep efficiency) depending on the distance from nominal sleep offset to see whether scheduled sleep period affected sleep durations and other metrics of sleep quality. RESULTS: Crewmembers provided data from 402 nights preflight, 2,137 nights inflight, and 275 nights postflight. They averaged 7.33 hours of sleep per night (± 1.16, SD) in space. Though this was significantly less sleep than they achieved preflight (7.87 ± 1.10) or postflight (7.75 ± 1.43, p < .01), this duration of sleep meets the recommended amount for optimal human health and well-being. For every hour after the nominal sleep period a crewmember woke up, their total sleep increased by 25 minutes (up to 5 hours). CONCLUSIONS: We conclude that humans are capable of achieving sufficient sleep in space, especially when their schedules afford adequate sleep (namely, schedules that phase delay rather than advance). Future studies are needed to determine whether microgravity impacts sleep architecture and sleep quality. Going forward, it is imperative that crewmembers are provided with stable schedules, with moderate workload, and environments that are conducive to sleep.

fatigue↗
NASA NTRSDate not supplied

Validation of Self-Scheduling Countermeasures in NASA's HERA Campaign 6

Enhancing crew capabilities for planning and scheduling activities is critical for periods of increased crew autonomy in future long-duration missions where communication delays preclude real-time ground support from Earth. Our study focuses on how to empower astronauts to manage their timelines independently from the experts in the mission control center (MCC). Our objective was to evaluate the impact of scheduling countermeasures on crew scheduling performance, workload, and usability in an analog mission environment. The study involved 16 crew members across four missions in the Limited Autonomy phase of Human Exploration Research Analog (HERA) Campaign 6. Crew members used Playbook to schedule one operational day for the entire crew. Half the participants accessed scheduling aids, and we compared their performance to a control group with no aids. Performance, workload, and usability were assessed using time on task, violation counts, NASA Task Load Index (NASA-TLX), and System Usability Scale (SUS). Participants using scheduling aids completed sessions 20% faster and committed 33% fewer violations. While these differences were not statistically significant due to the study’s operational limitations, trends indicate that scheduling aids may reduce errors and improve efficiency. These results can inform the design of scheduling tools to enhance astronauts’ autonomy in long-duration space missions, contributing to improved crew performance and reduced reliance on ground support.

space robotics↗
NASA NTRSDate not supplied

Validation of Self-Scheduling Countermeasures in NASA's HERA Campaign 6

Enhancing crew capabilities for planning and scheduling activities is critical for periods of increased crew autonomy in future long-duration missions where communication delays preclude real-time ground support from Earth. Our study focuses on how to empower astronauts to manage their timelines independently from the experts in the mission control center (MCC). Our objective was to evaluate the impact of scheduling countermeasures on crew scheduling performance, workload, and usability in an analog mission environment. The study involved 16 crew members across four missions in the Limited Autonomy phase of Human Exploration Research Analog (HERA) Campaign 6. Crew members used Playbook to schedule one operational day for the entire crew. Half the participants accessed scheduling aids, and we compared their performance to a control group with no aids. Performance, workload, and usability were assessed using time on task, violation counts, NASA Task Load Index (NASA-TLX), and System Usability Scale (SUS). Participants using scheduling aids completed sessions 20% faster and committed 33% fewer violations. While these differences were not statistically significant due to the study’s operational limitations, trends indicate that scheduling aids may reduce errors and improve efficiency. These results can inform the design of scheduling tools to enhance astronauts’ autonomy in long-duration space missions, contributing to improved crew performance and reduced reliance on ground support.

space robotics↗
NASA NTRS2013

Supporting Real-Time Operations and Execution through Timeline and Scheduling Aids

Since 2003, the NASA Ames Research Center has been actively involved in researching and advancing the state-of-the-art of planning and scheduling tools for NASA mission operations. Our planning toolkit SPIFe (Scheduling and Planning Interface for Exploration) has supported a variety of missions and field tests, scheduling activities for Mars rovers as well as crew on-board International Space Station and NASA earth analogs. The scheduled plan is the integration of all the activities for the day/s. In turn, the agents (rovers, landers, spaceships, crew) execute from this schedule while the mission support team members (e.g., flight controllers) follow the schedule during execution. Over the last couple of years, our team has begun to research and validate methods that will better support users during realtime operations and execution of scheduled activities. Our team utilizes human-computer interaction principles to research user needs, identify workflow processes, prototype software aids, and user test these. This paper discusses three specific prototypes developed and user tested to support real-time operations: Score Mobile, Playbook, and Mobile Assistant for Task Execution (MATE).

scheduling↗
NASA NTRS2016

Separation Assurance and Scheduling Coordination in the Arrival Environment

Separation assurance (SA) automation has been proposed as either a ground-based or airborne paradigm. The arrival environment is complex because aircraft are being sequenced and spaced to the arrival fix. This paper examines the effect of the allocation of the SA and scheduling functions on the performance of the system. Two coordination configurations between an SA and an arrival management system are tested using both ground and airborne implementations. All configurations have a conflict detection and resolution (CD&R) system and either an integrated or separated scheduler. Performance metrics are presented for the ground and airborne systems based on arrival traffic headed to Dallas/ Fort Worth International airport. The total delay, time-spacing conformance, and schedule conformance are used to measure efficiency. The goal of the analysis is to use the metrics to identify performance differences between the configurations that are based on different function allocations. A surveillance range limitation of 100 nmi and a time delay for sharing updated trajectory intent of 30 seconds were implemented for the airborne system. Overall, these results indicate that the surveillance range and the sharing of trajectories and aircraft schedules are important factors in determining the efficiency of an airborne arrival management system. These parameters are not relevant to the ground-based system as modeled for this study because it has instantaneous access to all aircraft trajectories and intent. Creating a schedule external to the CD&R and the scheduling conformance system was seen to reduce total delays for the airborne system, and had a minor effect on the ground-based system. The effect of an external scheduler on other metrics was mixed.

function allocation↗
NASA NTRS2015

Human Factors Assessment of Disturbances to Scheduled Performance-Based Navigation Arrival Operations

The introduction of Performance-Based Navigation (PBN) specifications to air traffic management has resulted in many benefits during nominal operations, including shorter flight paths, reduced fuel costs, and improved terminal area arrival rates. However, these benefits become less noticeable during off-nominal operations where aircraft are routinely interrupted from staying on PBN procedures due to disturbances such as missed approaches. This human-in-the-loop (HITL) study used multiple types of disturbance events to perturb the arrival schedule. Perturbed schedules were managed with different types of schedule adjustments, including a condition with no adjustments. The study collected data on a host of dependent variables, including human factors measures on controller workload and system performance measures such as schedule nonconformance (nc). Initial analyses showed strong correlations between aggregated controller workload and aggregated nc, as well as benefits of both automatic and manual schedule adjustments for increasing system performance, such as reduced PBN procedure interruptions. The goal of this paper is to further test these initial findings. The results indicated that an increase in schedule nonconformance correlated with an increase in controller workload at specific time intervals, and automated schedule adjustments consistently reduced controller workload associated with nonconformance.

Human factors↗
NASA NTRSDate not supplied

Towards a Characterization of Scheduling Task Complexity

Future long-duration missions will require astronauts to act more autonomously, manage their schedules, and replan timelines as anomalies and discoveries occur. Astronauts are not professional planners, however, and the complexity of schedules that novice planners can complete successfully is not fully understood. To identify the primary factors which contribute to scheduling task complexity, we conducted a human-in-the-loop study and developed planning algorithms to investigate how the type and amount of constraints affect the difficulty of scheduling and rescheduling. We created rankings of difficulty using a combination of human performance metrics from experimental planning tasks and metrics describing the final plans that participants scheduled. Using the results of our scheduling and rescheduling algorithm algorithms, we created a similar ranking with which to compare. We created rankings which compared well between the experimental and algorithm results for the scheduling task, but the rescheduling task proved more difficult to estimate.

scheduling↗
NASA NTRSDate not supplied

Towards a Characterization of Scheduling Task Complexity

Future long-duration missions will require astronauts to act more autonomously, manage their schedules, and replan timelines as anomalies and discoveries occur. Astronauts are not professional planners, however, and the complexity of schedules that novice planners can complete successfully is not fully understood. To identify the primary factors which contribute to scheduling task complexity, we conducted a human-in-the-loop study and developed planning algorithms to investigate how the type and amount of constraints affect the difficulty of scheduling and rescheduling. We created rankings of difficulty using a combination of human performance metrics from experimental planning tasks and metrics describing the final plans that participants scheduled. Using the results of our scheduling and rescheduling algorithm algorithms, we created a similar ranking with which to compare. We created rankings which compared well between the experimental and algorithm results for the scheduling task, but the rescheduling task proved more difficult to estimate.

scheduling↗
NASA NTRS1980

Scheduler software for tracking and data relay satellite system loading analysis: User manual and programmer guide

A user guide and programmer documentation is provided for a system of PRIME 400 minicomputer programs. The system was designed to support loading analyses on the Tracking Data Relay Satellite System (TDRSS). The system is a scheduler for various types of data relays (including tape recorder dumps and real time relays) from orbiting payloads to the TDRSS. Several model options are available to statistically generate data relay requirements. TDRSS time lines (representing resources available for scheduling) and payload/TDRSS acquisition and loss of sight time lines are input to the scheduler from disk. Tabulated output from the interactive system includes a summary of the scheduler activities over time intervals specified by the user and overall summary of scheduler input and output information. A history file, which records every event generated by the scheduler, is written to disk to allow further scheduling on remaining resources and to provide data for graphic displays or additional statistical analysis.

Craft, R.↗
NASA NTRS1990

SURE (Science User Resource Expert): A science planning and scheduling assistant for a resource based environment

SURE (Science User Resource Expert) is one of three components that compose the SURPASS (Science User Resource Planning and Scheduling System). This system is a planning and scheduling tool which supports distributed planning and scheduling, based on resource allocation and optimization. Currently SURE is being used within the SURPASS by the UARS (Upper Atmospheric Research Satellite) SOLSTICE instrument to build a daily science plan and activity schedule and in a prototyping effort with NASA GSFC to demonstrate distributed planning and scheduling for the SOLSTICE II instrument on the EOS platform. For the SOLSTICE application the SURE utilizes a rule-based system. Development of a rule-based program using Ada CLIPS as opposed to using conventional programming, allows for capture of the science planning and scheduling heuristics in rules and provides flexibility in inserting or removing rules as the scientific objectives and mission constraints change. The SURE system's role as a component in the SURPASS, the purpose of the SURE planning and scheduling tool, the SURE knowledge base, and the software architecture of the SURE component are described.

Thalman, Nancy E.↗
NASA NTRS1991

Guaranteed properties of gain scheduled control for linear parameter-varying plants

Gain scheduling has proven to be a successful design methodology in many engineering applications. However, in the absence of a sound theoretical analysis, these designs come with no guarantees on the robustness, performance, or even nominal stability of the overall gain scheduled design. This paper presents such an analysis for one type of gain scheduled system, namely, a linear parameter-varying plant scheduling on its exogenous parameters. Conditions are given which guarantee that the stability, robustness, and performance properties of the fixed operating point designs carry over to the global gain scheduled design. These conditions confirm and formalize popular notions regarding gain scheduled design, such as the scheduling variable should 'vary slowly'.

Shamma, Jeff S.↗
NASA NTRS1992

SLS-PLAN-IT: A knowledge-based blackboard scheduling system for Spacelab life sciences missions

The primary scheduling tool in use during the Spacelab Life Science (SLS-1) planning phase was the operations research (OR) based, tabular form Experiment Scheduling System (ESS) developed by NASA Marshall. PLAN-IT is an artificial intelligence based interactive graphic timeline editor for ESS developed by JPL. The PLAN-IT software was enhanced for use in the scheduling of Spacelab experiments to support the SLS missions. The enhanced software SLS-PLAN-IT System was used to support the real-time reactive scheduling task during the SLS-1 mission. SLS-PLAN-IT is a frame-based blackboard scheduling shell which, from scheduling input, creates resource-requiring event duration objects and resource-usage duration objects. The blackboard structure is to keep track of the effects of event duration objects on the resource usage objects. Various scheduling heuristics are coded in procedural form and can be invoked any time at the user's request. The system architecture is described along with what has been learned with the SLS-PLAN-IT project.

Kao, Cheng-Yan↗
NASA NTRS1992

Autonomous power system: Integrated scheduling

The Autonomous Power System (APS) project at NASA Lewis Research Center is designed to demonstrate the abilities of integrated intelligent diagnosis, control and scheduling techniques to space power distribution hardware. The project consists of three elements: the Autonomous Power Expert System (APEX) for fault diagnosis, isolation, and recovery (FDIR), the Autonomous Intelligent Power Scheduler (AIPS) to determine system configuration, and power hardware (Brassboard) to simulate a space-based power system. Faults can be introduced into the Brassboard and in turn, be diagnosed and corrected by APEX and AIPS. The Autonomous Intelligent Power Scheduler controls the execution of loads attached to the Brassboard. Each load must be executed in a manner that efficiently utilizes available power and satisfies all load, resource, and temporal constraints. In the case of a fault situation on the Brassboard, AIPS dynamically modifies the existing schedule in order to resume efficient operation conditions. A database is kept of the power demand, temporal modifiers, priority of each load, and the power level of each source. AIPS uses a set of heuristic rules to assign start times and resources to each load based on load and resource constraints. A simple improvement engine based upon these heuristics is also available to improve the schedule efficiency. This paper describes the operation of the Autonomous Intelligent Power Scheduler as a single entity, as well as its integration with APEX and the Brassboard. Future plans are discussed for the growth of the Autonomous Intelligent Power Scheduler.

Ringer, Mark J.↗