Search NASA⌕ Search

SEARCH · Search NASA

Results for “Resource 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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
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 NTRS1995

System-Availability And Resource-Allocation Program

ACARA analyzes availability, life-cycle cost, and scheduling of resources. Uses statistical Monte Carlo method to simulate capacity states of system as well as failure and repair of components. Failures of components modeled mathematically by use of combination of exponential and Weibull probability distributions. Schedules replacement of components to optimize performance of system. Made to comply with any constraints on production of components, capacities of resupply vehicles, spares kept on site, crews, and/or equipment. Written in APL2.

Viterna, L. A.↗
DOE OSTI2022

Production Agency Quality Assurance Management Execution Strategy [Thesis]

There are multiple federal directives that Los Alamos National Laboratory (LANL) must follow for the proper implementation of quality assurance, strategic planning, and execution of manufacturing and surveillance operations. Recent assessments identified that manufacturing in all processing areas is dynamic due to influencing scope changes, design modifications, funding adjustments, and staff attrition. In response, this project was started to develop a comprehensive PAQ execution strategy to support the success of LANL’s manufacturing mission. This project’s method for developing an updated architecture was to create an integrated, flexible, reliable, and agile strategic process. The execution plan has five deliverables: 1) an integrated schedule view of PAQ work scope, 2) a resource management plan that aligns with the required scope, 3) a metrics monitoring dashboard, 4) a project management plan for sustaining NAP 401.1A implementation, and 5) a risk management plan. The research design is a mixed-method approach focused on data collection for each deliverable. The methodology entails qualitative and quantitative research, metrics monitoring, data analysis, and the creation of a dashboard. The qualitative methods used include literature reviews and interviews. The quantitative methods include resource, financial, schedule and survey data analysis. Preliminary and final results were peer reviewed by subject matter experts both within the ALDWP organization and deployed support.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
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↗
DOE OSTI2018

The research on meta-job scheduling heuristics in heterogeneous environments

As the core of rational utilization of computing resources, the scheduling algorithm has gained the interest of many researchers. Aimed at meta-job scheduling in heterogeneous environments, this paper puts forward three algorithms: the meta-job scheduling algorithm based on deviation (MaxD-min heuristic), the meta-job scheduling algorithm based on relative deviation (MaxRD-min heuristic), and the Cordwood algorithm (CA). The former two Algorithm are improvements of the classic Min-min algorithm. The latter CA algorithm is a new method that tries to place each building block on the tray with minimal amount of Sufferage. In conclusion, the result of experimenting shows that the three algorithms, in comparison to Min-Min and Max-Min algorithm, can effectively reduce the total span of scheduling (makespan).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Population-based learning of load balancing policies for a distributed computer system

Effective load-balancing policies use dynamic resource information to schedule tasks in a distributed computer system. We present a novel method for automatically learning such policies. At each site in our system, we use a comparator neural network to predict the relative speedup of an incoming task using only the resource-utilization patterns obtained prior to the task's arrival. Outputs of these comparator networks are broadcast periodically over the distributed system, and the resource schedulers at each site use these values to determine the best site for executing an incoming task. The delays incurred in propagating workload information and tasks from one site to another, as well as the dynamic and unpredictable nature of workloads in multiprogrammed multiprocessors, may cause the workload pattern at the time of execution to differ from patterns prevailing at the times of load-index computation and decision making. Our load-balancing policy accommodates this uncertainty by using certain tunable parameters. We present a population-based machine-learning algorithm that adjusts these parameters in order to achieve high average speedups with respect to local execution. Our results show that our load-balancing policy, when combined with the comparator neural network for workload characterization, is effective in exploiting idle resources in a distributed computer system.

Mehra, Pankaj↗
NASA NTRS1990

An innovative approach for distributed and integrated resources planning for the Space Station Freedom

This paper presents a planning approach to the Space Station Freedom program which takes into account the widely distributed nature of that program. The program management structure is organized into three major levels: a strategic level, a tactical level, and an execution level. For each level, resource availabilities are determined, the resources are distributed, schedules are built independently within the resource limits, the schedules are integrated into a single schedule, and conflicts are resolved by negotiating requirements and/or relaxing contraints. This approach distributes resources to multiple planning entities in such a way that when the multiple plans are collected, they fit together with minimal modification. The up-front distribution is planned in such a way and to a sufficient degree that a fit is virtually assured.

Hornstein, Rhoda S.↗
NASA NTRS1992

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. Current research efforts include: adaptation of MICRO-BOSS to deal with sequence-dependent setups and development of micro-opportunistic reactive scheduling techniques that will enable the system to patch the schedule in the presence of contingencies such as machine breakdowns, raw materials arriving late, job cancellations, etc.

Sadeh, Norman M.↗
NASA NTRS1993

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

Advanced timeline systems

The Mission Planning Division of the Mission Operations Laboratory at NASA's Marshall Space Flight Center is responsible for scheduling experiment activities for space missions controlled at MSFC. In order to draw statistically relevant conclusions, all experiments must be scheduled at least once and may have repeated performances during the mission. An experiment consists of a series of steps which, when performed, provide results pertinent to the experiment's functional objective. Since these experiments require a set of resources such as crew and power, the task of creating a timeline of experiment activities for the mission is one of resource constrained scheduling. For each experiment, a computer model with detailed information of the steps involved in running the experiment, including crew requirements, processing times, and resource requirements is created. These models are then loaded into the Experiment Scheduling Program (ESP) which attempts to create a schedule which satisfies all resource constraints. ESP uses a depth-first search technique to place each experiment into a time interval, and a scoring function to evaluate the schedule. The mission planners generate several schedules and choose one with a high value of the scoring function to send through the approval process. The process of approving a mission timeline can take several months. Each timeline must meet the requirements of the scientists, the crew, and various engineering departments as well as enforce all resource restrictions. No single objective is considered in creating a timeline. The experiment scheduling problem is: given a set of experiments, place each experiment along the mission timeline so that all resource requirements and temporal constraints are met and the timeline is acceptable to all who must approve it. Much work has been done on multicriteria decision making (MCDM). When there are two criteria, schedules which perform well with respect to one criterion will often perform poorly with respect to the other. One schedule dominates another if it performs strictly better on one criterion, and no worse on the other. Clearly, dominated schedules are undesireable. A nondominated schedule can be generated by some sort of optimization problem. Generally there are two approaches: the first is a hierarchical approach while the second requires optimizing a weighting or scoring function.

Bulfin, R. L.↗