SEARCH · Search NASA

Results for “Scheduler”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 415 records · Page 23

All sources NASA NTRS DOE OSTI

NASA NTRS1994

Resupply Scheduler Program Using Integer Optimization

Resupply Scheduling Modeler (RSM) fully menu-driven computer program using integer programming techniques to determine optimum schedule for replacing components on or before ends of fixed replacement periods. Written to analyze electrical power system on Space Station Freedom, also used to model resupply of almost any system subject to user-defined constraints on resources. Lifetimes of components, assembly schedules, and other constraints taken into account. Written in APL2(R).

Viterna, L. A.↗

NASA NTRS1993

Cost and schedule estimation study report

This report describes the analysis performed and the findings of a study of the software development cost and schedule estimation models used by the Flight Dynamics Division (FDD), Goddard Space Flight Center. The study analyzes typical FDD projects, focusing primarily on those developed since 1982. The study reconfirms the standard SEL effort estimation model that is based on size adjusted for reuse; however, guidelines for the productivity and growth parameters in the baseline effort model have been updated. The study also produced a schedule prediction model based on empirical data that varies depending on application type. Models for the distribution of effort and schedule by life-cycle phase are also presented. Finally, this report explains how to use these models to plan SEL projects.

Condon, Steve↗

NASA NTRS1993

The Consolidated Planning and Scheduling System for Space Transportation and Space Station operations - Successful development experience

In 1992, NASA made the decision to evolve a Consolidated Planning System (CPS) by adding the Space Transportation System (STS) requirements to the Space Station Freedom (SSF) planning software. This paper describes this evolutionary process, which began with a series of six-month design-build-test cycles, using a domain-independent architecture and a set of developmental tools known as the Advanced Scheduling Environment. It is shown that, during these tests, the CPS could be used at multiple organizational levels of planning and for integrating schedules from geographically distributed (including international) planning environments. The potential for using the CPS for other planning and scheduling tasks in the SSF program is being currently examined.

Hornstein, Rhoda S.↗

NASA NTRS1994

The development and validation of command schedules for SeaWiFS

An automated method for developing and assessing spacecraft and instrument command schedules is presented for the Sea-viewing Wide Field-of-view Sensor (SeaWiFS) project. SeaWiFS is to be carried on the polar-orbiting SeaStar satellite in 1995. The primary goal of the SeaWiFS mission is to provide global ocean chlorophyll concentrations every four days by employing onboard recorders and a twice-a-day data downlink schedule. Global Area Coverage (GAC) data with about 4.5 km resolution will be used to produce the global coverage. Higher resolution (1.1 km resolution) Local Area Coverage (LAC) data will also be recorded to calibrate the sensor. In addition, LAC will be continuously transmitted from the satellite and received by High Resolution Picture Transmission (HRPT) stations. The methods used to generate commands for SeaWiFS employ numerous hierarchical checks as a means of maximizing coverage of the Earth's surface and fulfilling the LAC data requirements. The software code is modularized and written in Fortran with constructs to mirror the pre-defined mission rules. The overall method is specifically developed for low orbit Earth-observing satellites with finite onboard recording capabilities and regularly scheduled data downlinks. Two software packages using the Interactive Data Language (IDL) for graphically displaying and verifying the resultant command decisions are presented. Displays can be generated which show portions of the Earth viewed by the sensor and spacecraft sub-orbital locations during onboard calibration activities. An IDL-based interactive method of selecting and testing LAC targets and calibration activities for command generation is also discussed.

Woodward, Robert H.↗

NASA NTRS1994

CRI planning and scheduling for space

Computer Resources International (CRI) has many years of experience in developing space planning and scheduling systems for the European Space Agency. Activities range from AIT/AIV planning over mission planning to research in on-board autonomy using advanced planning and scheduling technologies in conjunction with model based diagnostics. This article presents four projects carried out for ESA by CRI with various subcontractors: (1) DI, Distributed Intelligence for Ground/Space Systems is an on-going research project; (2) GMPT, Generic Mission Planning Toolset, a feasibility study concluded in 1993; (3) OPTIMUM-AIV, Open Planning Tool for AIV, development of a knowledge based AIV planning and scheduling tool ended in 1992; and (4) PlanERS-1, development of an AI and knowledge-based mission planning prototype for the ERS-1 earth observation spacecraft ended in 1991.

Aarup, Mads↗

NASA NTRS1994

High performance techniques for space mission scheduling

