Optimal Design of Process Flexibility for General Production Systems
June 07, 2018 Β· Declared Dead Β· π Operational Research
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Xi Chen, Tengyu Ma, Jiawei Zhang, Yuan Zhou
arXiv ID
1806.02894
Category
cs.DS: Data Structures & Algorithms
Cross-listed
math.OC
Citations
26
Venue
Operational Research
Last Checked
3 months ago
Abstract
Process flexibility is widely adopted as an effective strategy for responding to uncertain demand. Many algorithms for constructing sparse flexibility designs with good theoretical guarantees have been developed for balanced and symmetrical production systems. These systems assume that the number of plants equals the number of products, that supplies have the same capacity, and that demands are independently and identically distributed. In this paper, we relax these assumptions and consider a general class of production systems. We construct a simple flexibility design to fulfill $(1-Ξ΅)$-fraction of expected demand with high probability (w.h.p.) where the average degree is $O(\ln(1/Ξ΅))$. To motivate our construction, we first consider a natural weighted probabilistic construction from Chou et al. (2011) where the degree of each node is proportional to its expected capacity. However, this strategy is shown to be sub-optimal. To obtain an optimal construction, we develop a simple yet effective thresholding scheme. The analysis of our approach extends the classical analysis of expander graphs by overcoming several technical difficulties. Our approach may prove useful in other applications that require expansion properties of graphs with non-uniform degree sequences.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted