Search NASA⌕ Search

SEARCH · Search NASA

Results for “Task 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 NTRS2002

Maximally Expressive Task Modeling

Planning and scheduling systems organize "tasks" into a timeline or schedule. The tasks are defined within the scheduling system in logical containers called models. The dictionary might define a model of this type as "a system of things and relations satisfying a set of rules that, when applied to the things and relations, produce certainty about the tasks that are being modeled." One challenging domain for a planning and scheduling system is the operation of on-board experiment activities for the Space Station. The equipment used in these experiments is some of the most complex hardware ever developed by mankind, the information sought by these experiments is at the cutting edge of scientific endeavor, and the procedures for executing the experiments are intricate and exacting. Scheduling is made more difficult by a scarcity of space station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling space station experiment operations calls for a "maximally expressive" modeling schema. Modeling even the simplest of activities cannot be automated; no sensor can be attached to a piece of equipment that can discern how to use that piece of equipment; no camera can quantify how to operate a piece of equipment. Modeling is a human enterprise-both an art and a science. The modeling schema should allow the models to flow from the keyboard of the user as easily as works of literature flowed from the pen of Shakespeare. The Ground Systems Department at the Marshall Space Flight Center has embarked on an effort to develop a new scheduling engine that is highlighted by a maximally expressive modeling schema. This schema, presented in this paper, is a synergy of technological advances and domain-specific innovations.

Japp, John↗
DOE OSTI2018

Schedule Management Optimization (SMO) Domain Model (V.1.2)

Schedule Management Optimization (SMO) is a tool for automatically generating a schedule of project tasks. Project scheduling is traditionally achieved with the use of commercial project management software or case-specific optimization formulations. Commercial software packages are useful tools for managing and visualizing copious amounts of project task data. However, their ability to automatically generate optimized schedules is limited. Furthermore, there are many real-world constraints and decision variables that commercial packages ignore. Case-specific optimization formulations effectively identify schedules that optimize one or more objectives for a specific problem, but they are unable to handle a diverse selection of scheduling problems. SMO enables practitioners to generate optimal project schedules automatically while considering a broad range of real-world problem characteristics. SMO has been designed to handle some of the most difficult scheduling problems – those with resource constraints, multiple objectives, multiple inventories, and diverse ways of performing tasks. This report contains descriptions of the SMO modeling concepts and explains how they map to real-world scheduling considerations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

AGENDA: A task organizer and scheduler

AGENDA will be the main tool used in running the SPOT 4 Earth Observation Satellite's Operational Control Center. It will reduce the operator's work load and make the task easier. AGENDA sets up the work plan for a day of operations, automatically puts the day's tasks into sequence and monitors their progress in real time. Monitoring is centralized, and the tasks are run on different computers in the Center. Once informed of any problems, the operator can intervene at any time while an activity is taking place. To carry out the various functions, the operator has an advanced, efficient, ergonomic graphic interface based on X11 and OSF/MOTIF. Since AGENDA is the heart of the Center, it has to satisfy several constraints that have been taken into account during the various development phases. AGENDA is currently in its final development stages.

Fratter, Isabelle↗
DOE OSTI2020

An Approximation Algorithm for a Task Allocation, Sequencing and Scheduling Problem Involving a Human-Robot Team

Here we present an approximation algorithm for a Task Allocation, Sequencing and Scheduling Problem (TASSP) involving a team of human operators and robots. The robots have to travel to a given set of targets and collaboratively work on the tasks at the targets with the human operators. The problem aims to find a sequence of targets for each robot to visit and schedule the tasks at the targets with the human operators such that each target is visited exactly once by some robot, the scheduling constraints are satisfied and the maximum mission time of any robot is minimum. This problem is a generalization of the single Traveling Salesman Problem and is NP-Hard. Given k robots and m human operators, an algorithm is developed for solving the TASSP with an approximation ratio equal to 5/2- 1/k when m ≥ k and equal to 7/2 -1/k otherwise. Computational results are also presented to corroborate the performance of the proposed algorithm.

