Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedule”

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
DOE OSTI2021

Renewable hydrogen and ammonia for combined heat and power systems in remote locations: Optimal design and scheduling

Abstract Using hydrogen (H ) and ammonia (NH ) for renewable energy storage has the potential to enable economical power and heat supply with high renewable penetrations, especially in remote locations which are characterized by high energy costs. In this work we assess the economic competitiveness of renewable combined heat and power (CHP) systems in Mahaka HI, Nantucket MA, and Northwest Arctic Borough (NWAB) AK by optimally designing these systems for scenarios in which power and heat can be purchased over a range of historical energy prices as well as when 100% renewable supply is required. We use a combined optimal design and scheduling model which minimizes annualized net present cost by determining optimal technology selection and size simultaneously with optimal schedules for each period of a system operating horizon aggregated from full year hourly resolution data via a consecutive temporal clustering algorithm. We find that renewable generation meets at least 85% of power demands and 75% of heat demands under the lowest energy prices investigated. Higher conventional energy prices lead to increased renewable penetration which is facilitated by renewable NH as a seasonal energy storage medium, as are 100% renewable CHP systems. NH is used for power generation with heat cogeneration in all three locations, as well as directly for heating in NWAB. On an annual cost basis, NH ‐enabled 100% renewable CHP is only 3% more expensive in Mahaka and NWAB than systems which can purchase energy at the lowest prices, while it is 15% more expensive in Nantucket.

Palys, Matthew J.↗
DOE OSTI2016

Interconnection-wide hour-ahead scheduling in the presence of intermittent renewables and demand response: A surplus maximizing approach

This study describes a new approach for solving the multi-area electricity resource allocation problem when considering both intermittent renewables and demand response. The method determines the hourly inter-area export/import set that maximizes the interconnection (global) surplus satisfying transmission, generation and load constraints. The optimal inter-area transfer set effectively makes the electricity price uniform over the interconnection apart from constrained areas, which overall increases the consumer surplus more than it decreases the producer surplus. The method is computationally efficient and suitable for use in simulations that depend on optimal scheduling models. The method is demonstrated on a system that represents North America Western Interconnection for the planning year of 2024. Simulation results indicate that effective use of interties reduces the system operation cost substantially. Excluding demand response, both the unconstrained and the constrained scheduling solutions decrease the global production cost (and equivalently increase the global economic surplus) by 12.30B and 10.67B per year, respectively, when compared to the standalone case in which each control area relies only on its local supply resources. This cost saving is equal to 25% and 22% of the annual production cost. Including 5% demand response, the constrained solution decreases the annual production cost by 10.70B, while increases the annual surplus by 9.32B in comparison to the standalone case.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2020

A method to generate heating and cooling schedules based on data from connected thermostats

Internet-connected thermostats are a promising new source of temperature and operational data in homes because they record inside temperatures, setpoints, and HVAC runtimes every five minutes. Over 20 million Internet-connected thermostats have already been installed in American homes. Data from about 20,000 connected thermostats were collected and organized by climate zone, number of occupants, floor area, and day type. A method was developed to create up to 40 representative temperature schedules which, together, can more accurately capture the diversity of heating and cooling behaviors. These results are suitable for input into schedules for building energy simulation models. This information enables more realistic simulations of American heating and cooling behavior, leading to more accurate estimates of energy consumption and savings.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Network reconfiguration and distributed energy resource scheduling for improved distribution system resilience

Electric utility companies work to restore as much load as possible after power outages caused by extreme weather events. In this paper, an outage management strategy is proposed to enhance distribution system resilience through network reconfiguration and distributed energy resources (DERs) scheduling. After a line fault, the proposed algorithm can identify radial network topology based on the rank of the incidence matrix. The reconfiguration is implemented by switching tie lines and sectionalizing lines. With the new network topology, an optimal DER scheduling problem is solved to minimize the accumulative cost for dispatchable DER operation and load reduction. Finally, the optimal topology that minimizes the accumulative cost is selected from all radial topologies. The computational workload is relatively low because only linear programming needs to be solved. Using the case studies of the IEEE 69-bus and IEEE 123-bus systems, we consider the worst-case scenarios in which faults occur in the upstream feeder. The simulation results demonstrate that the proposed strategy allows for a relatively high percentage of the load to remain in service after line faults. Furthermore, compared with microgrid-formation approaches, the proposed strategy has advantages when applied to the distribution systems with several normally-open tie lines and low DER penetration.

