A bottleneck detection algorithm for complex product assembly line based on maximum operation capacity
From MaRDI portal
Publication:1717975
DOI10.1155/2014/258173zbMath1407.90139OpenAlexW2120578672WikidataQ59065149 ScholiaQ59065149MaRDI QIDQ1717975
Dongping Zhao, Junhao Geng, Xitian Tian
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/258173
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Cites Work
- Unnamed Item
- Bottlenecks in serial production lines: A system-theoretic approach
- \(c\)-bottlenecks in serial production lines: Identification and application
- Learning effects and the phenomenon of moving bottlenecks in a two-stage production system
- Algorithmic graph theory and perfect graphs
- A numerical method for singularly perturbed turning point problems with an interior layer
- Real time production improvement through bottleneck control
- Data driven bottleneck detection of manufacturing systems
- Beyond the flow decomposition barrier
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Homogeneous, asymptotically reliable serial production lines: theory and a case study
- Performance evaluation of unbalanced serial production lines
- A Max-Flow/Min-Cut Algorithm for Linear Deterministic Relay Networks
- An $o(n^3 )$-Time Maximum-Flow Algorithm
This page was built for publication: A bottleneck detection algorithm for complex product assembly line based on maximum operation capacity