42 ENGINEERING↗
NASA NTRS1991

Task planning and scheduling: Toward real-time expert system autonomous control

Research under this grant successfully developed and tested the Interruptable Control System (ICE). The best description of ICE is in the M.S. thesis of Jim Vezina, who was the primary designer and implementer of ICE. Vezina's thesis is included as the bulk of this report. To test the general usefulness and maintainability of the ICE System, the examples of the ICE system in action given in Vezina's thesis were extended. The extensions consisted of two components: debugging and rewriting the simulation of passive and active agents, both controlled and uncontrolled, and benchmarking more extensively the HES expert system concerned with monitoring sensors. The expert system was chosen because it demonstrates the ability of CLIPS.

Sterling, Leon↗
NASA NTRS2004

Maximally Expressive Modeling

Planning and scheduling systems organize tasks into a timeline or schedule. Tasks are logically grouped into containers called models. Models are a collection of related tasks, along with their dependencies and requirements, that when met will produce the desired result. One challenging domain for a planning and scheduling system is the operation of on-board experiments for the International Space Station. In these experiments, the equipment used is among the most complex hardware ever developed; the information sought is at the cutting edge of scientific endeavor; and the procedures are intricate and exacting. Scheduling is made more difficult by a scarcity of station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling International Space Station experiment operations calls for a maximally expressive modeling schema.

Jaap, John↗
NASA NTRS2014

Using Modern Methodologies with Maintenance Software

Jet Propulsion Laboratory uses multi-mission software produced by the Mission Planning and Sequencing (MPS) team to process, simulate, translate, and package the commands that are sent to a spacecraft. MPS works under the auspices of the Multi-Mission Ground Systems and Services (MGSS). This software consists of nineteen applications that are in maintenance. The MPS software is classified as either class B (mission critical) or class C (mission important). The scheduling of tasks is difficult because mission needs must be addressed prior to performing any other tasks and those needs often spring up unexpectedly. Keeping track of the tasks that everyone is working on is also difficult because each person is working on a different software component. Recently the group adopted the Scrum methodology for planning and scheduling tasks. Scrum is one of the newer methodologies typically used in agile development. In the Scrum development environment, teams pick their tasks that are to be completed within a sprint based on priority. The team specifies the sprint length usually a month or less. Scrum is typically used for new development of one application. In the Scrum methodology there is a scrum master who is a facilitator who tries to make sure that everything moves smoothly, a product owner who represents the user(s) of the software and the team. MPS is not the traditional environment for the Scrum methodology. MPS has many software applications in maintenance, team members who are working on disparate applications, many users, and is interruptible based on mission needs, issues and requirements. In order to use scrum, the methodology needed adaptation to MPS. Scrum was chosen because it is adaptable. This paper is about the development of the process for using scrum, a new development methodology, with a team that works on disparate interruptible tasks on multiple software applications.

Scrum↗
NASA NTRS1990

Investigation of automated task learning, decomposition and scheduling

The details and results of research conducted in the application of neural networks to task planning and decomposition are presented. Task planning and decomposition are operations that humans perform in a reasonably efficient manner. Without the use of good heuristics and usually much human interaction, automatic planners and decomposers generally do not perform well due to the intractable nature of the problems under consideration. The human-like performance of neural networks has shown promise for generating acceptable solutions to intractable problems such as planning and decomposition. This was the primary reasoning behind attempting the study. The basis for the work is the use of state machines to model tasks. State machine models provide a useful means for examining the structure of tasks since many formal techniques have been developed for their analysis and synthesis. It is the approach to integrate the strong algebraic foundations of state machines with the heretofore trial-and-error approach to neural network synthesis.

Livingston, David L.↗
DOE OSTI2017

Aluminum Clad Spent Nuclear Fuel Long Term Dry Storage Technical Issues Action Plan - Technical and Engineering Activities