42 ENGINEERING↗
DOE OSTI2013

Results of a 5-Week Schedule of Modern Total Skin Electron Beam Radiation Therapy

Purpose: To report the outcomes of a 5-week schedule of total skin electron beam radiation therapy (TSEB) for mycosis fungoides (MF). Methods: Over 5 years, 41 patients with confirmed MF were treated with a modern TSEB technique delivering 30 Gy in 20 fractions over 5 weeks to the whole skin surface. Data were collected prospectively and entered into the skin tumor unit research database. Skin modified skin weighted assessment tool score data were collected to determine response, duration of response, survival, and toxicity. The outcomes were analyzed according to the patient's stage before TSEB, prognostic factors, and adjuvant treatments. Results: Seventeen patients were stage 1B, 19 were stage IIB, 3 were stage III, and 2 were stage IV. The overall response rate was 95%, with a complete response rate of 51%. Seventy-six percent of patients had relapsed at median follow-up of 18 months. The median time to relapse was 12 months, to systemic therapy was 15 months, and to modified skin weighted assessment tool progression above baseline was 44 months. The complete response rate was 59% in stage IB and 47% in stage IIB patients. The median time to skin relapse was longer in stage IB compared with stage IIB, 18 months versus 9 months. The median time to systemic therapy was longer in stage IB compared with stage IIB, >56 months versus 8 months. The median overall survival was 35 months: >56 months for stage IB, 25 months for stage IIB, 46 months for stage III, and 23.5 months for stage IV. Fifteen patients received adjuvant psoralen + ultraviolet A treatment with no difference seen in the time to relapse. Conclusions: This 5-week schedule of TSEB for MF has a high response rate with comparable duration of response to other regimens. Future studies are needed to find adjuvant and combination treatments to improve the duration of response.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2015

A Randomized Phase 2 Study Comparing 2 Stereotactic Body Radiation Therapy Schedules for Medically Inoperable Patients With Stage I Peripheral Non-Small Cell Lung Cancer: NRG Oncology RTOG 0915 (NCCTG N0927)

Purpose: To compare 2 stereotactic body radiation therapy (SBRT) schedules for medically inoperable early-stage lung cancer to determine which produces the lowest rate of grade ≥3 protocol-specified adverse events (psAEs) at 1 year. Methods and Materials: Patients with biopsy-proven peripheral (≥2 cm from the central bronchial tree) T1 or T2, N0 (clinically node negative by positron emission tomography), M0 tumors were eligible. Patients were randomized to receive either 34 Gy in 1 fraction (arm 1) or 48 Gy in 4 consecutive daily fractions (arm 2). Rigorous central accreditation and quality assurance confirmed treatment per protocol guidelines. This study was designed to detect a psAEs rate >17% at a 10% significance level (1-sided) and 90% power. Secondary endpoints included rates of primary tumor control (PC), overall survival (OS), and disease-free survival (DFS) at 1 year. Designating the better of the 2 regimens was based on prespecified rules of psAEs and PC for each arm. Results: Ninety-four patients were accrued between September 2009 and March 2011. The median follow-up time was 30.2 months. Of 84 analyzable patients, 39 were in arm 1 and 45 in arm 2. Patient and tumor characteristics were balanced between arms. Four (10.3%) patients on arm 1 (95% confidence interval [CI] 2.9%-24.2%) and 6 (13.3%) patients on arm 2 (95% CI 5.1%-26.8%) experienced psAEs. The 2-year OS rate was 61.3% (95% CI 44.2%-74.6%) for arm 1 patients and 77.7% (95% CI 62.5%-87.3%) for arm 2. The 2-year DFS was 56.4% (95% CI 39.6%-70.2%) for arm 1 and 71.1% (95% CI 55.5%-82.1%) for arm 2. The 1-year PC rate was 97.0% (95% CI 84.2%-99.9%) for arm 1 and 92.7% (95% CI 80.1%-98.5%) for arm 2. Conclusions: 34 Gy in 1 fraction met the prespecified criteria and, of the 2 schedules, warrants further clinical research.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2018

