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.

SourceResearch connectionFrom yearThrough year

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

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Occupancy schedule development and its effect on OpenStudio prototype college building model

College buildings have unique characteristics compared with school buildings. Therefore, defining the realistic occupancy schedule in a prototype college building has significant research opportunities. In this study, the actual operating schedules of each space type were collected and generated based on the class reservation schedule and compared with the previous reference schedule (primary/secondary school). Here, the schedules were analyzed for their effect on the OpenStudio prototype college building model. The findings highlight that the use of a typical school building schedule in a college building impairs the granularity of information. The analysis shows significant differences between the previous occupancy schedule and the updated occupancy schedule of the college building, leading to a considerable decrease in occupancy density. Furthermore, the effect of these occupancy pattern changes on the prototype building model is examined. The variations were observed in minimum ventilation requirements, the average mechanical ventilation rate, and energy consumption attributed to changes in occupancy density.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2021

Scheduling strategies for the ESPRESSO follow-up of TESS targets

ABSTRACT Radial-velocity follow-up of stars harbouring transiting planets detected by TESS is expected to require very large amounts of expensive telescope time in the next few years. Therefore, scheduling strategies should be implemented to maximize the amount of information gathered about the target planetary systems. We consider myopic and non-myopic versions of a novel uniform-in-phase scheduler, as well as a random scheduler, and compare these scheduling strategies with respect to the bias, accuracy and precision achieved in recovering the mass and orbital parameters of transiting and non-transiting planets. This comparison is carried out based on realistic simulations of radial-velocity follow-up with ESPRESSO of a sample of 50 TESS target stars, with simulated planetary systems containing at least one transiting planet with a radius below 4R⊕. Radial-velocity data sets were generated under reasonable assumptions about their noise component, including that resulting from stellar activity, and analysed using a fully Bayesian methodology. We find the random scheduler leads to a more biased, less accurate, and less precise, estimation of the mass of the transiting exoplanets. No significant differences are found between the results of the myopic and non-myopic implementations of the uniform-in-phase scheduler. With only about 22 radial velocity measurements per data set, our novel uniform-in-phase scheduler enables an unbiased (at the level of 1 per cent) measurement of the masses of the transiting planets, while keeping the average relative accuracy and precision around 16 per cent and 23 per cent, respectively. The number of non-transiting planets detected is similar for all the scheduling strategies considered, as well as the bias, accuracy and precision with which their masses and orbital parameters are recovered.

Cabona, L.↗

DOE OSTI2023

Multi-Timescale Integrated Dynamics and Scheduling for Solar (MIDAS-Solar) (Final Technical Report)

Solar photovoltaic (PV) installations have experienced unprecedented growth in the United States. PV will become not only an energy producer but also a necessary provider of ancillary services at multiple timescales. Conventional methods to simulate power systems operations - such as long-term production simulation (which typically considers schedules from hours to minutes by using an optimization framework) and short-term transient studies (which simulate dynamics from seconds to sub-seconds using state variables and differential equations) - are not sufficient for studying the multiple-timescale variation of solar generation and its impact on system reliability. Long-term system economics and short-term system dynamics are highly coupled, particularly when the penetration level of renewable generation is extremely high, because the uncertainty and variability of solar generation will impact both power system steady-state and dynamic performance. This project helps meet and exceed the U.S. Department of Energy Office of Energy Efficiency and Renewable Energy Solar Energy Technologies Office goal of systems integration by directly addressing this stability and reliability challenge for power grid planning and operation. We have developed a temporally comprehensive, closed-loop simulation model, named Multi-timescale Integrated Dynamics and Scheduling (MIDAS), that seamlessly simulates power system operations from economic scheduling (day-ahead to hours) to dynamic response analysis (seconds to sub-seconds). For schedules with very high levels of inverter-based resources (IBRs), up to and including 100%, the stability of grid controls has been evaluated through electromagnetic transient (EMT) simulations and power-hardware-in-the-loop (PHIL) simulations of key transient events at key schedule points. Specifically, MIDAS provides: 1) a closed-loop simulation framework for simulating timescales from economic scheduling to dynamic stability analysis; 2) machine learning-based stability assessment; 3) EMT modeling and analysis for large-scale power systems; 4) MIDAS PHIL test bed. We worked with Hawaii Electric Companies to apply the MIDAS study framework to a Maui grid study. The entire island's transmission system was modeled in detail - from a yearly scheduling model, to a second-level frequency dynamic model, down to a sub-second-scale EMT model to address critical stability issues. The project demonstrated how MIDAS can help system planners and operators assess system reliability and stability while the power grid is marching toward a high-renewable, high-IBR future. In this Maui grid study, we found that 100% instantaneous IBR operation is achievable in EMT simulation and PHIL testing, and grid planners and operators might need new analysis/simulation tools to assess grid reliability and stability in the scheduling stage. MIDAS will bring Maui and other systems closer to 100% clean and stable energy futures. (In this study, we examined transient stability. Other topics necessary for 100% IBR operation, such as protection and resource adequacy, were not examined.)

