SearcharxivSearch

arXiv · 2308.12640

Dedicated maintenance and repair shop control for spare parts networks

Abstract

We study a repairable inventory system dedicated to a single component that is critical in operating a capital good. The system consists of a stock point containing spare components, and a dedicated repair shop responsible for repairing damaged components. Components are replaced using an age-replacement strategy, which sends components to the repair shop either preventively if it reaches the age-threshold, and correctively otherwise. Damaged components are replaced by new ones if there are spare components available, otherwise the capital good is inoperable. If there is free capacity in the repair shop, then the repair of the damaged component immediately starts, otherwise it is queued. The manager decides on the number of repairables in the system, the age-threshold, and the capacity of the repair shop. There is an inherent trade-off: A low (high) age-threshold reduces (increases) the probability of a corrective replacement but increases (decreases) the demand for repair capacity, and a high (low) number of repairables in the system leads to higher (lower) holding costs, but decreases (increases) the probability of downtime. We first show that the single capital good setting can be modelled as a closed queuing network with finite population, which we show is equivalent to a single queue with fixed capacity and state-dependent arrivals. For this queue, we derive closed-form expressions for the steady-state distribution. We subsequently use these results to approximate performance measures for the setting with multiple capital goods.

Explore related subjects

Keep this discovery

BibTeXRIS

Chaaben Kouki, Melvin Drent, Collin Drent, Mohamed Zied Babai. 2023-08-24. Dedicated maintenance and repair shop control for spare parts networks. https://arxiv.org/abs/2308.12640

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR