Search NASASearch

SEARCH · Search NASA

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 199 records · Page 11

Autonomous mission planning and scheduling: Innovative, integrated, responsive

Autonomous mission scheduling, a new concept for NASA ground data systems, is a decentralized and distributed approach to scientific spacecraft planning, scheduling, and command management. Systems and services are provided that enable investigators to operate their own instruments. In autonomous mission scheduling, separate nodes exist for each instrument and one or more operations nodes exist for the spacecraft. Each node is responsible for its own operations which include planning, scheduling, and commanding; and for resolving conflicts with other nodes. One or more database servers accessible to all nodes enable each to share mission and science planning, scheduling, and commanding information. The architecture for autonomous mission scheduling is based upon a realistic mix of state-of-the-art and emerging technology and services, e.g., high performance individual workstations, high speed communications, client-server computing, and relational databases. The concept is particularly suited to the smaller, less complex missions of the future.

Sary, Charisse

DTS: Building custom, intelligent schedulers

DTS is a decision-theoretic scheduler, built on top of a flexible toolkit -- this paper focuses on how the toolkit might be reused in future NASA mission schedulers. The toolkit includes a user-customizable scheduling interface, and a 'Just-For-You' optimization engine. The customizable interface is built on two metaphors: objects and dynamic graphs. Objects help to structure problem specifications and related data, while dynamic graphs simplify the specification of graphical schedule editors (such as Gantt charts). The interface can be used with any 'back-end' scheduler, through dynamically-loaded code, interprocess communication, or a shared database. The 'Just-For-You' optimization engine includes user-specific utility functions, automatically compiled heuristic evaluations, and a postprocessing facility for enforcing scheduling policies. The optimization engine is based on BPS, the Bayesian Problem-Solver (1,2), which introduced a similar approach to solving single-agent and adversarial graph search problems.

Hansson, Othar

Scheduling with genetic algorithms

In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

Fennel, Theron R.

Stochastic Modeling of Airlines' Scheduled Services Revenue

Airlines' revenue generated from scheduled services account for the major share in the total revenue. As such, predicting airlines' total scheduled services revenue is of great importance both to the governments (in case of national airlines) and private airlines. This importance stems from the need to formulate future airline strategic management policies, determine government subsidy levels, and formulate governmental air transportation policies. The prediction of the airlines' total scheduled services revenue is dealt with in this paper. Four key components of airline's scheduled services are considered. These include revenues generated from passenger, cargo, mail, and excess baggage. By addressing the revenue generated from each schedule service separately, air transportation planners and designers are able to enhance their ability to formulate specific strategies for each component. Estimation results clearly indicate that the four stochastic processes (scheduled services components) are represented by different Box-Jenkins ARIMA models. The results demonstrate the appropriateness of the developed models and their ability to provide air transportation planners with future information vital to the planning and design processes.

Hamed, M. M.

Stochastic Modeling of Airlines' Scheduled Services Revenue

Airlines' revenue generated from scheduled services account for the major share in the total revenue. As such, predicting airlines' total scheduled services revenue is of great importance both to the governments (in case of national airlines) and private airlines. This importance stems from the need to formulate future airline strategic management policies, determine government subsidy levels, and formulate governmental air transportation policies. The prediction of the airlines' total scheduled services revenue is dealt with in this paper. Four key components of airline's scheduled services are considered. These include revenues generated from passenger, cargo, mail, and excess baggage. By addressing the revenue generated from each schedule service separately, air transportation planners and designers arc able to enhance their ability to formulate specific strategies for each component. Estimation results clearly indicate that the four stochastic processes (scheduled services components) are represented by different Box-Jenkins ARIMA models. The results demonstrate the appropriateness of the developed models and their ability to provide air transportation planners with future information vital to the planning and design processes.

Hamed, M. M.

Job Scheduling Under the Portable Batch System

The typical batch queuing system schedules jobs for execution by a set of queue controls. The controls determine from which queues jobs may be selected. Within the queue, jobs are ordered first-in, first-run. This limits the set of scheduling policies available to a site. The Portable Batch System removes this limitation by providing an external scheduling module. This separate program has full knowledge of the available queued jobs, running jobs, and system resource usage. Sites are able to implement any policy expressible in one of several procedural language. Policies may range from "bet fit" to "fair share" to purely political. Scheduling decisions can be made over the full set of jobs regardless of queue or order. The scheduling policy can be changed to fit a wide variety of computing environments and scheduling goals. This is demonstrated by the use of PBS on an IBM SP-2 system at NASA Ames.

