SearcharxivSearch

arXiv · 2204.06600

Load balancing in a network of queueing-inventory systems

Abstract

We study a supply chain consisting of production-inventory systems at several locations which are coupled by a common supplier. Demand of customers arrives at each production system according to a Poisson process and is lost if the local inventory is depleted ("lost sales"). To satisfy a customer's demand a server at the production system needs raw material from the associated local inventory. The supplier manufactures raw material to replenish the local inventories, which are controlled by a continuous review base stock policy. The routing of items depends on the on-hand inventory at the locations with the aim to obtain "load balancing". We show that the stationary distribution has a product form of the marginal distributions of the production subsystem and the inventory-replenishment subsystem. For the marginal distribution of the production subsystem we derive an explicit solution and for the marginal distribution of the inventory-replenishment subsystem we derive an explicit solution resp. a recursive algorithm for some special cases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sonja Otten. 2022-04-13. Load balancing in a network of queueing-inventory systems. https://doi.org/10.1007/s10479-022-05017-3

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