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 703 records · Page 39
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

Principles and Guidelines for Duty and Rest Scheduling in Commercial Aviation

The aviation industry requires 24-hour activities to meet operational demands. Growth in global long-haul, regional, overnight cargo, and short-haul domestic operations will continue to increase these round-the-clock requirements. Flight crews must be available to support 24-hour-a-day operations to meet these industry demands. Both domestic and international aviation can also require crossing multiple time zones. Therefore, shift work, night work, irregular work schedules, unpredictable work schedules, and dm zone changes will continue to be commonplace components of the aviation industry. These factors pose known challenges to human physiology, and because they result in performance-impairing fatigue, they pose a risk to safety. It is critical to acknowledge and, whenever possible, incorporate scientific information on fatigue, human sleep, and circadian physiology into 24-hour aviation operations. Utilization of such scientific information can help promote crew performance and alertness during flight operations and thereby maintain and improve the safety margin.

Dinges, David F.↗
NASA NTRS1999

Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization

The NAS facility has operated parallel supercomputers for the past 11 years, including the Intel iPSC/860, Intel Paragon, Thinking Machines CM-5, IBM SP-2, and Cray Origin 2000. Across this wide variety of machine architectures, across a span of 10 years, across a large number of different users, and through thousands of minor configuration and policy changes, the utilization of these machines shows three general trends: (1) scheduling using a naive FIFO first-fit policy results in 40-60% utilization, (2) switching to the more sophisticated dynamic backfilling scheduling algorithm improves utilization by about 15 percentage points (yielding about 70% utilization), and (3) reducing the maximum allowable job size further increases utilization. Most surprising is the consistency of these trends. Over the lifetime of the NAS parallel systems, we made hundreds, perhaps thousands, of small changes to hardware, software, and policy, yet, utilization was affected little. In particular these results show that the goal of achieving near 100% utilization while supporting a real parallel supercomputing workload is unrealistic.

Jones, James Patton↗
NASA NTRS2000

Scheduling and Estimating the Cost of Crew Time

In a previous paper, Theory and Application of the Equivalent System Mass Metric, Julie Levri, David Vaccari, and Alan Drysdale developed a method for computing the Equivalent System Mass (ESM) of crew time. ESM is an analog of cost. The suggested approach has been applied but seems to impose too high a cost for small additional requirements for crew time. The proposed method is based on the minimum average cost of crew time. In this work, the scheduling of crew time is examined in more detail, using suggested crew time allocations and daily work schedules. Crew tasks are typically assigned using priorities, which can also be used to construct a crew time demand curve mapping the value or cost per hour versus the total number of hours worked. The cost of additional crew time can be estimated by considering the intersection and shapes of the demand and supply curves. If e assume a mathematical form for the demand curve, a revised method can be developed for computing the cost or ESM of crew time. This method indicates a low cost per hour for small additional requirements for crew time and an increasing cost per hour for larger requirements.

Jones, Harry↗
NASA NTRS2002

SOFIA's Choice: Scheduling Observations for an Airborne Observatory

We describe the problem of scheduling observations for an airborne observatory. The problem is more complex than traditional scheduling problems in that it incorporates complex constraints relating the feasibility of an astronomical observation to the position and time of a mobile observatory, as well as traditional temporal constraints and optimization criteria. We describe the problem, its proposed solution and the empirical validation of that solution.

Frank, Jeremy↗
NASA NTRS2002

LPV Controller Interpolation for Improved Gain-Scheduling Control Performance

In this paper, a new gain-scheduling control design approach is proposed by combining LPV (linear parameter-varying) control theory with interpolation techniques. The improvement of gain-scheduled controllers can be achieved from local synthesis of Lyapunov functions and continuous construction of a global Lyapunov function by interpolation. It has been shown that this combined LPV control design scheme is capable of improving closed-loop performance derived from local performance improvement. The gain of the LPV controller will also change continuously across parameter space. The advantages of the newly proposed LPV control is demonstrated through a detailed AMB controller design example.

Wu, Fen↗
NASA NTRS2003

Scheduling in the Face of Uncertain Resource Consumption and Utility

We discuss the problem of scheduling tasks that consume a resource with known capacity and where the tasks have varying utility. We consider problems in which the resource consumption and utility of each activity is described by probability distributions. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We first show that while some of these problems are NP-complete, others are only NP-Hard. We then describe various heuristic search algorithms to solve these problems and their drawbacks. Finally, we present empirical results that characterize the behavior of these heuristics over a variety of problem classes.

Koga, Dennis↗
NASA NTRS2003

Scheduling in the Face of Uncertain Resource Consumption and Utility

We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We show that the problems are NP- complete, and present some results that characterize the behavior of some simple heuristics over a variety of problem classes.

Frank, Jeremy↗
NASA NTRS2004

Mixed-Initiative Planning and Scheduling for Science Missions

The objective of this joint NASA Ames/JPL/SRI project was to develop mixed-initiative planning and scheduling technology that would enable more effective and efficient planning of science missions. The original intent behind the project was to have all three organizations work closely on the overall research and technology development objectives. Shortly after the project began, however, the Ames and JPL project members made a commitment to develop and field an operational mixed-initiative planning and scheduling tool called MAPGEN for the 2003 Mars Exploration Rover (MER) mission [Ai-Chang et al. 2003]. Because of the tremendous amounts of time and effort that went into making that tool a success, the Ames and JPL personnel were mostly unavailable for collaboration on the joint objectives of the original proposal. Until November of 2002, SRI postponed work on the project in the hope that the Ames and JPL personnel would be able to find time for the planned collaborative research. During discussions between Dr. Karen Myers (the SRI institutional PI) and Dr. John Bresina (the project PI) during November of 2002, it was mutually agreed that SRI should work independently to achieve some of the research objectives for the project. In particular, Dr. Bresina identified explanation of plans and planner behavior as a critical area for research, based on feedback from demonstrating an initial prototype of MAPGEN to the operational community. For that reason, our focus from November of 2002 through the end of the project was on designing explanation methods to address this need.

Myers, Karen L.↗
NASA NTRS2005

Temporal and Resource Reasoning for Planning, Scheduling and Execution in Autonomous Agents

This viewgraph slide tutorial reviews methods for planning and scheduling events. The presentation reviews several methods and uses several examples of scheduling events for the successful and timely completion of the overall plan. Using constraint based models the presentation reviews planning with time, time representations in problem solving and resource reasoning.

Muscettola, Nicola↗
NASA NTRS2007

Scheduling Accessory Assists Patients with Cognitive Disorders

Recom Technologies Inc. received initial funding from NASA to research the commercial potential of an artificially intelligent planning reaction model to serve as a tool to help individuals suffering from various forms and levels of brain impairment. In 1993, the chief of the Artificial Intelligence Research Branch at Ames Research Center suggested collaborative research with Santa Clara Valley Medical Center. This partnership led to further development of the technology and funding to support clinical research from the U.S. Department of Education's National Institute on Disability and Rehabilitation Research. In 1996, Attention Control Systems Inc. was founded to market the finished device, called the Planning and Execution Assistant and Trainer (PEAT). PEAT is a pocket-sized PDA-like device with a graphical display, touchscreen controls, an electronic calendar, an address book, and a built-in phone, that cues users to start or stop scheduled activities, monitors their progress, and adjusts schedules as necessary in response to delays or calendar changes. It uses an automatic planning model developed for NASA to adjust daily plans when a situation changes. PEAT is sold as a complete system that includes software, hardware, documentation, and technical support. In addition to the flagship Pocket PEAT device, there is PEAT Phone, PC PEAT, and PEAT Link. Clinical studies of PEAT continue at Santa Clara Valley Medical Center

Source record↗
NASA NTRS2008

Software Schedules Missions, Aids Project Management

NASA missions require advanced planning, scheduling, and management, and the Space Agency has worked extensively to develop the programs and software suites necessary to facilitate these complex missions. These enormously intricate undertakings have hundreds of active components that need constant management and monitoring. It is no surprise, then, that the software developed for these tasks is often applicable in other high-stress, complex environments, like in government or industrial settings. NASA work over the past few years has resulted in a handful of new scheduling, knowledge-management, and research tools developed under contract with one of NASA s partners. These tools have the unique responsibility of supporting NASA missions, but they are also finding uses outside of the Space Program.

Source record↗
NASA NTRS2009

Hubble Systems Optimize Hospital Schedules

