Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 145 records · Page 8

Spike: AI scheduling for Hubble Space Telescope after 18 months of orbital operations

This paper is a progress report on the Spike scheduling system, developed by the Space Telescope Science Institute for long-term scheduling of Hubble Space Telescope (HST) observations. Spike is an activity-based scheduler which exploits artificial intelligence (AI) techniques for constraint representation and for scheduling search. The system has been in operational use since shortly after HST launch in April 1990. Spike was adopted for several other satellite scheduling problems; of particular interest was the demonstration that the Spike framework is sufficiently flexible to handle both long-term and short-term scheduling, on timescales of years down to minutes or less. We describe the recent progress made in scheduling search techniques, the lessons learned from early HST operations, and the application of Spike to other problem domains. We also describe plans for the future evolution of the system.

Johnston, Mark D.↗

The MICRO-BOSS scheduling system: Current status and future efforts

In this paper, a micro-opportunistic approach to factory scheduling was described that closely monitors the evolution of bottlenecks during the construction of the schedule, and continuously redirects search towards the bottleneck that appears to be most critical. This approach differs from earlier opportunistic approaches, as it does not require scheduling large resource subproblems or large job subproblems before revising the current scheduling strategy. This micro-opportunistic approach was implemented in the context of the MICRO-BOSS factory scheduling system. A study comparing MICRO-BOSS against a macro-opportunistic scheduler suggests that the additional flexibility of the micro-opportunistic approach to scheduling generally yields important reductions in both tardiness and inventory.

Sadeh, Norman M.↗

Performance analysis of a large-grain dataflow scheduling paradigm

A paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time is described and analyzed. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital signal processing. With the advent of computer-aided software engineering (CASE) tools for capturing software designs in dataflow-like structures, macro-dataflow scheduling becomes increasingly attractive, if not necessary. For parallel implementations, using the macro-dataflow method allows the scheduling to be insulated from the application designer and enables the maximum utilization of available resources. Further, by allowing multitasking, processor utilizations can approach 100 percent while they maintain maximum speedup. Extensive simulation studies are performed on 4-, 8-, and 16-processor architectures that reflect the effects of communication delays, scheduling delays, algorithm class, and multitasking on performance and speedup gains.

Young, Steven D.↗

Concepts in distributed planning, scheduling, and control

To support instrument and experiment operations effectively in the Space Station era, planning, scheduling, and control must allow for: (1) interactive real-time remote operations; (2) responsive scheduling and rescheduling; (3) support of the full range of distributed science, application and commercial users; (4) interaction and cooperation among distributed users; and (5) efficient use of often onboard, communications, and ground-based resources. We suggest conceptual and managerial approaches that address these needs. Specifically, we describe approaches to distributed planning, scheduling and control functions that are based on resources and on a distributed knowledge hierarchy. We describe the scheduling functions as the component of the integrated space-ground Operations Management System. We include the integration of the planning and scheduling functions with the real-time operations control system, and we discuss automated scheduling assistants. These suggested approaches, taken from the users' point-of-view, have resulted in two prototype systems: Operations and Science Instrument Support package and Science User Resource Planning and Scheduling System.

Hansen, Elaine↗

Space network scheduling benchmark: A proof-of-concept process for technology transfer

This paper describes a detailed proof-of-concept activity to evaluate flexible scheduling technology as implemented in the Request Oriented Scheduling Engine (ROSE) and applied to Space Network (SN) scheduling. The criteria developed for an operational evaluation of a reusable scheduling system is addressed including a methodology to prove that the proposed system performs at least as well as the current system in function and performance. The improvement of the new technology must be demonstrated and evaluated against the cost of making changes. Finally, there is a need to show significant improvement in SN operational procedures. Successful completion of a proof-of-concept would eventually lead to an operational concept and implementation transition plan, which is outside the scope of this paper. However, a high-fidelity benchmark using actual SN scheduling requests has been designed to test the ROSE scheduling tool. The benchmark evaluation methodology, scheduling data, and preliminary results are described.

Moe, Karen↗

Predicting scheduling success

This paper provides an analytical formulation to predict scheduling success for a class of problems frequently referred to as activity scheduling. Space Network communications scheduling is an example of activity scheduling. The principal assumption is that the activity start times are randomly distributed over the available time in the time line. The formulation makes it possible to estimate how much of the demand can be scheduled as a function of the demand, number of resources, activity duration, and activity flexibility. The paper includes computed results for a variety of resource and demand conditions. The results demonstrate that even with highly flexible activities, it is difficult to schedule demand greater than 60 percent of resources without the use of optimization and conflict resolution capabilities in the scheduling system.

Messing, Fredric↗

Generating and evaluating alternate schedules

The demand for and availability of Space Network resources are subject to short-term fluctuations and long-term changes. Generation of acceptable schedules under changing demand and resource availability will require the use of different scheduling policies. This paper identifies several such scheduling policies. It defines metrics for evaluating schedules using the criteria directly related to these scheduling policies. Then it applies the metrics to compare several schedules generated for a scenario representative of 1998 SN demand and resources. Finally, the paper describes a method for using these metrics to evaluate schedules based on multiple criteria.

Reddy, Surender D.↗

Mission and science activity scheduling language

To support the distributed and complex operational scheduling required for future National Aeronautics and Space Administration (NASA) missions, a formal, textual language, the Scheduling Applications Interface Language (SAIL), has been developed. Increased geographic dispersion of investigators is leading to distributed mission and science activity planning, scheduling, and operations. SAIL is an innovation which supports the effective and efficient communication of scheduling information among physically dispersed applications in distributed scheduling environments. SAIL offers a clear, concise, unambiguous expression of scheduling information in a readable, hardware independent format. The language concept, syntax, and semantics incorporate language features found useful during five years of research and prototyping with scheduling languages in physically distributed environments. SAIL allows concise specification of mission and science activity plans in a format which promotes repetition and reuse.

Hull, Larry G.↗

The R-Shell approach - Using scheduling agents in complex distributed real-time systems

Large, complex real-time systems such as space and avionics systems are extremely demanding in their scheduling requirements. The current OS design approaches are quite limited in the capabilities they provide for task scheduling. Typically, they simply implement a particular uniprocessor scheduling strategy and do not provide any special support for network scheduling, overload handling, fault tolerance, distributed processing, etc. Our design of the R-Shell real-time environment fcilitates the implementation of a variety of sophisticated but efficient scheduling strategies, including incorporation of all these capabilities. This is accomplished by the use of scheduling agents which reside in the application run-time environment and are responsible for coordinating the scheduling of the application.

Natarajan, Swaminathan↗

EOS distributed planning and scheduling prototype

Some of the more significant lessons learned during the development of the Earth Observing System (EOS) Distributed Planning and Scheduling Prototype are presented. The need for a central scheduler is not demonstrated. A mapping of scheduling and conflict-resolution responsibility across the nodes of the EOS distributed scheduling system is developed and shown to be both feasible and appropriate. Complex instrument scheduling is mostly accomplished at the ICC/IST (instrument control center/instrumental support terminal) with 'slidable' flexibility for slews and some kinds of calibrations resolved at the EOS Operations Center (EOC). All nodes have full visibility interinstrument contention for resource and environmental rights, e.g., vibration, thermal, and electromagnetic. The EOC assigns, by activity, initial action responsibility for conflict resolution to a node which is party to the conflict. Most interinstrument conflicts are resolved by the ICCs and ISTs during an intermediate scheduling phase while the EOC is negotiating a TDRS schedule with the NCC.

Hull, Larry G.↗

Evaluating Space Network (SN) scheduling operations concepts through statistical analysis

The Network Control Center (NCC) currently uses the NCC Data System (NCCDS) to schedule customer spacecraft communication requests for the Space Network (SN). The NCC/Request Oriented Scheduling Engine (NCC/ROSE), which implements an operational concept called flexible scheduling, is being tested as a potential replacement for the NCCDS scheduler in an effort to increase the efficiency of the NCC scheduling operations. This paper describes the high fidelity benchmark tests being conducted on NCC/ROSE, the evaluation techniques used to compare schedules, and the results of the tests. This testing will verify the increases in efficiency and productivity that can help the NCC meet the anticipated scheduling loads well into the next century.

Kwadrat, Carl↗

Constraint based scheduling for the Goddard Space Flight Center distributed Active Archive Center's data archive and distribution system

The Goddard Space Flight Center (GSFC) Distributed Active Archive Center (DAAC) has been operational since October 1, 1993. Its mission is to support the Earth Observing System (EOS) by providing rapid access to EOS data and analysis products, and to test Earth Observing System Data and Information System (EOSDIS) design concepts. One of the challenges is to ensure quick and easy retrieval of any data archived within the DAAC's Data Archive and Distributed System (DADS). Over the 15-year life of EOS project, an estimated several Petabytes (10(exp 15)) of data will be permanently stored. Accessing that amount of information is a formidable task that will require innovative approaches. As a precursor of the full EOS system, the GSFC DAAC with a few Terabits of storage, has implemented a prototype of a constraint-based task and resource scheduler to improve the performance of the DADS. This Honeywell Task and Resource Scheduler (HTRS), developed by Honeywell Technology Center in cooperation the Information Science and Technology Branch/935, the Code X Operations Technology Program, and the GSFC DAAC, makes better use of limited resources, prevents backlog of data, provides information about resources bottlenecks and performance characteristics. The prototype which is developed concurrently with the GSFC Version 0 (V0) DADS, models DADS activities such as ingestion and distribution with priority, precedence, resource requirements (disk and network bandwidth) and temporal constraints. HTRS supports schedule updates, insertions, and retrieval of task information via an Application Program Interface (API). The prototype has demonstrated with a few examples, the substantial advantages of using HTRS over scheduling algorithms such as a First In First Out (FIFO) queue. The kernel scheduling engine for HTRS, called Kronos, has been successfully applied to several other domains such as space shuttle mission scheduling, demand flow manufacturing, and avionics communications scheduling.

Short, Nick, Jr.↗

Generically Used Expert Scheduling System (GUESS): User's Guide Version 1.0

This user's guide contains instructions explaining how to best operate the program GUESS, a generic expert scheduling system. GUESS incorporates several important features for a generic scheduler, including automatic scheduling routines to generate a 'first' schedule for the user, a user interface that includes Gantt charts and enables the human scheduler to manipulate schedules manually, diagnostic report generators, and a variety of scheduling techniques. The current version of GUESS runs on an IBM PC or compatible in the Windows 3.1 or Windows '95 environment.

Liebowitz, Jay↗

NASA scheduling technologies

This paper is a consolidated report on ten major planning and scheduling systems that have been developed by the National Aeronautics and Space Administration (NASA). A description of each system, its components, and how it could be potentially used in private industry is provided in this paper. The planning and scheduling technology represented by the systems ranges from activity based scheduling employing artificial intelligence (AI) techniques to constraint based, iterative repair scheduling. The space related application domains in which the systems have been deployed vary from Space Shuttle monitoring during launch countdown to long term Hubble Space Telescope (HST) scheduling. This paper also describes any correlation that may exist between the work done on different planning and scheduling systems. Finally, this paper documents the lessons learned from the work and research performed in planning and scheduling technology and describes the areas where future work will be conducted.

Adair, Jerry R.↗

Planning as a Precursor to Scheduling for Space Station Payload Operations

Contemporary schedulers attempt to solve the problem of best fitting a set of activities into an available timeframe while still satisfying the necessary constraints. This approach produces results which are optimized for the region of time the scheduler is able to process, satisfying the near term goals of the operation. In general the scheduler is not able to reason about the activities which precede or follow the window into which it is inputs to scheduling so that the intermediate placing activities. This creates a problem for operations which are composed of many activities spanning long durations (which exceed the scheduler's reasoning horizon) such as the continuous operations environment for payload operations on the Space Station. Not only must the near term scheduling objectives be met, but somehow the results of near term scheduling must be made to support the attainment of long term goals.

Howell, Eric↗

A System for Automatically Generating Scheduling Heuristics

The goal of this research is to improve the performance of automated schedulers by designing and implementing an algorithm by automatically generating heuristics by selecting a schedule. The particular application selected by applying this method solves the problem of scheduling telescope observations, and is called the Associate Principal Astronomer. The input to the APA scheduler is a set of observation requests submitted by one or more astronomers. Each observation request specifies an observation program as well as scheduling constraints and preferences associated with the program. The scheduler employs greedy heuristic search to synthesize a schedule that satisfies all hard constraints of the domain and achieves a good score with respect to soft constraints expressed as an objective function established by an astronomer-user.

Morris, Robert↗

Concepts in Distributed Scheduling and Control

To support instrument and experiment operations effectively in the Space Station era, planning, scheduling and control must allow for: interactive, realtime, remote operations; responsive scheduling and rescheduling; support of the full range of distributed science, application and commercial users; interaction and cooperation among distributed users; and efficient use of on-board, communications, and ground-based resources. We suggest conceptual and managerial approaches that address these needs. Specifically, we describe an approach to distributed planning, scheduling and control functions that is based on resources and on a distributed knowledge hierarchy. We describe these functions as components of an integrated management system. We discuss automated scheduling assistants and integration of planning and scheduling functions with realtime operations control. The suggested approach, taken from a users' point-of-view, has resulted in the Science User Resource Planning and Scheduling System (SURPASS). In this paper, we describe the major components of SURPASS and discuss the features of this innovative prototype. Further ideas concerning instrument planning, scheduling, and control may be found in the Space Station Instrument Control System Study.

Hansen, Elaine R.↗

Mission Operations Planning and Scheduling System (MOPSS)

MOPSS is a generic framework that can be configured on the fly to support a wide range of planning and scheduling applications. It is currently used to support seven missions at Goddard Space Flight Center (GSFC) in roles that include science planning, mission planning, and real-time control. Prior to MOPSS, each spacecraft project built its own planning and scheduling capability to plan satellite activities and communications and to create the commands to be uplinked to the spacecraft. This approach required creating a data repository for storing planning and scheduling information, building user interfaces to display data, generating needed scheduling algorithms, and implementing customized external interfaces. Complex scheduling problems that involved reacting to multiple variable situations were analyzed manually. Operators then used the results to add commands to the schedule. Each architecture was unique to specific satellite requirements. MOPSS is an expert system that automates mission operations and frees the flight operations team to concentrate on critical activities. It is easily reconfigured by the flight operations team as the mission evolves. The heart of the system is a custom object-oriented data layer mapped onto an Oracle relational database. The combination of these two technologies allows a user or system engineer to capture any type of scheduling or planning data in the system's generic data storage via a GUI.

Wood, Terri↗