An automatic performance model-based scheduling tool for coupled climate system models

The prediction of the climate system is highly depended on the efficient integration of observations and simulations of the Earth. This is regarded as a canonical example of the cyber-physical system. The climate system model, the simulation engine in this cyber-physical system, is one of most challenging applications in scientific computing. It utilizes the multi-physics simulation that couples multiple components, conducts decadal to millennium simulations, and has long been an important application on supercomputers. However, current climate system models suffer from the inefficient task scheduling methods resulting in an intolerable simulation time. Take the Community Earth System Model (CESM), the most widely used climate system model, as an example, one major reason that CESM suffers from bad performances is the huge overhead to rationally distribute processes among the coupled heterogeneous components. According to the report of NCAR, every percent improvement in CESM performance frees up to the equivalent of $250,000 in computing resources in their scientific experiments. To address such challenge, our paper firstly constructs a lightweight and accurate performance model for effectively capturing and predicting the heterogeneous time-to-solution performance of end-to-end CESM components with a given simulation configuration. Then, based on the performance model, we further propose an efficient scheduling strategy based on rectangular packing method to determine the best process layout among different components, and the process numbers assigned to each component. Our evaluations show that we can achieve 58% average run time reductions on CESM comparing to the widely used sequential process layout for a scale of 144 to 480 cores on typical CPU clusters. And we can save 4 million CPU hours when we conduct one standard scientific experiment (a 2870-year simulation), which equals to save $40,089 with a charge of $0.01 per CPU hour. Meanwhile, 26% extra performance improvements could also be gained in our methods comparing to the heuristic branch and bound algorithm with the guidance of the known curve-fitting performance model.

58 GEOSCIENCES↗
DOE OSTI2019

Application of Quantum Annealing to Nurse Scheduling Problem

Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice. We investigate the empirical performance of quantum annealing to solve the Nurse Scheduling Problem (NSP) with hard constraints using the D-Wave 2000Q quantum annealing device. NSP seeks the optimal assignment for a set of nurses to shifts under an accompanying set of constraints on schedule and personnel. After reducing NSP to a novel Ising-type Hamiltonian, we evaluate the solution quality obtained from the D-Wave 2000Q against the constraint requirements as well as the diversity of solutions. For the test problems explored here, our results indicate that quantum annealing recovers satisfying solutions for NSP and suggests the heuristic method is potentially achievable for practical use. Moreover, we observe that solution quality can be greatly improved through the use of reverse annealing, in which it is possible to refine returned results by using the annealing process a second time. We compare the performance of NSP using both forward and reverse annealing methods and describe how this approach might be used in practice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Improving the Scheduling Efficiency of a Global Multi-Core HTCondor Pool in CMS

Scheduling multi-core workflows in a global HTCondor pool is a multi-dimensional problem whose solution depends on the requirements of the job payloads, the characteristics of available resources, and the boundary conditions such as fair share and prioritization imposed on the job matching to resources. Within the context of a dedicated task force, CMS has increased significantly the scheduling efficiency of workflows in reusable multi-core pilots by various improvements to the limitations of the GlideinWMS pilots, accuracy of resource requests, efficiency and speed of the HTCondor infrastructure, and job matching algorithms.

Bockelman, Brian Paul↗
DOE OSTI2015

Adaptive track scheduling to optimize concurrency and vectorization in GeantV

The GeantV project is focused on the R&D of new particle transport techniques to maximize parallelism on multiple levels, profiting from the use of both SIMD instructions and co-processors for the CPU-intensive calculations specific to this type of applications. In our approach, vectors of tracks belonging to multiple events and matching different locality criteria must be gathered and dispatched to algorithms having vector signatures. While the transport propagates tracks and changes their individual states, data locality becomes harder to maintain. The scheduling policy has to be changed to maintain efficient vectors while keeping an optimal level of concurrency. The model has complex dynamics requiring tuning the thresholds to switch between the normal regime and special modes, i.e. prioritizing events to allow flushing memory, adding new events in the transport pipeline to boost locality, dynamically adjusting the particle vector size or switching between vector to single track mode when vectorization causes only overhead. Lastly, this work requires a comprehensive study for optimizing these parameters to make the behaviour of the scheduler self-adapting, presenting here its initial results.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2017