100% Renewables↗

NASA NTRS1976

Are accidents scheduled

Two major sets of safety problems associated with project scheduling are examined. The first set involves problems resulting from the improper scheduling of the safety tasks. The second involves problems which result from inadequate attention to scheduling of those project tasks which lead to tests and operations and includes condensed schedules, modified schedules, schedule workarounds, eliminated portions of the schedules and strung out schedules.

Childs, C.↗

NASA NTRS1987

Scheduling spacecraft operations

A prototype scheduling system named MAESTRO currently under development is being used to explore possible approaches to the spacecraft operations scheduling problem. Results indicate that the appropriate combination of heuristic and other techniques can provide an acceptable solution to the scheduling problem over a wide range of operational scenarios and management approaches. These can include centralized or distributed instrument or systems control, batch or incremental scheduling, scheduling loose resource envelopes or exact profiles, and scheduling with varying degrees of user intervention. Techniques used within MAESTRO to provide this flexibility and power include constraint propagation mechanisms, multiple asynchronous processes, prioritized transaction-based command management, resource opportunity calculation, user-alterable selection and placement mechanisms, and maintenance of multiple schedules and resource profiles. These techniques and scheduling complexities requiring them are discussed.

Britt, Daniel L.↗

NASA NTRS1988

Expert system for on-board satellite scheduling and control

An Expert System is described which Rockwell Satellite and Space Electronics Division (S&SED) is developing to dynamically schedule the allocation of on-board satellite resources and activities. This expert system is the Satellite Controller. The resources to be scheduled include power, propellant and recording tape. The activities controlled include scheduling satellite functions such as sensor checkout and operation. The scheduling of these resources and activities is presently a labor intensive and time consuming ground operations task. Developing a schedule requires extensive knowledge of the system and subsystems operations, operational constraints, and satellite design and configuration. This scheduling process requires highly trained experts anywhere from several hours to several weeks to accomplish. The process is done through brute force, that is examining cryptic mnemonic data off line to interpret the health and status of the satellite. Then schedules are formulated either as the result of practical operator experience or heuristics - that is rules of thumb. Orbital operations must become more productive in the future to reduce life cycle costs and decrease dependence on ground control. This reduction is required to increase autonomy and survivability of future systems. The design of future satellites require that the scheduling function be transferred from ground to on board systems.

Barry, John M.↗

NASA NTRS1990

Analysis of sequencing and scheduling methods for arrival traffic

The air traffic control subsystem that performs scheduling is discussed. The function of the scheduling algorithms is to plan automatically the most efficient landing order and to assign optimally spaced landing times to all arrivals. Several important scheduling algorithms are described and the statistical performance of the scheduling algorithms is examined. Scheduling brings order to an arrival sequence for aircraft. First-come-first-served scheduling (FCFS) establishes a fair order, based on estimated times of arrival, and determines proper separations. Because of the randomness of the traffic, gaps will remain in the scheduled sequence of aircraft. These gaps are filled, or partially filled, by time-advancing the leading aircraft after a gap while still preserving the FCFS order. Tightly scheduled groups of aircraft remain with a mix of heavy and large aircraft. Separation requirements differ for different types of aircraft trailing each other. Advantage is taken of this fact through mild reordering of the traffic, thus shortening the groups and reducing average delays. Actual delays for different samples with the same statistical parameters vary widely, especially for heavy traffic.

Neuman, Frank↗

NASA NTRS1990

Analysis of gain scheduled control for nonlinear plants

Gain scheduling has proven to be a successful design methodology in many engineering applications. In the absence of a sound theoretical analysis, these designs come with no guarantees of the robustness, performance, or even nominal stability of the overall gain-scheduled design. An analysis is presented for two types of nonlinear gain-scheduled control systems: (1) scheduling on a reference trajectory and (2) scheduling on the plant output. Conditions which guarantee stability, robustness, and performance properties of the global gain schedule designs are given. These conditions confirm and formalize popular notions regarding gain-scheduled designs, such as that the scheduling variable should vary slowly and capture the plant's nonlinearities.

Shamma, Jeff S.↗

NASA NTRS1991

Distributed scheduling with COMPASS

COMPASS (COMPuter Aided Scheduling System) is a sophisticated, interactive scheduling tool used within NASA. Like most existing tools, however, COMPASS is a single-user application. There is a large class of scheduling problems which may be better solved by allowing several people at various locations to build separate schedules with shared resources. DISCORS (DIStributed COmputer Resource Scheduling) is a set of services which support a distributed version of COMPASS. This architecture naturally accommodates the integration of user-defined resource models without modifying COMPASS. DISCORS services include the ability to establish and manage communications, to code messages in efficient formats, to provide fault detection and recovery, and to configure schedulers across a network. In its present form, DISCORS effectively supports distributed COMPASS, but fails to run fast and to guarantee efficient schedules. Further enhancements may allow several users to simultaneously and interactively work together to create complex schedules while COMPASS detects and coordinates the resolution of conflicting requests.

Rufat-Latre, Jorge↗

NASA NTRS1992

Methodologies for building robust schedules

COMPASS is the name of a Computer Aided Scheduling System designed and built for NASA. COMPASS can be used to develop schedule of activities based upon the temporal relationships of the activities and their resource requirements. COMPASS uses this information, and guided by the user, develops precise start and stop times for the activities. In actual practice however, it is impossible to know with complete certainty what the actual durations of the scheduled activities will really be. The best that one can hope for is knowledge of the probability distribution for the durations. This paper investigates methodologies for using a scheduling tool like COMPASS that is based upon definite values for the resource requirements, while building schedules that remain valid in the face of the schedule execution perturbations. Representations for the schedules developed by these methodologies are presented, along with a discussion of the algorithm that could be used by a computer onboard a spacecraft to efficiently monitor and execute these schedules.

Dean, John H.↗

NASA NTRS1992

Iterative refinement scheduling

We present a heuristics-based approach to deep space mission scheduling which is modeled on the approach used by expert human schedulers in producing schedules for planetary encounters. New chronological evaluation techniques are used to focus the search by using information gained during the scheduling process to locate, classify, and resolve regions of conflict. Our approach is based on the assumption that during the construction of a schedule there exist several disjunct temporal regions where the demand for one resource type or a single temporal constraint dominates (bottleneck regions). If the scheduler can identify these regions and classify them based on their dominant constraint, then the scheduler can select the scheduling heuristic.

Biefeld, Eric↗

NASA NTRS1990

Automated platform management system scheduling

The Platform Management System (PMS) has been established to coordinate the operation of platform systems and payloads. Since platforms are to be out of contact with the ground more than the manned base, PMS functions are required to be more autonomous than those of the manned base. Automated replanning and rescheduling will be required to effectively and efficiently meet mission goals. In a FY88 study, we developed a phased approach to automated PMS scheduling based upon use of the same scheduling engine in both ground and space components. In the past year, we implemented a baseline, first phase, PMS scheduler prototype. Presently we are integrating this scheduler into two NASA Goddard Space Flight Center testbeds, as the ground scheduler in the Scheduling Concepts, Architectures, and Networks Testbed and as the onboard scheduler in the PMS Testbed. We will investigate rescheduling issues, evaluated operational performance and enhance the prototype to demonstrate our evolutionary approach to automated PMS scheduling.

Hull, Larry G.↗

NASA NTRS1993

OMP-26 - An interactive scheduling tool for the 26 meter subnetwork

Operations Mission Planner for the 26 Meter (26M) Antenna Subnetwork (OMP-26) is an interactive scheduling tool developed by the Jet Propulsion Laboratory (JPL) to assist in allocating the Deep Space Network (DSN) 26M antennas to support Earth-orbiting Spacecraft (SC). Prior to integrating OMP-26 into the 26M scheduling arena, the text-based, labor-intensive task lacked the sufficient means to support the 1992 mission support increase. Therefore, JPL developed the OMP-26 interactive scheduling tool to automate the time consuming tasks of the existing, manual scheduling process. OMP-26 has addressed the scheduling dilemma by assisting schedulers to identify and resolve conflicts more quickly through its graphical display features and constraint-checking editing capability. Although OMP-26 has reduced the scheduler's existing workload by easing the identification and resolution of conflicts, it will not meet the needs of another mission support increase to occur by 1995. Therefore, future plans for OMP-26 involve transitioning from a solely interactive scheduling tool to one that is highly automated and more powerful.

Rosas, Jody L.↗

NASA NTRS1994

Robust telescope scheduling

This paper presents a technique for building robust telescope schedules that tend not to break. The technique is called Just-In-Case (JIC) scheduling and it implements the common sense idea of being prepared for likely errors, just in case they should occur. The JIC algorithm analyzes a given schedule, determines where it is likely to break, reinvokes a scheduler to generate a contingent schedule for each highly probable break case, and produces a 'multiply contingent' schedule. The technique was developed for an automatic telescope scheduling problem, and the paper presents empirical results showing that Just-In-Case scheduling performs extremely well for this problem.