In this paper, we summarize current research at Carnegie Mellon University aimed at development of high performance techniques and tools for space mission scheduling. Similar to prior research in opportunistic scheduling, our approach assumes the use of dynamic analysis of problem constraints as a basis for heuristic focusing of problem solving search. This methodology, however, is grounded in representational assumptions more akin to those adopted in recent temporal planning research, and in a problem solving framework which similarly emphasizes constraint posting in an explicitly maintained solution constraint network. These more general representational assumptions are necessitated by the predominance of state-dependent constraints in space mission planning domains, and the consequent need to integrate resource allocation and plan synthesis processes. First, we review the space mission problems we have considered to date and indicate the results obtained in these application domains. Next, we summarize recent work in constraint posting scheduling procedures, which offer the promise of better future solutions to this class of problems.

Smith, Stephen F.↗

NASA NTRS1994

Solution and reasoning reuse in space planning and scheduling applications

In the space domain, as in other domains, the CSP (Constraint Satisfaction Problems) techniques are increasingly used to represent and solve planning and scheduling problems. But these techniques have been developed to solve CSP's which are composed of fixed sets of variables and constraints, whereas many planning and scheduling problems are dynamic. It is therefore important to develop methods which allow a new solution to be rapidly found, as close as possible to the previous one, when some variables or constraints are added or removed. After presenting some existing approaches, this paper proposes a simple and efficient method, which has been developed on the basis of the dynamic backtracking algorithm. This method allows previous solution and reasoning to be reused in the framework of a CSP which is close to the previous one. Some experimental results on general random CSPs and on operation scheduling problems for remote sensing satellites are given.

Verfaillie, Gerard↗

NASA NTRS1995

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

Jones, Robert L., III↗

NASA NTRS1995

A microeconomic scheduler for parallel computers

We describe a scheduler based on the microeconomic paradigm for scheduling on-line a set of parallel jobs in a multiprocessor system. In addition to the classical objectives of increasing the system throughput and reducing the response time, we consider fairness in allocating system resources among the users, and providing the user with control over the relative performances of his jobs. We associate with every user a savings account in which he receives money at a constant rate. When a user wants to run a job, he creates an expense account for that job to which he transfers money from his savings account. The job uses the funds in its expense account to obtain the system resources it needs for execution. The share of the system resources allocated to the user is directly related to the rate at which the user receives money; the rate at which the user transfers money into a job expense account controls the job's performance. We prove that starvation is not possible in our model. Simulation results show that our scheduler improves both system and user performances in comparison with two different variable partitioning policies. It is also shown to be effective in guaranteeing fairness and providing control over the performance of jobs.

Stoica, Ion↗

NASA NTRS1995

The foundations of reusability: Successful experience and important conclusions from planning and scheduling of space operations

NASA's Office of Space Communications is sponsoring a combined technical and management initiative to dramatically decrease the cost of preparing for and conducting space operations. The authors present their successful experience and important conclusions from producing generalized and readily reusable solutions and systems for planning and scheduling applications. While generality by itself should enable reuse, generality alone may not produce the desired cost savings. Generality achieved by accumulating numerous special cases within a software system often increases the complexity of the software to the extent that maintenance costs overtake development savings. Because of this phenomenon, the authors have insisted on simplicity, as well as generality, to achieve cost-effective operation reusability. Simplicity and generality can be accomplished simultaneously when the basic 'Building Blocks' for a problem domain, in this paper, planning and scheduling, are discovered and implemented with reuse in mind. The Building Blocks for planning and scheduling are described. The authors also present examples of how these Building Blocks have accommodated various scenarios that were previously treated as mission-peculiar. Two case histories are presented to demonstrate operational reusability and cost effectiveness.

Hornstein, Rhoda Shaller↗

NASA NTRS1990

Expert system for scheduling simulation lab sessions

Implementation and results of an expert system used for scheduling session requests for the Systems Engineering Simulator (SES) laboratory at the NASA Johnson Space Center (JSC) are discussed. Weekly session requests are received from astronaut crew trainers, procedures developers, engineering assessment personnel, software developers, and various others who wish to access the computers, scene generators, and other simulation equipment available to them in the SES lab. The expert system under discussion is comprised of a data acquisition portion - two Pascal programs run on a personal computer - and a CLIPS program installed on a minicomputer. A brief introduction to the SES lab and its scheduling background is given. A general overview of the system is provided, followed by a detailed description of the constraint-reduction process and of the scheduler itself. Results from a ten-week trial period using this approach are discussed. Finally, a summary of the expert system's strengths and shortcomings are provided.

Lund, Chet↗

NASA NTRS1994

NASA records retention schedules: Procedures governing the retention, retirement, and destruction of agency records

This handbook sets forth the minimum retention periods of official records of NASA. Its provisions are applicable to NASA Headquarters and all field installations. This revised edition has been correlated to the NASA Uniform Files Index (UFI) (NHB 1442.1B), the General Records Schedules produced by the National Archives and Records Administration (NARA), and has been enlarged in scope to cover Privacy Act Systems of Records and record series previously omitted. Guidance is provided in the areas of record retirement, transfer, and retrieval from Federal Record Centers (FRC) and disposal actions. Included are provisions for making changes to these schedules by addition of new items or revision of current items. The NASA Records Retention Schedules (NRRS) were approved for NASA use by NARA, the General Services Administration, and the General Accounting Office.

Benita A Cooper↗

NASA NTRS1998

Distribution of a Generic Mission Planning and Scheduling Toolkit for Astronomical Spacecraft

This 2-year report describes the progress made to date on the project to package and distribute the planning and scheduling toolkit for the SWAS astronomical spacecraft. SWAS was scheduled to be launched on a Pegasus XL vehicle in fall 1995. Three separate failures in the launch vehicle have delayed the SWAS launch. The researchers have used this time to continue developing scheduling algorithms and GUI design. SWAS is expected to be launched this year.

Kleiner, Steven C.↗

NASA NTRS1999

Automated Planning and Scheduling for Planetary Rover Distributed Operations

Automated planning and Scheduling, including automated path planning, has been integrated with an Internet-based distributed operations system for planetary rover operations. The resulting prototype system enables faster generation of valid rover command sequences by a distributed planetary rover operations team. The Web Interface for Telescience (WITS) provides Internet-based distributed collaboration, the Automated Scheduling and Planning Environment (ASPEN) provides automated planning and scheduling, and an automated path planner provided path planning. The system was demonstrated on the Rocky 7 research rover at JPL.

Backes, Paul G.↗

NASA NTRS2000

Bridging the Gap Between Planning and Scheduling

Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast. Scheduling research has focused on much larger problems where there is little action choice, but the resulting ordering problem is hard. In this paper, we give an overview of M planning and scheduling techniques, focusing on their similarities, differences, and limitations. We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems.

Smith, David E.↗

NASA NTRS1996

Operation Closed-Loop Observation Scheduling and Execution

In this paper, we present a fully operational system that performs closed-loop observation scheduling and execution and has been in daily use on an automatic photoelectric telescope at the Fairborn Observatory on Mt. Hopkins in Arizona. The scheduler is part of the Associate Principal Astronomer system that also provides tools that enable the effective management of automatic telescopes. The paper describes the flexible schedule representation used and describes how the uncertainties and errors inherent in the domain are handled.

Bresina, John↗

NASA NTRS1997

Automatic Generation of Heuristics for Scheduling

This paper presents a technique, called GenH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving most, or typical, problem instances, and, at worst, useful in solving only a narrowly defined set of instances. In either case, heuristic problem solvers, to be broadly applicable, should have a means of automatically adjusting to the idiosyncrasies of each problem instance. GenH generates a search heuristic for a given problem instance by hill-climbing in the space of possible multi-attribute heuristics, where the evaluation of a candidate heuristic is based on the quality of the solution found under its guidance. We present empirical results obtained by applying GenH to the real world problem of telescope observation scheduling. These results demonstrate that GenH is a simple and effective way of improving the performance of an heuristic scheduler.

Morris, Robert A.↗

NASA NTRS2002

Scheduling Earth Observing Fleets Using Evolutionary Algorithms: Problem Description and Approach

We describe work in progress concerning multi-instrument, multi-satellite scheduling. Most, although not all, Earth observing instruments currently in orbit are unique. In the relatively near future, however, we expect to see fleets of Earth observing spacecraft, many carrying nearly identical instruments. This presents a substantially new scheduling challenge. Inspired by successful commercial applications of evolutionary algorithms in scheduling domains, this paper presents work in progress regarding the use of evolutionary algorithms to solve a set of Earth observing related model problems. Both the model problems and the software are described. Since the larger problems will require substantial computation and evolutionary algorithms are embarrassingly parallel, we discuss our parallelization techniques using dedicated and cycle-scavenged workstations.

Globus, Al↗