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.

SourceResearch connectionFrom yearThrough year

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

At least 559 records · Page 31

All sources NASA NTRS DOE OSTI

NASA NTRS1990

Lessons learned from the Hubble Space Telescope planning and scheduling system implementation and operation

The major challenge of the NASA Hubble Space Telescope (HST) Ground System has been the implementation of the planning and scheduling system. This paper describes the operational flow of HST from science proposals to the actual execution of science observations on board the HST. The paper provides a collection of lessons learned over the 10 years that have covered the definition, development, test, and initial operation of HST's planning and scheduling system.

Ruitberg, Edward O.↗

NASA NTRS1991

Concepts, requirements, and design approaches for building successful planning and scheduling systems

Traditional practice of systems engineering management assumes requirements can be precisely determined and unambiguously defined prior to system design and implementation; practice further assumes requirements are held static during implementation. Human-computer decision support systems for service planning and scheduling applications do not conform well to these assumptions. Adaptation to the traditional practice of systems engineering management are required. Basic technology exists to support these adaptations. Additional innovations must be encouraged and nutured. Continued partnership between the programmatic and technical perspective assures proper balance of the impossible with the possible. Past problems have the following origins: not recognizing the unusual and perverse nature of the requirements for planning and scheduling; not recognizing the best starting point assumptions for the design; not understanding the type of system that being built; and not understanding the design consequences of the operations concept selected.

Hornstein, Rhoda Shaller↗

NASA NTRS1991

Proposed planning and scheduling services for the SNC in the CDOS era

Studies indicate that the current NCC mode of operation needs to be enhanced to meet the needs of the mid to late 19990's. There is a need to simplify the request interface for Space Network services. This is because there are more complex missions, more flexible spacecraft operations, more scheduling data volume, and more events per spacecraft and scheduling period.

Welden, Todd↗

NASA NTRS1991

An RF interference mitigation methodology with potential applications in scheduling

Software tools for interference analysis and mitigation were developed in the Communications Link Analysis and Simulation System (CLASS) environment for: communications performance evaluation; and mission planning. Potential applications are seen in analysis, evaluation, and optimization of user schedules. Tools producing required separation angles and potential interference intervals can be used as an aid to mutual interference mitigation within a scheduling system.

Wong, Yen F.↗

NASA NTRS1991

Human factors issues in the design of user interfaces for planning and scheduling

The purpose is to provide and overview of human factors issues that impact the effectiveness of user interfaces to automated scheduling tools. The following methods are employed: (1) a survey of planning and scheduling tools; (2) the identification and analysis of human factors issues; (3) the development of design guidelines based on human factors literature; and (4) the generation of display concepts to illustrate guidelines.

Murphy, Elizabeth D.↗

NASA NTRS1991

Range Scheduling Aid (RSA)

Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.

Logan, J. R.↗

NASA NTRS1991

Managing temporal relations in the MAESTRO scheduling system

A set of viewgraphs on managing temporal relations in the MAESTRO scheduling system are given. The viewgraphs present information on such topics as why scheduling is hard, managing temporal relations, constraints on the placement of a single activity, constraints between activities, soft constraints (such as preferences), and contingency handling.

Britt, Daniel L.↗

NASA NTRS1990

Planning and scheduling lessons learned study, executive summary

The study was performed to document the lessons on planning and scheduling activities for a number of missions and institutional facilities in such a way that they can be applied to future missions; to provide recommendations to both projects and Code 500 that will improve the end-to-end planning and scheduling process; and to identify what, if any, mission characteristics might be related to certain lessons learned. The results are a series of recommendations of both a managerial and technical nature related to the underlying lessons learned.

Robinson, Toni↗

NASA NTRS1991

Using C to build a satellite scheduling expert system: Examples from the Explorer Platform planning system

A C-based artificial intelligence (AI) development effort which is based on a software tools approach is discussed with emphasis on reusability and maintainability of code. The discussion starts with simple examples of how list processing can easily be implemented in C and then proceeds to the implementations of frames and objects which use dynamic memory allocation. The implementation of procedures which use depth first search, constraint propagation, context switching, and blackboard-like simulation environment are described. Techniques for managing the complexity of C-based AI software are noted, especially the object-oriented techniques of data encapsulation and incremental development. Finally, all these concepts are put together by describing the components of planning software called the Planning And Resource Reasoning (PARR) Shell. This shell was successfully utilized for scheduling services of the Tracking and Data Relay Satellite System for the Earth Radiation Budget Satellite since May of 1987 and will be used for operations scheduling of the Explorer Platform in Nov. of 1991.

Mclean, David R.↗

NASA NTRS1991

Architectural impact of FDDI network on scheduling hard real-time traffic

The architectural impact on guaranteeing synchronous message deadlines in FDDI (Fiber Distributed Data Interface) token ring networks is examined. The FDDI network does not have facility to support (global) priority arbitration which is a useful facility for scheduling hard real time activities. As a result, it was found that the worst case utilization of synchronous traffic in an FDDI network can be far less than that in a centralized single processor system. Nevertheless, it is proposed and analyzed that a scheduling method can guarantee deadlines of synchronous messages having traffic utilization up to 33 pct., the highest to date.

Agrawal, Gopal↗

NASA NTRS1990

Planning and scheduling research at NASA Ames Research Center

Planning and scheduling is the area of artificial intelligence research that focuses on the determination of a series of operations to achieve some set of (possibly) interacting goals and the placement of those operations in a timeline that allows them to be accomplished given available resources. Work in this area at the NASA Ames Research Center ranging from basic research in constrain-based reasoning and machine learning, to the development of efficient scheduling tools, to the application of such tools to complex agency problems is described.

Friedland, Peter↗

NASA NTRS1991

Strategic behavior, workload, and performance in task scheduling

Scheduling theory is proposed as a normative model for strategic behavior when operators are confronted by several tasks, all of which should be completed within a fixed time span, and when they are free to choose the order in which the tasks should be done. Three experiments are described to investigate the effect of knowing the correct scheduling rule on the efficiency of performance, subjective workload, and choice of strategy under different conditions of time pressure. The most potent effects are from time pressure. The reasons for the weak effect of knowing the rules are discussed, and implications for strategic behavior, displays, and decision aids are indicated.

Moray, Neville↗

NASA NTRS1991

Individual differences in strategic flight management and scheduling

A group of 30 instrument-rated pilots was made to fly simulator approaches to three airports under conditions of low, medium, and high workload conditions. An analysis is presently conducted of the difference in discrete task scheduling between the group of 10 highest and 10 lowest performing pilots in the sample; this categorization was based on the mean of various flight-profile measures. The two groups were found to differ from each other only in terms of the time when specific events were conducted, and of the optimality of scheduling for certain high-priority tasks. These results are assessed in view of the relative independence of task-management skills from aircraft-control skills.

Wickens, Christopher D.↗

NASA NTRS1992

Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems

This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n-queens problem, a technique based on this approach performs orders of magnitude better than traditional backtracking techniques. We also describe a scheduling application where the approach has been used successfully. A theoretical analysis is presented both to explain why this method works well on certain types of problems and to predict when it is likely to be most effective.

Minton, Steve↗

NASA NTRS1992

Scheduling and rescheduling with iterative repair

This paper describes the GERRY scheduling and rescheduling system being applied to coordinate Space Shuttle Ground Processing. The system uses constraint-based iterative repair, a technique that starts with a complete but possibly flawed schedule and iteratively improves it by using constraint knowledge within repair heuristics. In this paper we explore the tradeoff between the informedness and the computational cost of several repair heuristics. We show empirically that some knowledge can greatly improve the convergence speed of a repair-based system, but that too much knowledge, such as the knowledge embodied within the MIN-CONFLICTS lookahead heuristic, can overwhelm a system and result in degraded performance.

Zweben, Monte↗

NASA NTRS1992

Temporal planning for transportation planning and scheduling

In this paper we describe preliminary work done in the CORTES project, applying the Heuristic Scheduling Testbed System (HSTS) to a transportation planning and scheduling domain. First, we describe in more detail the transportation problems that we are addressing. We then describe the fundamental characteristics of HSTS and we concentrate on the representation of multiple capacity resources. We continue with a more detailed description of the transportation planning problem that we have initially addressed in HSTS and of its solution. Finally we describe future directions for our research.

Frederking, Robert E.↗

NASA NTRS1992

CABINS: Case-based interactive scheduler

In this paper we discuss the need for interactive factory schedule repair and improvement, and we identify case-based reasoning (CBR) as an appropriate methodology. Case-based reasoning is the problem solving paradigm that relies on a memory for past problem solving experiences (cases) to guide current problem solving. Cases similar to the current case are retrieved from the case memory, and similarities and differences of the current case to past cases are identified. Then a best case is selected, and its repair plan is adapted to fit the current problem description. If a repair solution fails, an explanation for the failure is stored along with the case in memory, so that the user can avoid repeating similar failures in the future. So far we have identified a number of repair strategies and tactics for factory scheduling and have implemented a part of our approach in a prototype system, called CABINS. As a future work, we are going to scale up CABINS to evaluate its usefulness in a real manufacturing environment.

Miyashita, Kazuo↗

NASA NTRS1992

Generating effective project scheduling heuristics by abstraction and reconstitution

A project scheduling problem consists of a finite set of jobs, each with fixed integer duration, requiring one or more resources such as personnel or equipment, and each subject to a set of precedence relations, which specify allowable job orderings, and a set of mutual exclusion relations, which specify jobs that cannot overlap. No job can be interrupted once started. The objective is to minimize project duration. This objective arises in nearly every large construction project--from software to hardware to buildings. Because such project scheduling problems are NP-hard, they are typically solved by branch-and-bound algorithms. In these algorithms, lower-bound duration estimates (admissible heuristics) are used to improve efficiency. One way to obtain an admissible heuristic is to remove (abstract) all resources and mutual exclusion constraints and then obtain the minimal project duration for the abstracted problem; this minimal duration is the admissible heuristic. Although such abstracted problems can be solved efficiently, they yield inaccurate admissible heuristics precisely because those constraints that are central to solving the original problem are abstracted. This paper describes a method to reconstitute the abstracted constraints back into the solution to the abstracted problem while maintaining efficiency, thereby generating better admissible heuristics. Our results suggest that reconstitution can make good admissible heuristics even better.

Janakiraman, Bhaskar↗