Abstract

Predicting throughput bottlenecks has received an increasing research attention in the recent years. Several statistical and machine learning models have been developed, with the objective of identifying future bottleneck locations for more efficient and cost-saving productions. However, bottleneck prediction remains a challenging task due to the complexity of manufacturing systems and the interactive effects from many impacting factors. This paper proposed the BSTAN (bottleneck spatial-temporal attention network) – an interpretable modeling framework to improve system bottlenecks prediction capability for complex manufacturing systems by: (1) characterizing line topological features using graph representations; (2) modeling spatial-temporal relationships and interactions between stations using graph attention network with gated recurrent units. In this proposed framework, the production line is first transformed into the representation of a weighted undirected graph to depict network structural information of a production line. An attention-based graph neural network with gated recurrent units is applied to capture both the temporal trends and station interactions to predict each station’s blockage and starvation. Future bottleneck stations are identified by analyzing the forecasted blockage and starvation distribution. To evaluate the model performance, an industrial case study is performed with data collected from a one-year production at an automotive powertrain assembly line. With the proper model construction, BSTAN has outperformed both statistical and machine learning benchmark models, achieving up to 15% lower root mean square error compared to the best benchmark method in predicting overall system blockage and starvation time.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.