Research on Production Decision-Making of Assembly Enterprises Based on Dynamic Bayesian Sampling and Multi-Stage Optimization
DOI:
https://doi.org/10.54097/gdtf6q35Keywords:
Bayesian derivation; dynamic programming; backtracking algorithm.Abstract
This paper focuses on the production decision-making problems of electronic product assembly enterprises, and comprehensively uses probability theory, statistics and optimization theory to construct a series of innovative models and algorithms. For the sampling detection of spare parts, hypothesis testing and Bayesian step-by-step adjustment model based on normal distribution improvement are proposed to effectively balance the detection cost and decision-making reliability. In terms of production decision optimization, dynamic programming, backtracking algorithm and generalized multivariate scheme planning model are used to accurately analyze different production scenarios and determine the optimal strategy at each stage. Through multi-model and algorithm collaboration, it helps enterprises optimize costs and improve benefits in complex production environments, and provides efficient and practical solutions for production decision-making in the assembly industry, which has significant application value.
Downloads
References
[1] Sundgren N. Introducing interface management in new product family development[J]. Journal of Product Innovation Management: An International Publication of the Product Development & Management Association, 1999, 16(1): 40-51.
[2] Harjunkoski I, Maravelias C T, Bongers P, et al. Scope for industrial applications of production scheduling models and solution methods[J]. Computers & Chemical Engineering, 2014, 62: 161-193.
[3] Ioannidou O, Erduran S. Beyond hypothesis testing: Investigating the diversity of scientific methods in science teachers’ understanding[J]. Science & Education, 2021, 30(2): 345-364.
[4] Chen Z, Mak S, Wu C F J. A hierarchical expected improvement method for Bayesian optimization[J]. Journal of the American Statistical Association, 2024, 119(546): 1619-1632.
[5] Barto A G, Bradtke S J, Singh S P. Learning to act using real-time dynamic programming[J]. Artificial intelligence, 1995, 72(1-2): 81-138.
[6] Alekhnovich M, Borodin A, Buresh-Oppenheim J, et al. Toward a model for backtracking and dynamic programming[J]. computational complexity, 2011, 20: 679-740.
[7] Su Z, Wang H, Yao P. A hybrid backtracking search optimization algorithm for nonlinear optimal control problems with complex dynamic constraints[J]. Neurocomputing, 2016, 186: 182-194.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Highlights in Science, Engineering and Technology

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.