SearcharxivSearch

arXiv · 1902.08773

Managing mobile production-inventory systems influenced by a modulation process

Abstract

We investigate the potential added value of being able to relocate production capacity, relative to fixed production capacity, in a network of multiple, geographically distributed manufacturing sites. There is a growing interest in production capacity that can be geographically relocated; e.g., modular units for pharmaceutical intermediates. It shows promise for enabling the fast fulfillment of a distributed network with a reduction in the total inventory and total production capacity of a distributed network with fixed production capacity without sacrificing customer service levels or total system resilience. Allowing also for transshipment, we model a production-inventory system with L production sites and Y units of relocatable production capacity, develop efficient and effective heuristic solution methods for dynamic relocation and multi-location inventory control, and analyze the potential added value. We describe the (L, Y) problem as a problem of sequential decision making under uncertainty to determine transshipment, mobile production capacity relocation, and replenishment decisions at each decision epoch. To enhance model realism, we use a partially observed stochastic process, the modulation process, to model the exogenous and partially observable forces (e.g., the macro-economy) that affect demand. We then model the (L, Y) problem as a partially observed Markov decision process. Due to the considerable computational challenges of solving this model exactly, we propose two efficient, high quality heuristics. We show for an instance set with five locations that production capacity mobility and transshipment, relative to the fixed production capacity case, can improve systems performance by as much as 41\% on average over the no-flexibility case and that production capacity mobility can yield as much as 10\% more savings compared to when only transshipment is permitted.

Explore related subjects

Keep this discovery

BibTeXRIS

Satya S. Malladi, Alan L. Erera, Chelsea C. White III. 2019-02-23. Managing mobile production-inventory systems influenced by a modulation process. https://arxiv.org/abs/1902.08773

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

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC