Search NASA⌕ Search

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.

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

At least 451 records · Page 25

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 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↗

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.↗

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.↗

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.↗

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↗

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.↗

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↗

A De-centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper, we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is decentralized, scalable, and overlaps the node coordination time with that of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗

A De-Centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments

In the past two decades, numerous scheduling and load balancing techniques have been proposed for locally distributed multiprocessor systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that renders the algorithm unscalable, while others assume the overhead involved in searching for appropriate resources to be negligible. Furthermore, classical scheduling algorithms do not consider a Grid node to be N-resource rich and merely work towards maximizing the utilization of one of the resources. In this paper we propose a new scheduling and load balancing algorithm for a generalized Grid model of N-resource nodes that not only takes into account the node and network heterogeneity, but also considers the overhead involved in coordinating among the nodes. Our algorithm is de-centralized, scalable, and overlaps the node coordination time of the actual processing of ready jobs, thus saving valuable clock cycles needed for making decisions. The proposed algorithm is studied by conducting simulations using the Message Passing Interface (MPI) paradigm.

Arora, Manish↗

Scheduling Earth Observing Satellites with Evolutionary Algorithms

We hypothesize that evolutionary algorithms can effectively schedule coordinated fleets of Earth observing satellites. The constraints are complex and the bottlenecks are not well understood, a condition where evolutionary algorithms are often effective. This is, in part, because evolutionary algorithms require only that one can represent solutions, modify solutions, and evaluate solution fitness. To test the hypothesis we have developed a representative set of problems, produced optimization software (in Java) to solve them, and run experiments comparing techniques. This paper presents initial results of a comparison of several evolutionary and other optimization techniques; namely the genetic algorithm, simulated annealing, squeaky wheel optimization, and stochastic hill climbing. We also compare separate satellite vs. integrated scheduling of a two satellite constellation. While the results are not definitive, tests to date suggest that simulated annealing is the best search technique and integrated scheduling is superior.

Globus, Al↗

Compiling Planning into Scheduling: A Sketch

Although there are many approaches for compiling a planning problem into a static CSP or a scheduling problem, current approaches essentially preserve the structure of the planning problem in the encoding. In this pape: we present a fundamentally different encoding that more accurately resembles a scheduling problem. We sketch the approach and argue, based on an example, that it is possible to automate the generation of such an encoding for problems with certain properties and thus produce a compiler of planning into scheduling problems. Furthermore we argue that many NASA problems exhibit these properties and that such a compiler would provide benefits to both theory and practice.

Bedrax-Weiss, Tania↗

SOFIA'S Challenge: Scheduling Airborne Astronomy Observations

The Stratospheric Observatory for Infrared Astronomy (SOFIA) is NASA's next generation airborne astronomical observatory, and will commence operations in 2005. The facility consists of a 747-SP modified to accommodate a 2.5 meter telescope. SOFIA is expected to fly an average of 140 science flights per year over its 20 year lifetime. Depending on the nature of the instrument used during flight, 5-15 observations per flight are expected. The SOFIA telescope is mounted aft of the wings on the port side of the aircraft and is articulated through a range of 20deg to 60deg of elevation. The telescope has minimal lateral flexibility; thus, the aircraft must turn constantly to maintain the telescope's focus on an object during observations. A significant problem in future SOFIA operations is that of scheduling flights in support of observations. Investigators are expected to propose small numbers of observations, and many observations must be grouped together to make up single flights. Flight planning for the previous generation airborne observatory, the Kuiper Airborne Observatory (KAO), was done by hand; planners had to choose takeoff time, observations to perform, and decide on setup-actions (called "dead-legs") to position the aircraft prior to observing. This task frequently required between 6-8 hours to plan one flight The scope of the flight planning problem for supporting GI observations with the anticipated flight rate for SOFIA makes the manual approach for flight planning daunting. In response, we have designed an Automated Flight Planner (AFP) that accepts as input a set of requested observations, designated flight days, weather predictions and fuel limitations, and searches automatically for high-quality flight plans that satisfy all relevant aircraft and astronomer specified constraints. The AFP can generate one candidate flight plan in 5-10 minutes, of computation time, a feat beyond the capabilities of human flight planners. The rate at which the AFP can generate flights enables humans to assess and analyze complex tradeoffs between fuel consumption, estimated science quality and the percentage of scheduled observations. Due to the changing nature of SOFIA scheduling problems, this functionality will play a crucial role in optimizing science and minimizing costs during operations. In the full paper, we will summarize the technical challenges that have been met in order to build this system. These include: design of the search algorithm, design of appropriate heuristics and approximations, and reduction in the size of the search space. We will also describe technical challenges that are currently being addressed, including the extension of the existing approach to handle new solution criteria. Finally, we will describe a variety of cultural challenges that the astronomical community must address in order to successfully use SOFIA, and describe how the AFT can be used to address some of these challenges. Specifically, many of the intended science users are accustomed to using ground-based or space-based observatories; we will identify some differences that arise due to the nature of airborne observatories, and how the AFT can be extended to provide useful services to ease these cultural differences.

Frank, Jeremy↗

Coordinated Science Campaign Scheduling for Sensor Webs

