SEARCH · Search NASA
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.
The development of the Skylab crew activities schedule is discussed. The results are presented for the experiment and operations scheduling procedure evaluation.
A general scheduling algorithm for aircraft from terminal area entry to touchdown is developed. The method has the following novel features: (1) many speed classes of aircraft are considered and speed variations within classes and along portions of the flight path are permitted; (2) multiple paths are considered which may merge or diverge - the analysis is not restricted to a single runway nor to departures only; (3) landings are scheduled along conflict free flight paths in minimum time. The algorithm is currently being incorporated in a fast-time simulation of a STOL air traffic system.
The capabilities of the specified scheduling language and the program module library are outlined. The summary is written with the potential user in mind and, therefore, provides maximum insight on how the capabilities will be helpful in writing scheduling programs. Simple examples and illustrations are provided to assist the potential user in applying the capabilities of his problem.
Description of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.
An attempt is made to extend the generality of timeouts from positive reinforcement to more complex performances. Pigeons were provided with three continuously available options. Responses on one key resulted in food reinforcement under a progressive-ratio schedule, which requires a larger number of responses for successive reinforcements; responses on a second key, which were shocked, reset the progressive-ratio schedule to its first step; and responses on a third key produced a 3-min timeout. Some of these conditions have been studied previously (Dardano, 1968, 1973; Findley, 1958). Questions of general interest included the frequency and stability of response-produced timeouts, changes in the properties of the progressive-ratio performance resulting from the occurrence of timeouts, and the similarity of the relationships between timeouts and the reinforced behavior to relationships found under simpler conditions of reinforcement.
Travel markets which would be served by high speed commercial transport aircraft and the ability of the airlines to schedule and route the aircraft in a way that would achieve good daily utilization and productivity are examined. The following areas are considered: (1) identification of the major long-haul city pairs that would most likely demand nonstop service; (2) selection of flight tracks observing alternative sonic boom restrictions; (3) estimation of flight times for all city pairs for the various sonic boom constraints; (4) impact of airport curfews on possible departure and arrival schedules; (5) projection of passenger traffic volumes on the selected city pairs; and (6) potential daily utilization and aircraft productivity.
This Tug Fleet and Ground Operations Schedules and Controls Study addresses both ground operational data and technical requirements that span the Tug planning phase and operations phase. A similar study covering mission operations (by others) provides the complimentary flight operations details. The two studies provide the planning data requirements, resource allocation, and control milestones for supporting the requirements of the STS program. This Tug Fleet and Ground Operations Schedules and Controls Study incorporates the basic ground operations requirements and concepts provided by previous studies with the interrelationships of the planning, IUS transition, and Tug fleet operations phases. The interrelationships of these phases were studied as a system to optimize overall program benefits and minimize operational risk factors.
Six different instruments on OSO-8 have observed several binary X-ray sources between energies of 0.13 keV and 1 MeV at various times since 21 June 1975. The schedule for these observations is given, as well as the present plan for such future observations through July 1976. Included is the OSO-8 observing schedule for the transient X-ray source A0620-00.
The scheduling algorithm for mission planning and logistics evaluation (SAMPLE) program is a mission planning tool composed of three subsystems; the mission payloads subsystem (MPLS), which generates a list of feasible combinations from a payload model for a given calendar year; GREEDY, which is a heuristic model used to find the best traffic model; and the operations simulation and resources scheduling subsystem (OSARS), which determines traffic model feasibility for available resources. The SAMPLE provides the user with options to allow the execution of MPLS, GREEDY, GREEDY-OSARS, or MPLS-GREEDY-OSARS.
Cost scheduling and funding data are presented for the reference design of the power extension package. Major schedule milestones are correlated with current Spacelab flight dates. Funding distributions provide for minimum expenditure during the first year of the project.
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.
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.
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.
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.
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.
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.
Programing Language for Allocation and Network Scheduling, Plans, handles many scheduling requirements of Space Shuttle program. Also generalized, high-level tree manipulation language.
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.