The JPL Resource Allocation Planning and Scheduling Office (RAPSO) process
Explore the source record for details and available documents.
RAPSO Resource Allocation Planning and Scheduling ↗
SEARCH · Search NASA
Results for “process and 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.
Adaptive Preventive Maintenance for Flow Shop Scheduling With Resumable Processing
Not provided.
Automation & Control Systems↗
EMSL-Computing/CoreMS-Portal
Software that orchestrate data processing and management for mass spectrometry workflows and data products. Stack presented contains a web application, data processing job scheduling, and data processing workers for data processing and management.
Corilo, Yuri↗
The JPL resource allocation planning and scheduling office (RAPSO) process
Explore the source record for details and available documents.
RAPSO↗
Microstructural Analysis Across a Hybrid Inconel 718 Turbopump Inducer Following a Scheduled Heat Treatment Process
Additive Manufacturing (AM) provides a low-cost method to fabricate near net shape complex parts. In this study, a turbopump inducer was fabricated using blown powder direct energy deposition (DED) of Inconel 718 to form the fins on a wrought hub. By utilizing this combination process, more cost-effective methods are possible for complex parts. A series of heat treatments were applied to the assembly per ASTM F330.
Inconel 718↗
Heterogeneous graphics processing unit for scheduling thread groups for execution on variable width SIMD units
A compute unit configured to execute multiple threads in parallel is presented. The compute unit includes one or more single instruction multiple data (SIMD) units and a fetch and decode logic. The SIMD units have differing numbers of arithmetic logic units (ALUs), such that each SIMD unit can execute a different number of threads. The fetch and decode logic is in communication with each of the SIMD units, and is configured to assign the threads to the SIMD units for execution based on such differing numbers of ALUs.
97 MATHEMATICS AND COMPUTING↗
Integrated Solutions for Optimized Performance (ISOP) Final Technical Report
The goal of this project was to demonstrate technical feasibility of an integrated approach for deep energy retrofits by packaging innovative technologies with smart communicating controls that represent the next generation of energy efficiency. The integrated solutions for optimized performance (ISOP) package integrates (i) advanced lighting and plug load controls; (ii) intelligent daylight harvesting through automated self-powered shades and window films; (iii) advanced HVAC controls sequences (ASHRAE Guideline (GDL) 36); and (iv) fault detection and diagnosis (FDD) and continuous commissioning (CCx) using advanced analytics. These technologies address energy use across multiple building end uses that represent more than 60% of the energy consumption in all commercial buildings. The project was structured to be implemented over three budget periods: Budget Period 1 scope included site selection, project design, site-specific customization of technology packages, procurement of technologies, initiation of installation of technologies, the development of a measurement and verification plan and collection of pre-retrofit data collection. The first year go/no-go decision was based on securing host sites representing 250,000 sq. ft. of occupied operational spaces, savings analysis, technology procurement and initiation of installation. Budget Period 2 planned to complete technology installations and initiate data collection of post-retrofit performance data. The second year go/no-go was to be the completion of technology installations and commissioning, metering and data collecting to support the requirements laid out in site specific M&V plans. Budget Period 3 planned to collect and analyze post-retrofit performance data and provide data and reporting to support energy efficiency rebate programs. After the team completed activities planned for Budget Period 1, the team reached a Go/No-Go Decision Point. At that point, TRC recommended that DOE discontinue the project without prejudice due to challenges with securing demonstration sites to meet the full 250,000 sf of occupied operational spaces and DOE concurred. In Budget Period 1, the TRC team developed criteria to recruit and evaluate potential demonstration host sites. TRC worked with Princeton University, the project demonstration partner, to identify buildings on their campus as potential candidates for the demonstration. Following the selection of demonstration sites, the TRC team customized energy technology packages according to the needs and characteristics of each site. TRC defined technology specifications, identified vendors, and conducted analysis to estimate energy and cost savings potential. The project team then developed schedules for technology procurement processes and scheduled for installation at all selected demonstration sites. The project team worked with Princeton University and DOE to develop an approach to verify energy savings achieved through measurement and verification (M&V) 2.0 methods. Princeton University initiated open bids to procure the necessary materials and installation contractors. Bid results came back higher than estimates due to a couple of factors – lack of familiarity of the bidders with the proposed technologies and lack of local trained installers to execute the installation of these new measures. Due to the higher bids, projects no longer met the internal cost-effectiveness criteria used by Princeton to proceed with procurement of the full suite of technologies as proposed in ISOP. Princeton had already procured parts of the ISOP package as part of a campus-wide initiative for FDD and lighting retrofits, but with the higher costs for other ISOP components, Princeton could no longer commit to the full ISOP package on the selected sites. Based on this, the team reached the Go/No-Go decision point, where they decided not to proceed with the project. Princeton is separately installing portions of the ISOP package where they individually meet Princeton’s payback criteria but on a different schedule than would have been needed for the DOE ISOP project. The team has learned several lessons from project progress in the first budget period. The team will utilize these lessons in future projects, as should any team which proceeds with a project around the ISOP technology. The first lesson is that more information about the proposed sites is required earlier in the process (perhaps even at the proposal stage) in order to have a successful demonstration. Technical details not evident earlier in the process (such as the TLED limitations for ALCS) can derail project execution. The second lesson is that pricing of emerging technologies is highly variable due to lack of familiarity of local installers and distributor with the proposed technologies as well as alternate bids using products they were more familiar with, but that cost more than the ones proposed by TRC. Finally, the last major lesson is that the host site’s internal project criteria is of critical importance. Based on these higher installed costs and lack of an informed installer base for the products proposed for this project, the project does not meet Princeton’s simple payback goals of five years.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
Scheduling Tasks In Parallel Processing
Algorithms sought to minimize time and cost of computation. Report describes research on scheduling of computations tasks in system of multiple identical data processors operating in parallel. Computational intractability requires use of suboptimal heuristic algorithms. First algorithm called "list heuristic", variation of classical list scheduling. Second algorithm called "cluster heuristic" applied to tightly coupled tasks and consists of four phases. Third algorithm called "exchange heuristic", iterative-improvement algorithm beginning with initial feasible assignment of tasks to processors and periods of time. Fourth algorithm is iterative one for optimal assignment of tasks and based on concept called "simulated annealing" because of mathematical resemblance to aspects of physical annealing processes.
Price, Camille C.↗
Realization of high quality production schedules: Structuring quality factors via iteration of user specification processes
This paper describes an architecture for realizing high quality production schedules. Although quality is one of the most important aspects of production scheduling, it is difficult, even for a user, to specify precisely. However, it is also true that the decision as to whether a scheduler is good or bad can only be made by the user. This paper proposes the following: (1) the quality of a schedule can be represented in the form of quality factors, i.e. constraints and objectives of the domain, and their structure; (2) quality factors and their structure can be used for decision making at local decision points during the scheduling process; and (3) that they can be defined via iteration of user specification processes.
Hamazaki, Takashi↗
Seamless transitions from early prototypes to mature operational software - A technology that enables the process for planning and scheduling applications
New and innovative software technology is presented that provides a cost effective bridge for smoothly transitioning prototype software, in the field of planning and scheduling, into an operational environment. Specifically, this technology mixes the flexibility and human design efficiency of dynamic data typing with the rigor and run-time efficiencies of static data typing. This new technology provides a very valuable tool for conducting the extensive, up-front system prototyping that leads to specifying the correct system and producing a reliable, efficient version that will be operationally effective and will be accepted by the intended users.
Hornstein, Rhoda S.↗
Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks
The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.
Space Networking↗
Developing scheduling benchmark tests for the Space Network
A set of benchmark tests were developed to analyze and measure Space Network scheduling characteristics and to assess the potential benefits of a proposed flexible scheduling concept. This paper discusses the role of the benchmark tests in evaluating alternative flexible scheduling approaches and defines a set of performance measurements. The paper describes the rationale for the benchmark tests as well as the benchmark components, which include models of the Tracking and Data Relay Satellite (TDRS), mission spacecraft, their orbital data, and flexible requests for communication services. Parameters which vary in the tests address the degree of request flexibility, the request resource load, and the number of events to schedule. Test results are evaluated based on time to process and schedule quality. Preliminary results and lessons learned are addressed.
Moe, Karen L.↗
Parallel processing of real-time dynamic systems simulation on OSCAR (Optimally SCheduled Advanced multiprocessoR)
Parallel processing of real-time dynamic systems simulation on a multiprocessor system named OSCAR is presented. In the simulation of dynamic systems, generally, the same calculation are repeated every time step. However, we cannot apply to Do-all or the Do-across techniques for parallel processing of the simulation since there exist data dependencies from the end of an iteration to the beginning of the next iteration and furthermore data-input and data-output are required every sampling time period. Therefore, parallelism inside the calculation required for a single time step, or a large basic block which consists of arithmetic assignment statements, must be used. In the proposed method, near fine grain tasks, each of which consists of one or more floating point operations, are generated to extract the parallelism from the calculation and assigned to processors by using optimal static scheduling at compile time in order to reduce large run time overhead caused by the use of near fine grain tasks. The practicality of the scheme is demonstrated on OSCAR (Optimally SCheduled Advanced multiprocessoR) which has been developed to extract advantageous features of static scheduling algorithms to the maximum extent.
Kasahara, Hironori↗
Integrated planning and scheduling for Earth science data processing
Several current NASA programs such as the EOSDIS Core System (ECS) have data processing and data management requirements that call for an integrated planning and scheduling capability. In this paper, we describe the experience of applying advanced scheduling technology operationally, in terms of what was accomplished, lessons learned, and what remains to be done in order to achieve similar successes in ECS and other programs. We discuss the importance and benefits of advanced scheduling tools, and our progress toward realizing them, through examples and illustrations based on ECS requirements. The first part of the paper focuses on the Data Archive and Distribution (DADS) V0 Scheduler. We then discuss system integration issues ranging from communication with the scheduler to the monitoring of system events and re-scheduling in response to them. The challenge of adapting the scheduler to domain-specific features and scheduling policies is also considered. Extrapolation to the ECS domain raises issues of integrating scheduling with a product-generation planner (such as PlaSTiC), and implementing conditional planning in an operational system. We conclude by briefly noting ongoing technology development and deployment projects being undertaken by HTC and the ISTB.
Boddy, Mark↗
Probabilistic Modeling of Commercial Building Occupancy Patterns Using Location-Based Map Data: Preprint
Considering occupancy patterns is crucial to simulate buildings' energy use. Current energy models use inputs that simplify the actual diversity in occupancy into static occupancy patterns and are not able to represent the numerous variations in occupancy patterns between buildings and across different locations. Recently, inferring occupancy schedules from metered electricity consumption data was used to model occupancy in commercial buildings. However, the translation from metered data to occupancy schedules requires many assumptions that might not capture the reality, and the process is hindered by the availability of data from advanced metering infrastructure. With the development of information technologies, occupancy modeling should not be limited to traditional approaches. The prevalence of social networks and location services with real-time user feedback provides publicly accessible data via Maps Application Programming Interfaces (APIs) such as Google Maps, SafeGraph, Mapbox, Foursquare, etc. This paper presents an automated framework for modeling parametric occupancy patterns using such APIs to calibrate commercial district buildings' energy models. This process includes three main steps: data extraction and processing, parametric schedules generation, and schedules integration. We demonstrated this framework in districts where we used maps API to generate more accurate behavioral patterns for operations and electric vehicle charging events. We used these patterns to determine differences in energy use across key sociodemographic and spatial parameters. The presented method has the potential for worldwide applications. Users can utilize this framework to extract data for selected locations of interest to create more realistic behavioral patterns for commercial facilities across different districts.
building energy modeling↗
Use of Dynamic Models and Operational Architecture to Solve Complex Navy Challenges
The United States Navy established 8 Maritime Operations Centers (MOC) to enhance the command and control of forces at the operational level of warfare. Each MOC is a headquarters manned by qualified joint operational-level staffs, and enabled by globally interoperable C41 systems. To assess and refine MOC staffing, equipment, and schedules, a dynamic software model was developed. The model leverages pre-existing operational process architecture, joint military task lists that define activities and their precedence relations, as well as Navy documents that specify manning and roles per activity. The software model serves as a "computational wind-tunnel" in which to test a MOC on a mission, and to refine its structure, staffing, processes, and schedules. More generally, the model supports resource allocation decisions concerning Doctrine, Organization, Training, Material, Leadership, Personnel and Facilities (DOTMLPF) at MOCs around the world. A rapid prototype effort efficiently produced this software in less than five months, using an integrated process team consisting of MOC military and civilian staff, modeling experts, and software developers. The work reported here was conducted for Commander, United States Fleet Forces Command in Norfolk, Virginia, code N5-0LW (Operational Level of War) that facilitates the identification, consolidation, and prioritization of MOC capabilities requirements, and implementation and delivery of MOC solutions.
Grande, Darby↗
The Cassini Solstice Mission: Streamlining Operations by Sequencing with PIEs
The Cassini Solstice Mission (CSM) is the second extended mission phase of the highly successful Cassini/Huygens mission to Saturn. Conducted at a much-reduced funding level, operations for the CSM have been streamlined and simplified significantly. Integration of the science timeline, which involves allocating observation time in a balanced manner to each of the five different science disciplines (with representatives from the twelve different science instruments), has long been a labor-intensive endeavor. Lessons learned from the prime mission (2004-2008) and first extended mission (Equinox mission, 2008-2010) were utilized to design a new process involving PIEs (Pre-Integrated Events) to ensure the highest priority observations for each discipline could be accomplished despite reduced work force and overall simplification of processes. Discipline-level PIE lists were managed by the Science Planning team and graphically mapped to aid timeline deconfliction meetings prior to assigning discrete segments of time to the various disciplines. Periapse segments are generally discipline-focused, with the exception of a handful of PIEs. In addition to all PIEs being documented in a spreadsheet, allocated out-of-discipline PIEs were entered into the Cassini Information Management System (CIMS) well in advance of timeline integration. The disciplines were then free to work the rest of the timeline internally, without the need for frequent interaction, debate, and negotiation with representatives from other disciplines. As a result, the number of integration meetings has been cut back extensively, freeing up workforce. The sequence implementation process was streamlined as well, combining two previous processes (and teams) into one. The new Sequence Implementation Process (SIP) schedules 22 weeks to build each 10-week-long sequence, and only 3 sequence processes overlap. This differs significantly from prime mission during which 5-week-long sequences were built in 24 weeks, with 6 overlapping processes.
Vandermey, Nancy↗
Putting ROSE to Work: A Proposed Application of a Request-Oriented Scheduling Engine for Space Station Operations
Scheduling engines are found at the core of software systems that plan and schedule activities and resources. A Request-Oriented Scheduling Engine (ROSE) is one that processes a single request (adding a task to a timeline) and then waits for another request. For the International Space Station, a robust ROSE-based system would support multiple, simultaneous users, each formulating requests (defining scheduling requirements), submitting these requests via the internet to a single scheduling engine operating on a single timeline, and immediately viewing the resulting timeline. ROSE is significantly different from the engine currently used to schedule Space Station operations. The current engine supports essentially one person at a time, with a pre-defined set of requirements from many payloads, working in either a "batch" scheduling mode or an interactive/manual scheduling mode. A planning and scheduling process that takes advantage of the features of ROSE could produce greater customer satisfaction at reduced cost and reduced flow time. This paper describes a possible ROSE-based scheduling process and identifies the additional software component required to support it. Resulting changes to the management and control of the process are also discussed.
Jaap, John↗