Future Earth observing missions will study different aspects and interacting pieces of the Earth's eco-system. Scientists are designing increasingly complex, interdisciplinary campaigns to exploit the diverse capabilities of multiple Earth sensing assets. In addition, spacecraft platforms are being configured into clusters, trains, or other distributed organizations in order to improve either the quality or the coverage of observations. These simultaneous advances in the design of science campaigns and in the missions that will provide the sensing resources to support them offer new challenges in the coordination of data and operations that are not addressed by current practice. For example, the scheduling of scientific observations for satellites in low Earth orbit is currently conducted independently by each mission operations center. An absence of an information infrastructure to enable the scheduling of coordinated observations involving multiple sensors makes it difficult to execute campaigns involving multiple assets. This paper proposes a software architecture and describes a prototype system called DESOPS (Distributed Earth Science Observation Planning and Scheduling) that will address this deficiency.

Edgington, Will↗

Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach

One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.

Constraint Satisfaction Problems CSP constraint pr↗

Scheduling Aircraft Landings under Constrained Position Shifting

Optimal scheduling of airport runway operations can play an important role in improving the safety and efficiency of the National Airspace System (NAS). Methods that compute the optimal landing sequence and landing times of aircraft must accommodate practical issues that affect the implementation of the schedule. One such practical consideration, known as Constrained Position Shifting (CPS), is the restriction that each aircraft must land within a pre-specified number of positions of its place in the First-Come-First-Served (FCFS) sequence. We consider the problem of scheduling landings of aircraft in a CPS environment in order to maximize runway throughput (minimize the completion time of the landing sequence), subject to operational constraints such as FAA-specified minimum inter-arrival spacing restrictions, precedence relationships among aircraft that arise either from airline preferences or air traffic control procedures that prevent overtaking, and time windows (representing possible control actions) during which each aircraft landing can occur. We present a Dynamic Programming-based approach that scales linearly in the number of aircraft, and describe our computational experience with a prototype implementation on realistic data for Denver International Airport.

Balakrishnan, Hamsa↗

Utilizing Traveler Demand Modeling to Predict Future Commercial Flight Schedules in the NAS

The current work incorporates the Transportation Systems Analysis Model (TSAM) to predict the future demand for airline travel. TSAM is a multi-mode, national model that predicts the demand for all long distance travel at a county level based upon population and demographics. The model conducts a mode choice analysis to compute the demand for commercial airline travel based upon the traveler s purpose of the trip, value of time, cost and time of the trip,. The county demand for airline travel is then aggregated (or distributed) to the airport level, and the enplanement demand at commercial airports is modeled. With the growth in flight demand, and utilizing current airline flight schedules, the Fratar algorithm is used to develop future flight schedules in the NAS. The projected flights can then be flown through air transportation simulators to quantify the ability of the NAS to meet future demand. A major strength of the TSAM analysis is that scenario planning can be conducted to quantify capacity requirements at individual airports, based upon different future scenarios. Different demographic scenarios can be analyzed to model the demand sensitivity to them. Also, it is fairly well know, but not well modeled at the airport level, that the demand for travel is highly dependent on the cost of travel, or the fare yield of the airline industry. The FAA projects the fare yield (in constant year dollars) to keep decreasing into the future. The magnitude and/or direction of these projections can be suspect in light of the general lack of airline profits and the large rises in airline fuel cost. Also, changes in travel time and convenience have an influence on the demand for air travel, especially for business travel. Future planners cannot easily conduct sensitivity studies of future demand with the FAA TAF data, nor with the Boeing or Airbus projections. In TSAM many factors can be parameterized and various demand sensitivities can be predicted for future travel. These resulting demand scenarios can be incorporated into future flight schedules, therefore providing a quantifiable demand for flights in the NAS for a range of futures. In addition, new future airline business scenarios are investigated that illustrate when direct flights can replace connecting flights and larger aircraft can be substituted, only when justified by demand.

Viken, Jeff↗

Mission Planning and Scheduling System for NASA's Lunar Reconnaissance Mission

In the framework of NASA's return to the Moon efforts, the Lunar Reconnaissance Orbiter (LRO) is the first step. It is an unmanned mission to create a comprehensive atlas of the Moon's features and resources necessary to design and build a lunar outpost. LRO is scheduled for launch in April, 2009. LRO carries a payload comprised of six instruments and one technology demonstration. In addition to its scientific mission LRO will use new technologies, systems and flight operations concepts to reduce risk and increase productivity of future missions. As part of the effort to achieve robust and efficient operations, the LRO Mission Operations Team (MOT) will use its Mission Planning System (MPS) to manage the operational activities of the mission during the Lunar Orbit Insertion (LOI) and operational phases of the mission. The MPS, based on GMV's flexplan tool and developed for NASA with Honeywell Technology Solutions (prime contractor), will receive activity and slew maneuver requests from multiple science operations centers (SOC), as well as from the spacecraft engineers. flexplan will apply scheduling rules to all the requests received and will generate conflict free command schedules in the form of daily stored command loads for the orbiter and a set of daily pass scripts that help automate nominal real-time operations.

Garcia, Gonzalo↗