Don Rosenthal, a former Ames Research Center computer scientist who helped design the Hubble Space Telescope's scheduling software, co-founded Allocade Inc. of Menlo Park, California, in 2004. Allocade's OnCue software helps hospitals reclaim unused capacity and optimize constantly changing schedules for imaging procedures. After starting to use the software, one medical center soon reported noticeable improvements in efficiency, including a 12 percent increase in procedure volume, 35 percent reduction in staff overtime, and significant reductions in backlog and technician phone time. Allocade now offers versions for outpatient and inpatient magnetic resonance imaging (MRI), ultrasound, interventional radiology, nuclear medicine, Positron Emission Tomography (PET), radiography, radiography-fluoroscopy, and mammography.

Source record↗
NASA NTRS2010

Secure Autonomous Automated Scheduling (SAAS)

This report describes network-centric operations, where a virtual mission operations center autonomously receives sensor triggers, and schedules space and ground assets using Internet-based technologies and service-oriented architectures. For proof-of-concept purposes, sensor triggers are received from the United States Geological Survey (USGS) to determine targets for space-based sensors. The Surrey Satellite Technology Limited (SSTL) Disaster Monitoring Constellation satellite, the UK-DMC, is used as the space-based sensor. The UK-DMC's availability is determined via machine-to-machine communications using SSTL's mission planning system. Access to/from the UK-DMC for tasking and sensor data is via SSTL's and Universal Space Network's (USN) ground assets. The availability and scheduling of USN's assets can also be performed autonomously via machine-to-machine communications. All communication, both on the ground and between ground and space, uses open Internet standards

Walke, Jon G.↗
NASA NTRS2010

Explanation of Change Cost and Schedule Growth Study Interim Status Briefing

This slide presentation reviews the study to understand the changes in cost and schedule growth for NASA projects. A second goal was to determine the percentage of growth that was outside the control of the project. The study examined project documentation, conducted interviews with key project personnel, and allocated growth events to an Explanation of Change (EoC) tree to quantify the reasons for growth in the scheduled time. This briefing reviews the results of the study of the first 20 missions.

Croonce, Thomas↗
NASA NTRS2009

Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling

Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. To speed computation, Dantzig-Wolfe decomposition is applied to a known linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are solved in parallel via independent computation threads. Experimental evidence suggests that as the number of subproblems/threads increases (and their respective sizes decrease), the solution quality, convergence, and runtime improve. A demonstration of this is provided by using one flight per subproblem, which is the finest possible decomposition. This results in thousands of subproblems and associated computation threads. This massively parallel approach is compared to one with few threads and to standard (non-decomposed) approaches in terms of solution quality and runtime. Since this method generally provides a non-integral (relaxed) solution to the original optimization problem, two heuristics are developed to generate an integral solution. Dantzig-Wolfe followed by these heuristics can provide a near-optimal (sometimes optimal) solution to the original problem hundreds of times faster than standard (non-decomposed) approaches. In addition, when massive decomposition is employed, the solution is shown to be more likely integral, which obviates the need for an integerization step. These results indicate that nationwide, real-time, high fidelity, optimal traffic flow scheduling is achievable for (at least) 3 hour planning horizons.

Rios, Joseph Lucio↗
NASA NTRS2010

Evolutionary Scheduler for the Deep Space Network

A computer program assists human schedulers in satisfying, to the maximum extent possible, competing demands from multiple spacecraft missions for utilization of the transmitting/receiving Earth stations of NASA s Deep Space Network. The program embodies a concept of optimal scheduling to attain multiple objectives in the presence of multiple constraints.

Guillaume, Alexandre↗
NASA NTRS2009

A Method for Scheduling Air Traffic with Uncertain En Route Capacity Constraints

A method for scheduling ground delay and airborne holding for flights scheduled to fly through airspace with uncertain capacity constraints is presented. The method iteratively solves linear programs for departure rates and airborne holding as new probabilistic information about future airspace constraints becomes available. The objective function is the expected value of the weighted sum of ground and airborne delay. In order to limit operationally costly changes to departure rates, they are updated only when such an update would lead to a significant cost reduction. Simulation results show a 13% cost reduction over a rough approximation of current practices. Comparison between the proposed as needed replanning method and a similar method that uses fixed frequency replanning shows a typical cost reduction of 1% to 2%, and even up to a 20% cost reduction in some cases.

Arneson, Heather↗