Programming Model for Enterprise Multi-Process Decision Optimization
DOI:
https://doi.org/10.54097/46yd8f73Keywords:
0-1 Planning Model, Genetic Algorithm, Optimal StrategyAbstract
This paper addresses critical decision-making challenges faced by enterprises during the production process, particularly focusing on efficient quality inspection, inspection and disassembly decisions, defective rate control, and cost minimization. In the current dynamic market environment, existing algorithms demonstrate insufficient adaptability, hindering their effectiveness in addressing complex production scenarios. To overcome these limitations, we propose a novel genetic algorithm that incorporates dynamic change adjustment through a 0-1 programming model. This approach enhances the algorithm's flexibility, enabling enterprises to develop scientifically sound and rational production decision schemes tailored to varying market conditions. Our empirical analysis reveals that the average production cost for enterprises utilizing this method is 32.7, indicating significant potential for cost reduction while maintaining product quality. The findings contribute to the existing literature by providing a robust theoretical framework that underscores the importance of adaptive algorithms in improving production efficiency and decision-making processes in an ever-evolving market landscape.
Downloads
References
[1] Song Yuxi. Heuristic Algorithm for Workshop Production Resource Scheduling and Allocation Problem [D]. Huazhong University of Science and Technology, 2021.
[2] Wang Wenbo. Research on intelligent Scheduling of crane in steelmaking workshop based on greedy rule genetic algorithm [D]. Metallurgical Automation Research and Design Institute, 2024.
[3] Zhang Hongwei, Zhang Xiangfeng, Wen Chuanbo. An Improved Genetic Algorithm with Full Crossover Operators [J]. Journal of Shanghai Institute of Electrical Engineering, 2017.
[4] Wang Jiannan, Cui Yinghua. Real coded genetic algorithm based on adaptive mutation operators [J]. Journal of Beijing University of Information Science and Technology (Natural Science Edition), 2021.
[5] Diana S, Ganapathy L, Pundir A K. An improved genetic algorithm for resource constrained project scheduling problem [J]. International Journal of Computer Applications, 2013, 78(9).
[6] Avijit Duary; Md Sadikur Rahman;;Ali Akbar Shaikh; Seyed Taghi Akhavan Niaki;;Asoke Kumar B hunia. A new hybrid algorithm to solve bound-constrained nonlinear optimization problems [J]. Ne ural Computing and Applications, 2020.
[7] Wei Yining, Shao Yibing, Ji Xiaofen. Balance optimization of garment hanging production line based on improved non-dominated sorting genetic algorithm [J/OL]. Journal of Zhejiang University of Science and Technology (Natural Science Edition), 1-11[2024-10-02].
[8] Huo Junjie, Wang Zhijian. Integrated optimization of process planning and shop scheduling using new coding GA [J]. Modern Manufacturing Engineering, 2024, (09):25-33.
[9] Xue Feng, Jing Fuying. Research on Dynamic Batch Decision of perishable products under production capacity constraints [J]. Value Engineering, 2024.
[10] Wang Yun. Research on combination and layout method of low impact development facilities based on 0-1 integer model and random sampling [D]. Anhui University of Technology, 2020.
[11] Li Chen, Ji Tongxuan. Research on Flow shop Scheduling Problem based on Improved Heuristic Genetic Algorithm [J]. China New Communications, 2022.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.