Swanson, Keith↗

NASA NTRS1993

Study and Demonstration of Planning and Scheduling Concepts for the Earth Observing System Data and Information System

The University of Colorado's Laboratory for Atmospheric and Space Physics (CU/LASP) along with the Goddard Space Flight Center (GSFC) and the Jet Propulsion Laboratory (JPL) designed, implemented, tested, and demonstrated a prototype of the distributed, hierarchical planning and scheduling system comtemplated for the Earth Observing System (EOS) project. The planning and scheduling prototype made use of existing systems: CU/LASP's Operations and Science Instrument Support Planning and Scheduling (OASIS-PS) software package; GSFC's Request Oriented Scheduling Engine (ROSE); and JPL's Plan Integrated Timeliner 2 (Plan-It-2). Using these tools, four scheduling nodes were implemented and tied together using a new communications protocol for scheduling applications called the Scheduling Applications Interface Language (SAIL). An extensive and realistic scenario of EOS satellite operations was then developed and the prototype scheduling system was tested and demonstrated using the scenario. Two demonstrations of the system were given to NASA personnel and EOS core system (ECS) contractor personnel. A comprehensive volume of lessons learned was generated and a meeting was held with NASA and ECS representatives to review these lessons learned. A paper and presentation on the project's final results was given at the American Institute of Aeronautics and Astronautics Computing in Aerospace 9 conference.

Davis, Randal↗

NASA NTRS1999

SOFIA's Choice: Automating the Scheduling of Airborne Observations

This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of scheduling observations for a space-borne probe. In 6 we discuss extensions of the flight planning problem as well as other problems which are similar to flight planning. In 7 we conclude and discuss future work.

Frank, Jeremy↗

NASA NTRS2005

The Effects of the Uncertainty of Departures on Multi-Center Traffic Management Advisor (TMA) Scheduling

The Multi-center Traffic Management Advisor (McTMA) provides a platform for regional or national traffic flow management, by allowing long-range cooperative time-based metering to constrained resources, such as airports or air traffic control center boundaries. Part of the demand for resources is made up of proposed departures, whose actual departure time is difficult to predict. For this reason, McTMA does not schedule the departures in advance, but rather relies on traffic managers to input their requested departure time. Because this happens only a short while before the aircraft's actual departure, McTMA is unable to accurately predict the amount of delay airborne aircraft will need to take in order to accommodate the departures. The proportion of demand which is made up by such proposed departures increases as the horizon over which metering occurs gets larger. This study provides an initial analysis of the severity of this problem in a 400-500 nautical mile metering horizon and discusses potential solutions to accommodate these departures. The challenge is to smoothly incorporate departures with the airborne stream while not excessively delaying the departures.' In particular, three solutions are reviewed: (1) scheduling the departures at their proposed departure time; (2) not scheduling the departures in advance; and (3) scheduling the departures at some time in the future based on an estimated error in their proposed time. The first solution is to have McTMA to automatically schedule the departures at their proposed departure times. Since the proposed departure times are indicated in their flight times in advance, this method is the simplest, but studies have shown that these proposed times are often incorrect2 The second option is the current practice, which avoids these inaccuracies by only scheduling aircraft when a confirmed prediction of departure time is obtained from the tower of the departure airport. Lastly, McTMA can schedule the departures at a predicted departure time based on statistical data of past departure time performance. It has been found that departures usually have a wheels-up time after their indicated proposed departure time, as shown in Figure 1. Hence, the departures were scheduled at a time in the future based on the mean error in proposed departure times for their airport.

Thipphavong, Jane↗

NASA NTRS2005

Incremental Scheduling Engines: Cost Savings through Automation

As humankind embarks on longer space missions farther from home, the requirements and environments for scheduling the activities performed on these missions are changing. As we begin to prepare for these missions it is appropriate to evaluate the merits and applicability of the different types of scheduling engines. Scheduling engines temporally arrange tasks onto a timeline so that all constraints and ob.jectives are met and resources are not over-booked. Scheduling engines used to schedule space missions fall into three general categories: batch, mixed-initiative, and incremental. This paper, presents an assessment of the engine types, a discussion of the impact of human exploration of the moon and Mars on planning and scheduling, and the applicability of the different types of scheduling engines. This paper will pursue the hypothesis that incremental scheduling engines may have a place in the new environment; they have the potential to reduce cost, to improve the satisfaction of those who execute or benefit from a particular timeline (the customers), and to allow astronauts to plan their own tasks and those of their companion robots.

Jaap, John↗