CMS readiness for multi-core workload scheduling

In the present run of the LHC, CMS data reconstruction and simulation algorithms benefit greatly from being executed as multiple threads running on several processor cores. The complexity of the Run 2 events requires parallelization of the code to reduce the memory-per- core footprint constraining serial execution programs, thus optimizing the exploitation of present multi-core processor architectures. The allocation of computing resources for multi-core tasks, however, becomes a complex problem in itself. The CMS workload submission infrastructure employs multi-slot partitionable pilots, built on HTCondor and GlideinWMS native features, to enable scheduling of single and multi-core jobs simultaneously. This provides a solution for the scheduling problem in a uniform way across grid sites running a diversity of gateways to compute resources and batch system technologies. This paper presents this strategy and the tools on which it has been implemented. The experience of managing multi-core resources at the Tier-0 and Tier-1 sites during 2015, along with the deployment phase to Tier-2 sites during early 2016 is reported. The process of performance monitoring and optimization to achieve efficient and flexible use of the resources is also described.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Robust Scheduling of Microgrids With Resiliency Constraints

This paper proposes a novel microgrid scheduling model considering the resiliency requirements. The resiliency of the microgrid is guaranteed by quickly adjusting the output of committed local resources to supply the local demands continuously when the supply of power from the main grid is interrupted. To capture the prevailing uncertainties in renewable generation and demand, a two-stage robust optimization model is formulated to minimize the total operating cost under the worst realization of the modeled uncertainties. The column and constraint generation (CCG) method is used to solve the problem in an iterative manner. The solution of the proposed robust scheduling model guarantees the resiliency of the microgrid by supporting a quick islanding without consumer interruption and ensures the robustness against uncertainties in renewable generation and demand.

Liu, Guodong↗
DOE OSTI2020

Resilient Microgrid Scheduling Considering Multi-Level Load Priorities

In this paper, we propose a novel resilient microgrid scheduling model considering the multi-level load priorities. The resiliency of the microgrid is guaranteed by quickly adjusting the output of committed local resources and shedding the loads with low priorities when the power supply from the main grid is interrupted. Considering the uncertainty of renewable energy resources and loads as well as exchanged power at PCC, the probability of successful islanding (PSI) is used to quantify the resiliency of electricity supply for various loads with different priorities. Then, the multi-level priorities are enforced through chance constrains. Results of numerical simulation validate the proposed resilient scheduling model. In addition, the impacts of resiliency requirement of loads with high priority on the resiliency of loads with low priority are analyzed as well.

Liu, Guodong↗
DOE OSTI2020

Vehicle to Grid Frequency Regulation Capacity Optimal Scheduling for Battery Swapping Station Using Deep Q-Network

Battery swapping stations (BSSs) are ideal candidates for fast frequency regulation services (FFRS) due to their large battery stock capacity. In addition, BSSs can precharge batteries for customers and the batteries that are not in charging can provide a stable regulation capacity to the market. However, uncertainties, such as ACE signals and the EV per-hour visit counts, introduce stochastic nonlinear dynamics into the operation of a BSS-based FFRS. Currently, there is no quantification method to ensure its optimal economical operation. To close this gap, in this article, we propose a novel deep Q-learning-based FFRS capacity dynamic scheduling strategy. This method can autonomously schedule the hourly regulation capacity in real time to maximize the BSSx0027;s revenue for providing FFRS. Case studies using real-world data verify the efficacy of the proposed work.

25 ENERGY STORAGE↗
DOE OSTI2018

Scheduling of Collaborative Sequential Compressed Sensing Over Wide Spectrum Band

