Searcharxiv⌕ Search

arXiv · 2609.33988

Regime-Dependent Value of CVaR in Preventive Maintenance Scheduling under RUL Uncertainty

Abstract

We study preventive-maintenance scheduling for a small fleet when several assets compete for a limited number of maintenance slots and their remaining useful lives (RULs) are uncertain. The planning horizon is divided into discrete periods; each asset may be maintained at most once, and at most $K$ assets may be maintained in any one period. Future usage and RUL errors are represented by scenarios. We compare a risk-neutral policy that minimizes expected cost with a risk-aware policy that minimizes expected cost plus conditional value-at-risk (CVaR), where $\operatorname{CVaR}_{0.90}$ is the mean cost among the worst 10\% of scenarios. Both policies are solved exactly by enumerating all capacity-feasible schedules. A $3\times5$ experiment combines capacities $K=1,2,3$ with five increasing levels of RUL uncertainty, with ten paired replications for each combination. The risk-aware policy provides its largest benefit when RUL uncertainty is low-to-moderate and more than one maintenance action can be executed per period. In the best observed case, it reduces CVaR by 13.4\% with an expected-cost increase of only 0.2 relative cost units. At high uncertainty, the benefit becomes negligible and the two policies can select identical schedules. The results show that risk-aware scheduling creates operational value only when prognostic information is sufficiently informative and the maintenance system has enough flexibility to act on it.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jerzy Baranowski, Waldemar Bauer. 2026-09-27. Regime-Dependent Value of CVaR in Preventive Maintenance Scheduling under RUL Uncertainty. https://arxiv.org/abs/2609.33988

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Control Data Scheduling over Shared Communication Channels: A Sparse and Collision-Free Mechanism

In systems where controllers operate remotely and communicate with actuators over shared communication channels, it is crucial to efficiently schedule the control data transmission to reduce bandwidth usage and actuator effort. In this article, we investigate a novel scheduling mechanism that jointly coordinates control actions across different controllers and different time steps. We propose an algorithm based on the alternating direction method of multipliers (ADMM) to solve the resulting optimization problem. While ADMM is often treated as a black-box solver, the proposed algorithm offers a clear physical interpretation, ensures convergence to a stationary point, and is computationally efficient. Simulation results validate our theoretical results and demonstrate the effectiveness of our proposed algorithm.

eess.SY↗

Discrete-time polynomial systems with inputs and outputs: structure, reachability, observability, and minimal realizations

We study the realization problem for discrete-time input/output polynomial systems. These are formalized using tools from commutative algebra and algebraic geometry as systems whose state spaces are algebraic varieties, or more abstractly the set of k-points of an affine k-scheme, where k is an arbitrary infinite field. The input/output behaviors of such systems are described by "polynomial response maps" in which outputs are polynomial functions of past inputs. The main results show that every polynomial response map admits a canonical (quasi-reachable and algebraically observable) realization, which is unique up to isomorphism. The key to the approach is to linearize dynamics by considering a "dual" system in which states are functions defined on states. Finite dimensionality of the canonical realization, and its polynomiality, are characterized in terms of the space, algebra, and field of observables of the map, as well as in terms of algebraic input/output difference equations, and by a Jacobian rank criterion. A particular subclass consists of the maps that we call "bounded," defined by the property that their degree in the past inputs is uniformly bounded. Bounded maps are shown to be finitely realizable if and only if they are realizable by finite-dimensional state-affine systems, whose theory in turn reduces to that of rational formal power series. We also study the lattice of quasi-reachable realizations of a given map, including normal realizations. This work is an update of the PhD thesis written by the author in 1976; connections to recent work are briefly discussed in the last section.

eess.SY↗

Massachusetts' 2026 Clean Peak Standard Recalibration: Adaptation and Storage Tradeoffs

Massachusetts recalibrated its Clean Peak Standard (CPS) in 2026 by lowering the minimum standards and expanding the Near-Term Resource Multiplier for qualifying storage. This paper evaluates the change using a three-zone, hourly capacity expansion model for 2026--2030. Both scenarios achieve full CPS compliance, but the post-May scenario reduces new battery additions by 53.1% and modeled system cost by 3.7%. CPS-eligible discharge declines by 30.4%, while Clean Peak Energy Certificate production declines by only 9.5%. Fossil generation during CPS hours increases by 11.7%, whereas modeled emissions remain nearly unchanged because the Regional Greenhouse Gas Initiative cap binds. The recalibration therefore lowers the modeled storage capacity requirement while weakening physical clean-peak performance.

eess.SY↗