The DOE Spent Nuclear Fuel Working Group (SNFWG)’s report on technical considerations and challenges for extended dry storage of aluminum-clad spent nuclear fuel (ASNF) entitled, Aluminum-Clad Spent Nuclear Fuel: Technical Consideration and Challenges for Extended (>50 Years) Dry Storage, DOE/ID RPT-1575, June 2017 identified five knowledge gaps and technical data needs. This DOE SNFWG report also made several recommendations including one to develop an action plan to identify needed technical and engineering activities and analyses to address the identified knowledge gaps and technical data needs. A team composed of twenty SNF management experts and appropriate subject matter experts from the Idaho National Laboratory and Savannah River National Laboratory was assembled to develop this action plan. The action plan identifies and recommends six technical and engineering tasks and estimated cost and schedule for task completion. It is estimated that $5M and 18 months will be required to execute the recommended tasks.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
NASA NTRS1994

Strategic workload management and decision biases in aviation

Thirty pilots flew three simulated landing approaches under conditions of low, medium, and high workload. Workload conditions were created by varying time pressure and external communications requirements. Our interest was in how the pilots strategically managed or adapted to the increasing workload. We independently assessed the pilot's ranking of the priority of different discrete tasks during the approach and landing. Pilots were found to sacrifice some aspects of primary flight control as workload increased. For discrete tasks, increasing workload increased the amount of time in performing the high priority tasks, decreased the time in performing those of lowest priority, and did not affect duration of performance episodes or optimality of scheduling of tasks of any priority level. Individual differences analysis revealed that high-performing subjects scheduled discrete tasks earlier in the flight and shifted more often between different activities.

Raby, Mireille↗
NASA NTRS1983

SIFT - A preliminary evaluation

This paper presents the results of a performance evaluation of the SIFT computer system conducted in the NASA AIRLAB facility. The essential system functions are described and compared to both earlier design proposals and subsequent design improvements. The functions supporting fault tolerance are found to consume significant computing resources. With SIFT's specimen task load, scheduled at a 30-Hz rate, the executive tasks such as reconfiguration, clock synchronization and interactive consistency, require 55 percent of the available task slots. Other system overhead (e.g., voting and scheduling) use an average of 50 percent of each remaining task slot.

Palumbo, D. L.↗
NASA NTRSDate not supplied

Crew Autonomy through Self-Scheduling: Scheduling Performance Pilot Study

Within the domain of human spaceflight, crew scheduling for International Space Station (ISS) remains a human-driven planning task. Large teams of flight controllers (called Ops Planners) spend weeks creating violation-free schedules for all crewmembers. As NASA considers long-duration exploration missions, the necessary shift of scheduling and planning management from Ops Planners to crew members requires significant research and investigation of crew performance to complete these scheduling tasks. This pilot study was conducted to evaluate non-expert human performance for the task of planning and scheduling, focusing on scheduling problems that increased in complexity based on the number of activities to be scheduled and the number of planning constraints. Nine non-expert planners were recruited to complete scheduling tasks using Playbook, a scheduling software. The results of this pilot study show that scheduling performance decreased as scheduling workload (i.e. number of activities and percent of activities with planning constraints) increased. This paper provides evidence towards developing a model for scheduling task difficulty and identifies potential implications for future automated aids for flight crew scheduling.

planning↗
NASA NTRSDate not supplied

Crew Autonomy Through Self-Scheduling: Scheduling Performance Pilot Study