Henderson, Robert L.

Future Air Traffic Growth and Schedule Model User's Guide

The Future Air Traffic Growth and Schedule Model was developed as an implementation of the Fratar algorithm to project future traffic flow between airports in a system and of then scheduling the additional flights to reflect current passenger time-of-travel preferences. The methodology produces an unconstrained future schedule from a current (or baseline) schedule and the airport operations growth rates. As an example of the use of the model, future schedules are projected for 2010 and 2022 for all flights arriving at, departing from, or flying between all continental United States airports that had commercial scheduled service for May 17, 2002. Inter-continental US traffic and airports are included and the traffic is also grown with the Fratar methodology to account for their arrivals and departures to the continental US airports. Input data sets derived from the Official Airline Guide (OAG) data and FAA Terminal Area Forecast (TAF) are included in the examples of the computer code execution.

Kimmel, William M.

Future Air Traffic Growth and Schedule Model, Supplement

The Future Air Traffic Growth and Schedule Model was developed as an implementation of the Fratar algorithm to project future traffic flow between airports in a system and of then scheduling the additional flights to reflect current passenger time-of-travel preferences. The methodology produces an unconstrained future schedule from a current (or baseline) schedule and the airport operations growth rates. As an example of the use of the model, future schedules are projected for 2010 and 2022 for all flights arriving at, departing from, or flying between all continental United States airports that had commercial scheduled service for May 17, 2002. Inter-continental US traffic and airports are included and the traffic is also grown with the Fratar methodology to account for their arrivals and departures to the continental US airports. Input data sets derived from the Official Airline Guide (OAG) data and FAA Terminal Area Forecast (TAF) are included in the examples of the computer code execution.

Kimmel, William M.

Integration of On-board EOS Schedule Revision with Space Communication Emulation System

The need for on-board decision-making for planning science observations on Earth Observing Satellites is based on the fact that the desirability of acquiring an image can change dynamically, because of changes in meteorological conditions (e.g. cloud cover), unforeseen events such as fires, floods, or volcanic eruptions, or unexpected changes in satellite or ground station capability. In such cases, satellite resources, such as power and SSR capacity can potentially be better utilized taking another image that is of higher quality. Currently, typical Earth observing satellites cannot communicate directly with each other, and can only communicate with ground stations about 5% to 10% of the time. Because of the limited communication windows, as well as the cost and effort that would need to be expended in revising a mission schedule, a ground-based scheduler would have little or no opportunity to revise the schedule in response to the contingencies that may arise. For this reason, a distributed science planning system combining a ground-based scheduler with on-board schedule revision capabilities is warranted. This paper will describe algorithms for on-board decision-making for science planning and their integration with the advanced satellite control and communications technology developed at the Space Communication Emulation Facility (SCEF) at NASA Glenn Research Center. Our objective of demonstrating how advanced communications and scheduling technology can be combined to improve the scientific utility of images acquired by Earth observing systems will be discussed via a description of a number of realistic flight scenarios.

Khatib, Lina

Effects of restricted feeding schedules on circadian organization in squirrel monkeys

Free running circadian rhythms of motor activity, food-motivated lever-pressing, and either drinking (N = 7) or body temperature (N = 3) were recorded from 10 squirrel monkeys maintained in constant illumination with unlimited access to food. Food availability was then restricted to a single unsignaled 3-hour interval each day. The feeding schedule failed to entrain the activity rhythms of 8 monkeys, which continued to free-run. Drinking was almost completely synchronized by the schedule, while body temperature showed a feeding-induced rise superimposed on a free-running rhythm. Nonreinforced lever-pressing showed both a free-running component and a 24-hour component that anticipated the time of feeding. At the termination of the schedule, all recorded variables showed free-running rhythms, but in 3 animals the initial phase of the postschedule rhythms was advanced by several hours, suggesting relative coordination. Of the remaining 2 animals, one exhibited stable entrainment of all 3 recorded rhythms, while the other appeared to entrain temporarily to the feeding schedule. These results indicate that restricted feeding schedules are only a weak zeitgeber for the circadian pacemaker generating free-running rhythms in the squirrel monkey. Such schedules, however, may entrain a separate circadian system responsible for the timing of food-anticipatory changes in behavior and physiology.

