Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedules”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
NASA NTRS1978

The scheduling of tracking times for interplanetary spacecraft on the Deep Space Network

The Deep Space Network (DSN) is a network of tracking stations, located throughout the globe, used to track spacecraft for NASA's interplanetary missions. This paper describes a computer program, DSNTRAK, which provides an optimum daily tracking schedule for the DSN given the view periods at each station for a mission set of n spacecraft, where n is between 2 and 6. The objective function is specified in terms of relative total daily tracking time requirements between the n spacecraft. Linear programming is used to maximize the total daily tracking time and determine an optimal daily tracking schedule consistent with DSN station capabilities. DSNTRAK is used as part of a procedure to provide DSN load forecasting information for proposed future NASA mission sets.

Webb, W. A.↗
NASA NTRS1981

Magnetohydrodynamics MHD Engineering Test Facility ETF 200 MWe power plant. Conceptual Design Engineering Report CDER. Volume 3: Costs and schedules

The estimated plant capital cost for a coal fired 200 MWE electric generating plant with open cycle magnetohydrodynamics is divided into principal accounts based on Federal Energy Regulatory Commision account structure. Each principal account is defined and its estimated cost subdivided into identifiable and major equipment systems. The cost data sources for compiling the estimates, cost parameters, allotments, assumptions, and contingencies, are discussed. Uncertainties associated with developing the costs are quantified to show the confidence level acquired. Guidelines established in preparing the estimated costs are included. Based on an overall milestone schedule related to conventional power plant scheduling experience and starting procurement of MHD components during the preliminary design phase there is a 6 1/2-year construction period. The duration of the project from start to commercial operation is 79 months. The engineering phase of the project is 4 1/2 years; the construction duration following the start of the man power block is 37 months.

Source record↗
NASA NTRS1982

Autonomous scheduling technology for Earth orbital missions

The development of a dynamic autonomous system (DYASS) of resources for the mission support of near-Earth NASA spacecraft is discussed and the current NASA space data system is described from a functional perspective. The future (late 80's and early 90's) NASA space data system is discussed. The DYASS concept, the autonomous process control, and the NASA space data system are introduced. Scheduling and related disciplines are surveyed. DYASS as a scheduling problem is also discussed. Artificial intelligence and knowledge representation is considered as well as the NUDGE system and the I-Space system.

Srivastava, S.↗
NASA NTRS1981

An efficient procedure for scheduling packets in a multibeam satellite-switched TDMA system

A satellite-switched, multi-beam system using N sub T transponders is considered, in which a large number of ground stations are distributed over N sub Z (not less than N sub T) zones. Each station transmits information digitally in a packet-switched time division multiple access mode, with all packets of fixed length. A demand-assigned packet scheduling procedure is described which achieves high throughput with relatively low average time delay, adapts easily to fluctuating demand from individual earth stations, and automatically schedules transmissions to avoid adjacent zone interference.

Stern, T. E.↗
NASA NTRS1982

A DSN optimal spacecraft scheduling model

A computer model is described which uses mixed-integer linear programming to provide optimal DSN spacecraft schedules given a mission set and specified scheduling requirements. A solution technique is proposed which uses Bender's Method and a heuristic starting algorithm.

Webb, W. A.↗
NASA NTRS1982

A scheduling algorithm for Spacelab telescope observations

An algorithm is developed for sequencing and scheduling of observations of stellar targets by equipment on Spacelab. The method is a general one. The scheduling problem is defined and examined. The method developed for its solution is documented. Suggestions for further development and implementation of this method are made.

Grone, B.↗
NASA NTRS1985

Language for Allocation and Network Scheduling

Programing Language for Allocation and Network Scheduling, Plans, handles many scheduling requirements of Space Shuttle program. Also generalized, high-level tree manipulation language.

Willoughby, J. K.↗
NASA NTRS1984

Vectorization of a penalty function algorithm for well scheduling

In petroleum engineering, the oil production profiles of a reservoir can be simulated by using a finite gridded model. This profile is affected by the number and choice of wells which in turn is a result of various production limits and constraints including, for example, the economic minimum well spacing, the number of drilling rigs available and the time required to drill and complete a well. After a well is available it may be shut in because of excessive water or gas productions. In order to optimize the field performance a penalty function algorithm was developed for scheduling wells. For an example with some 343 wells and 15 different constraints, the scheduling routine vectorized for the CYBER 205 averaged 560 times faster performance than the scalar version.

Absar, I.↗
NASA NTRS1985

A practical scheduling algorithm for Shuttle-based astronomy missions

In the Astro mission series (initial flight planned for March, 1986), the Shuttle will be used as a dedicated stellar astronomy observatory. A modified Spacelab pallet is to be used for the Astro payload, which will consist of three ultraviolet (UV) telescopes and a wide field camera mounted together on a single gimbal mount called the Inertial Pointing System (IPS). Three flights of 7-10 days duration are to be made with the same payload at intervals of 8-9 months. Previous experience has shown that changes in design requirements are inevitable, and the evolution of operational concepts will effect changes in scheduling algorithm software. For these reasons, the design goals of the Astron algorithm and its family of auxiliary software modules have been related to functional modularity, constraint flexibility, user friendliness, and 'light' input requirements. Attention is given to hardware characteristics, environmental constraints, the basic criteria function, 'Cinderella' logic, counters and constraints, and scheduling trends.

Guffin, O. T.↗
NASA NTRS1985

An optimal spacecraft scheduling model for the NASA deep space network

A computer model is described which uses mixed-integer linear programming to provide optimal DSN spacecraft schedules given a mission set and specified scheduling requirements. A solution technique is proposed which uses Bender's method and a heuristic starting algorithm.

Webb, W. A.↗
NASA NTRS1987

Automated problem scheduling and reduction of synchronization delay effects

It is anticipated that in order to make effective use of many future high performance architectures, programs will have to exhibit at least a medium grained parallelism. A framework is presented for partitioning very sparse triangular systems of linear equations that is designed to produce favorable preformance results in a wide variety of parallel architectures. Efficient methods for solving these systems are of interest because: (1) they provide a useful model problem for use in exploring heuristics for the aggregation, mapping and scheduling of relatively fine grained computations whose data dependencies are specified by directed acrylic graphs, and (2) because such efficient methods can find direct application in the development of parallel algorithms for scientific computation. Simple expressions are derived that describe how to schedule computational work with varying degrees of granularity. The Encore Multimax was used as a hardware simulator to investigate the performance effects of using the partitioning techniques presented in shared memory architectures with varying relative synchronization costs.

Saltz, Joel H.↗
NASA NTRS1987

Optimal pre-scheduling of problem remappings

A large class of scientific computational problems can be characterized as a sequence of steps where a significant amount of computation occurs each step, but the work performed at each step is not necessarily identical. Two good examples of this type of computation are: (1) regridding methods which change the problem discretization during the course of the computation, and (2) methods for solving sparse triangular systems of linear equations. Recent work has investigated a means of mapping such computations onto parallel processors; the method defines a family of static mappings with differing degrees of importance placed on the conflicting goals of good load balance and low communication/synchronization overhead. The performance tradeoffs are controllable by adjusting the parameters of the mapping method. To achieve good performance it may be necessary to dynamically change these parameters at run-time, but such changes can impose additional costs. If the computation's behavior can be determined prior to its execution, it can be possible to construct an optimal parameter schedule using a low-order-polynomial-time dynamic programming algorithm. Since the latter can be expensive, the performance is studied of the effect of a linear-time scheduling heuristic on one of the model problems, and it is shown to be effective and nearly optimal.

Nicol, David M.↗
NASA NTRS1987

Prototype resupply scheduler

Resupply scheduling for the Space Station presents some formidable logistics problems. One of the most basic problems is assigning supplies to a series of shuttle resupply missions. A prototype logistics expert system which constructs resupply schedules was developed. This prototype is able to reconstruct feasible resupply plans. In addition, analysts can use the system to evaluate the impact of adding, deleting or modifying launches, cargo space, experiments, etc.

Tanner, Steve↗
NASA NTRS1987

An expert system for scheduling requests for communications links between TDRSS and ERBS

An ERBS-TDRSS Contact Planning System (ERBS-TDRSS CPS) is described which uses a graphics interface and the NASA Transportable Inference Engine. The procedure involves transfer of the ERBS-TDRSS Ground Track Orbit Prediction data to the ERBS flight operations area, where the ERBS-TDRSS CPS automatically generates requests for TDRSS service. As requested events are rejected, alternative context sensitive strategies are employed to generate new requested events until a schedule is completed. A report generator builds schedule requests for separate ERBS-TDRSS contacts.

Mclean, David R.↗
NASA NTRS1987

Defining and representing events in a satellite scheduling system - The IEPS (Interactive Experimenter Planning System) approach

A methodology is described for defining and representing satellite events from the IEPS perspective. The task of doing this is divided into four categories and includes defining and representing resource windows, event parameters, event scheduling strategies, and event constraints. The description of each of these categories includes examples from the IEPS ERBS-TDRSS Contact Planning System. This is a system which is being used by the Earth Radiation Budget Satellite (ERBS) schedulers to request TDRSS contact times from the NCC. The system is written in the C programming language and uses a custom built inference engine (TIE1) to do constraint checking and a custom built strategies interpreter to derive the plan. The planning system runs on the IBM-PC/AT or on any similar hardware which has a C development environment and 640K of memory.

Mclean, David R.↗
NASA NTRS1989

Scheduling Tasks In Parallel Processing

Algorithms sought to minimize time and cost of computation. Report describes research on scheduling of computations tasks in system of multiple identical data processors operating in parallel. Computational intractability requires use of suboptimal heuristic algorithms. First algorithm called "list heuristic", variation of classical list scheduling. Second algorithm called "cluster heuristic" applied to tightly coupled tasks and consists of four phases. Third algorithm called "exchange heuristic", iterative-improvement algorithm beginning with initial feasible assignment of tasks to processors and periods of time. Fourth algorithm is iterative one for optimal assignment of tasks and based on concept called "simulated annealing" because of mathematical resemblance to aspects of physical annealing processes.

Price, Camille C.↗
NASA NTRS1987

An expert system for scheduling requests for communications Links between TDRSS and ERBS

An ERBS-TDRSS Contact Planning System (ERBS-TDRSS CPS) is described which uses a graphics interface and the NASA Transportable Interference Engine. The procedure involves transfer of the ERBS-TDRSS Ground Track Orbit Prediction data to the ERBS flight operations area, where the ERBS-TDRSS CPS automatically generates requests for TDRSS service. As requested events are rejected, alternative context sensitive strategies are employed to generate new requested events until a schedule is completed. A report generator builds schedule requests for separate ERBS-TDRSS contacts.

Mclean, David R.↗