Throughput Bottleneck Prediction of Manufacturing Systems Using Time Series Analysis is a research paper published in Journal of Manufacturing Science and Engineering (2011). On theSindex it has a DataRank of 3.0. It has been cited 53 times, with 51 citing works in its 1-hop citation network.
Throughput bottlenecks define and constrain the productivity of a production line. The most cost-effective way to improve system throughput is to mitigate bottlenecks toward a balanced system. Most of the currently used bottleneck detection schemes found in literature utilize long-term analysis to identify the bottlenecks for a known period and ignore the operation dynamics leading to bottleneck shifts. This paper proposes a method for predicting the throughput bottlenecks of a production line using autoregressive moving average (ARMA) model. We consider the production blockage and starvation times of each station to be a time series used to predict throughput bottlenecks. It is realized that the blockage and starvation times of a production line are critical indicators reflecting the production system dynamics and its internal material flow. As the first attempt in literature for throughput bottleneck prediction, the results demonstrate that the ARMA model can accurately predict blockage and starvation information of each station and hence can accurately predict the system throughput bottleneck, which will lead to the most significant production improvement.
FAIR checklist signals are shown for context only and do not affect DataRank scoring.
Base Score Contribution
0.598
From this paper's citation signal
Citation Network Contribution
2.4
From 41 citing papers with measurable signal
Ranked by citation count — the same ordering the engine uses when summing log1p(Cq) over citers.
DataRank blends this paper's own citation count with the influence of the papers that cite it. Here, roughly 20% comes from its base citations and 80% from the citation network (41 citing papers contributed measurable signal).
Citers are pulled from OpenAlex sorted by cited_by_count:descand capped per paper, so when the cap binds we keep the highest-signal references and the score is reproducible across reruns.
Click a node to highlight its connections. Use scroll to zoom. Drag to pan.