Non-NASA Center

In-Space Crew-Collaborative Task Scheduling

For all past and current human space missions, the final scheduling of tasks to be done in space has been devoid of crew control, flexibility, and insight. Ground controllers, with minimal input from the crew, schedule the tasks and uplink the timeline to the crew or uplink the command sequences to the hardware. Prior to the International Space Station (ISS), the crew could make requests about tomorrow s timeline, they could omit a task, or they could request that something in the timeline be delayed. This lack of control over one's own schedule has had negative consequences. There is anecdotal consensus among astronauts that control over their own schedules will mitigate the stresses of long duration missions. On ISS, a modicum of crew control is provided by the job jar. Ground controllers prepare a task list (a.k.a. "job jar") of non-conflicting tasks from which jobs can be chosen by the in space crew. Because there is little free time and few interesting non-conflicting activities, the task-list approach provides little relief from the tedium of being micro-managed by the timeline. Scheduling for space missions is a complex and laborious undertaking which usually requires a large cadre of trained specialists and suites of complex software tools. It is a giant leap from today s ground prepared timeline (with a job jar) to full crew control of the timeline. However, technological advances, currently in-work or proposed, make it reasonable to consider scheduling a collaborative effort by the ground-based teams and the in-space crew. Collaboration would allow the crew to make minor adjustments, add tasks according to their preferences, understand the reasons for the placement of tasks on the timeline, and provide them a sense of control. In foreseeable but extraordinary situations, such as a quick response to anomalies and extended or unexpected loss of signal, the crew should have the autonomous ability to make appropriate modifications to the timeline, extend the timeline, or even start over with a new timeline. The Vision for Space Exploration (VSE), currently being pursued by the National Aeronautics and Space Administration (NASA), will send humans to Mars in a few decades. Stresses on the human mind will be exacerbated by the longer durations and greater distances, and it will be imperative to implement stress-reducing innovations such as giving the crew control of their daily activities.

Jaap, John

Prescribed Travel Schedules for Fatigue Management

The NASA Fatigue Management Team is developing recommendations for managing fatigue during travel and for shift work operations, as Clinical Practice Guidelines for the Management of Circadian Desynchrony in ISS Operations. The Guidelines provide the International Space Station (ISS ) flight surgeons and other operational clinicians with evidence-based recommendations for mitigating fatigue and other factors related to sleep loss and circadian desynchronization. As much international travel is involved both before and after flight, the guidelines provide recommendations for: pre-flight training, in-flight operations, and post-flight rehabilitation. The objective of is to standardize the process by which care is provided to crewmembers, ground controllers, and other support personnel such as trainers, when overseas travel or schedule shifting is required. Proper scheduling of countermeasures - light, darkness, melatonin, diet, exercise, and medications - is the cornerstone for facilitating circadian adaptation, improving sleep, enhancing alertness, and optimizing performance. The Guidelines provide, among other things, prescribed travel schedules that outline the specific implementation of these mitigation strategies. Each travel schedule offers evidence based protocols for properly using the NASA identified countermeasures for fatigue. This presentation will describe the travel implementation schedules and how these can be used to alleviate the effects of jet lag and/or schedule shifts.

Whitmire, Alexandra

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John

Design Principles and Algorithms for Air Traffic Arrival Scheduling

This report presents design principles and algorithms for building a real-time scheduler of arrival aircraft based on a first-come-first-served (FCFS) scheduling protocol. The algorithms provide the conceptual and computational foundation for the Traffic Management Advisor (TMA) of the Center/terminal radar approach control facilities (TRACON) automation system, which comprises a set of decision support tools for managing arrival traffic at major airports in the United States. The primary objective of the scheduler is to assign arrival aircraft to a favorable landing runway and schedule them to land at times that minimize delays. A further objective of the scheduler is to allocate delays between high-altitude airspace far away from the airport and low-altitude airspace near the airport. A method of delay allocation is described that minimizes the average operating cost in the presence of errors in controlling aircraft to a specified landing time. This report is a revision of an earlier paper first presented as part of an Advisory Group for Aerospace Research and Development (AGARD) lecture series in September 1995. The authors, during vigorous discussions over the details of this paper, felt it was important to the air-trafficmanagement (ATM) community to revise and extend the original 1995 paper, providing more detail and clarity and thereby allowing future researchers to understand this foundational work as the basis for the TMA's scheduling algorithms.