Within the domain of human spaceflight, crew scheduling for International Space Station (ISS) remains a human-driven planning task. Large teams of flight controllers (called Ops Planners) spend weeks creating violation-free schedules for all crewmembers. As NASA considers long-duration exploration missions, the necessary shift of scheduling and planning management from Ops Planners to crew members requires significant research and investigation of crew performance to complete these scheduling tasks. This pilot study was conducted to evaluate non-expert human performance for the task of planning and scheduling, focusing on scheduling problems that increased in complexity based on the number of activities to be scheduled and the number of planning constraints. Nine non-expert planners were recruited to complete scheduling tasks using Playbook, a scheduling software. The results of this pilot study show that scheduling performance decreased as scheduling workload (i.e. number of activities and percent of activities with planning constraints) increased. This paper provides evidence towards developing a model for scheduling task difficulty and identifies potential implications for future automated aids for flight crew scheduling.

planning↗
NASA NTRS1977

Coordinated NASA nickel-cadmium battery technology program

This paper describes the NASA nickel-cadmium (Ni-Cd) battery technology program which is being coordinated by JPL to provide NASA and other users with lighter and/or longer-lived Ni-Cd cells for low-earth-orbit, geosynchronous-orbit, and planetary spacecraft missions in the 1980s. The goal is to double the energy density and/or life of the system. Failure modes and mechanisms are differentiated and discussed to point out the critical design variables which affect Ni-Cd cell life. Cell component weights are listed, approaches for reducing weight are discussed, and program tasks and schedules are presented. The nine major tasks being worked on by various organizations are described. Progress has been made in weight reduction, understanding of life reliability mechanisms, and development of a process for manufacturing more stable electrodes. An accelerated and predictive life test program is approximately 30% complete. It appears feasible to double the life and/or usable energy density of the Ni-Cd cell.

Bogner, R. S.↗
DOE OSTI2018

Performance Tradeoffs of Spectrum Sensing and Target State Estimation and Fusion

We consider a scenario where a cognitive radio sensor performs spectrum sensing and target tracking alternately. Both tasks may impose certain performance guarantee requirements that necessitate considerations of how to schedule these tasks over time. In addition, multiple such cognitive radio sensors can perform collaborative spectrum sensing and target tracking, where a fusion center serves to collect the sensor estimates and their covariances to generate fused target state estimates. We study the performance tradeoffs of these two tasks from variable scheduling intervals. The effect of sensing errors on the target tracking performance due to induced loss from perceived channel unavailability is investigated and conclusions are drawn based on the observed performance tradeoffs.

Liu, Qiang↗
DOE OSTI2024

IRIS Reimagined: Advancements in Intelligent Runtime System for Task-Based Programming

Task-based programming models are gaining traction in scientific computing. IRIS is a portable runtime system that exploits multiple heterogeneous programming systems and can discover available resources and manage multiple diverse programming systems (e.g., CUDA, Hexagon, HIP, Level Zero, OpenCL, and OpenMP) simultaneously. It accounts for the constraints of task dependencies and provides customizable scheduling policies to map those tasks to heterogeneous devices. In this paper, we present new capabilities added to IRIS to improve its portability for heterogeneous programming, build-friendliness, and performance efficiency. The new additions include vendor-specific kernel support, a runtime system with a foreign function interface to eliminate writing wrapper or boilerplate code for heterogeneous kernels, an easy-to-use and configurable CMake-based build environment, automatic and efficient data transfers and orchestration, and the Hunter and DAGGER toolchains to evaluate IRIS’s task scheduling algorithms.

Miniskar, Narasinga Rao↗
NASA NTRS1991

A Scheduling Algorithm for Replicated Real-Time Tasks

We present an algorithm for scheduling real-time periodic tasks on a multiprocessor system under fault-tolerant requirement. Our approach incorporates both the redundancy and masking technique and the imprecise computation model. Since the tasks in hard real-time systems have stringent timing constraints, the redundancy and masking technique are more appropriate than the rollback techniques which usually require extra time for error recovery. The imprecise computation model provides flexible functionality by trading off the quality of the result produced by a task with the amount of processing time required to produce it. It therefore permits the performance of a real-time system to degrade gracefully. We evaluate the algorithm by stochastic analysis and Monte Carlo simulations. The results show that the algorithm is resilient under hardware failures.

Yu, Albert C.↗