The cognitive radio (CR) technology holds promise to significantly increase spectrum availability and wireless network capacity. With more spectrum bands opened up for CR use, it is critical yet challenging to perform efficient wideband sensing. In this work, we propose an integrated sequential wideband sensing scheduling framework that concurrently exploits sequential detection and compressed sensing (CS) techniques for more accurate and lower-cost spectrum sensing. First, to ensure more timely detection without incurring high overhead involved in periodic recovery of CS signals, we propose smart scheduling of a CS-based sequential wideband detection scheme to effectively detect the PU activities in the wideband of interest. Second, to further help users under severe channel conditions identify the occupied sub-channels, we develop two collaborative strategies, namely, joint reconstruction of the signals among neighboring users and wideband sensing-map fusion. Third, to achieve robust wideband sensing, we propose the use of anomaly detection in our framework. Lastly, extensive simulations demonstrate that our approach outperforms peer schemes significantly in terms of sensing delay, accuracy and overhead.

42 ENGINEERING↗
DOE OSTI2021

Fuzzified PaCcET for Economic-Emission Scheduling of Microgrids

In this paper, a new approach is proposed to solve a multi-objective economic-emission scheduling problem in microgrids (MGs) by simultaneously minimizing the energy and emission costs of the MG with various distributed energy resources (DERs). The proposed approach is an extension of a computationally effective multiobjective optimization technique, Pareto concavity elimination transformation (PaCcET). The proposed approach, referred to as Fuzzified-PaCcET, employs a fuzzy logic controller to dynamically revise crossover and mutation rates in the original PaCcET leading to the faster convergence of the solution. The proposed approach finds the best Pareto front, also referred to as a Non-dominated set (NDS) of solutions, instead of finding a single optimal solution. In order to find the solutions on concave areas of the Pareto front, an iterative objective space transformation is performed in the PaCcET algorithm to allow a linear combination of objective functions (in the transformed objective space). The proposed Fuzzified-PaCcET-based scheduling is implemented on a MG with various dispatchable and non-dispatchable DERs to find the set of optimal solutions according to the total fuel cost of DERs, as well as the most optimum environmental cost. In order to extract the best compromise solution (BCS) among NDS of solutions, a fuzzy-based method is implemented. The comparison of the simulation results of the Fuzzified-PaCcET with that of PaCcET shows that Fuzzified-PaCcET can generate better solution with less computational burden.

Gautam, Mukesh↗
DOE OSTI2015

Scheduling and Pricing for Expected Ramp Capability in Real-Time Power Markets

Higher variable renewable generation penetrations are occurring throughout the world on different power systems. These resources increase the variability and uncertainty on the system which must be accommodated by an increase in the flexibility of the system resources in order to maintain reliability. Many scheduling strategies have been discussed and introduced to ensure that this flexibility is available at multiple timescales. To meet variability, that is, the expected changes in system conditions, two recent strategies have been introduced: time-coupled multi-period market clearing models and the incorporation of ramp capability constraints. To appropriately evaluate these methods, it is important to assess both efficiency and reliability. But it is also important to assess the incentive structure to ensure that resources asked to perform in different ways have the proper incentives to follow these directions, which is a step often ignored in simulation studies. Here we find that there are advantages and disadvantages to both approaches. We also find that look-ahead horizon length in multi-period market models can impact incentives. This paper proposes scheduling and pricing methods that ensure expected ramps are met reliably, efficiently, and with associated prices based on true marginal costs that incentivize resources to do as directed by the market. Case studies show improvements of the new method.

25 ENERGY STORAGE↗
DOE OSTI2018

Mean-Variance Optimization-Based Energy Storage Scheduling Considering Day-Ahead and Real-Time LMP Uncertainties

In this letter, a new mean-variance optimization-based energy storage scheduling method is proposed with the consideration of both day-ahead (DA) and real-time (RT) energy markets price uncertainties. It considers the locational marginal price (LMP) forecast uncertainties in the DA and RT markets. The energy storage arbitrage risk associated with the LMP forecast uncertainty is explicitly modeled through the variance component in the objective function. The quadratic term of this variance is transformed into a second-order cone constraint using the charging and discharging power complementarity of the energy storage system. Finally, the proposed model is formulated as a mixed-integer conic programming problem. Numerical case studies demonstrate the effectiveness of the proposed model for energy storage scheduling considering price uncertainty.

25 ENERGY STORAGE↗