Center TRACON

Evolving Management Strategies to Improve NASA Flagship's Cost and Schedule Performance: LUVOIR as a Case Study

The large ultraviolet optical infrared surveyor (LUVOIR) study process has brought to fruition an extremely exciting scientific mission concept. The 3.5 year LUVOIR study duration enabled an unprecedented level of scientific, engineering, and technology thoroughness prior to the Astro2020 Decadal. This detail also shed light on many technical and programmatic challenges for efficiently developing a mission of this scale within the context of NASA’s flagships cost and schedule performances to date. While NASA’s flagships perform exquisitely once on orbit, there is understandable growing frustration in their development cost and schedule overruns. We felt it incumbent upon ourselves to ask how we could improve on delivering LUVOIR (or any of NASA’s future flagships) on schedule and on budget, not just for the next mission, but for all NASA large strategic missions to come. We researched past and current NASA flagship’s lessons learned publications and other large government projects that pointed to some systemic challenges that will only grow with larger and more complex strategic missions. Our findings pointed us to some ways that could potentially evolve NASA’s current flagship management practices to help improve on their development cost and schedule performance despite their growing complexity. This paper briefly comments on the motivations for NASA’s flagships and on the science motivations for a LUVOIR-like mission. We argue the incentives for improving NASA’s flagships development cost and schedule performance. We review the specific additional challenges of NASA’s flagships to acknowledge their specific issues. We then examine the most repeated systemic challenges we found from previous NASA flagships and other large government projects lessons learned/observed. Lastly, we offer recommendations to tackle these repeated systemic challenges facing NASA’s flagships. The recommendations culminate into a proactive integrated development and funding framework to enable improving the execution of NASA’s future flagship’s cost and schedule performance.

Crooke, Julie A.

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.

Sadovsky, A.

Dynamic Scheduling: Target of Opportunity Observations of Gravitational Wave Events

The simultaneous detection of electromagnetic and gravitational waves from the coalescence of two neutron stars (GW170817 and GRB170817A) has ushered in a new era of ‘multimessenger’ astronomy, with electromagnetic detections spanning from gamma to radio. This great opportunity for new scientific investigations raises the issue of how the available multimessenger tools can best be integrated to constitute a powerful method to study the transient Universe in particular. To facilitate the classification of possible optical counterparts to gravitational wave events, it is important to optimize the scheduling of observations and the filtering of transients, both key elements of the follow-up process. In this work, we describe the existing workflow whereby telescope networks such as GRANDMA and GROWTH are currently scheduled; we then present modifications we have developed for the scheduling process specifically, so as to face the relevant challenges that have appeared during the latest observing run of Advanced LIGO and Advanced Virgo. We address issues with scheduling more than one epoch for multiple fields within a skymap, especially for large and disjointed localizations. This is done in two ways: by optimizing the maximum number of fields that can be scheduled and by splitting up the lobes within the skymap by right ascension to be scheduled individually. In addition, we implement the ability to take previously observed fields into consideration when rescheduling. We show the improvements that these modifications produce in making the search for optical counterparts more efficient, and we point to areas needing further improvement.

Gravitational waves

The First Year of KOKEE12M-WETTZ13S VGOS Intensive Scheduling: Status and Efforts Towards Improvement

The KOKEE12M-WETTZ13S (K2-Ws) Intensive series began on January 4, 2021. Evaluation of the first year of schedules has shown that the series is performing reasonably weel, but the schedules could be improved. For example, the number of scheduled observations in a typical 2021 K2-Ws session is approximately half that of the first few MACGO12M-WETTZ13S Intensive sessions, and scheduling fewer observations negatively impats UT1 results. Also, preliminary analysis of the scheduled and achieve SNRs of the K2-Ws observations and the SNRs' ratios shows examples where the achieved SNRs are either too high, indicating long observations that could have been replaced by a greater number of shorter observations, or too low, indicating a lack of robustness that could lead to observation loss. In this poster, we describe key aspects of how the K2-Ws Intensives have been scheduled in 2021. Then we discuss the areas of concern and the status of efforts to make improvements in these areas.

Karen Baver