PRODUCTION SCHEDULING OPTIMIZATION MODEL BASED ON DYNAMIC PROGRAMMING AND GENETIC ALGORITHM

In view of the problem that enterprises can not improve their profits due to the difficulty in planning reasonable decision-making schemes in real life, this paper proposes a dynamic programming model of production decision-making based on genetic algorithm. Firstly, a joint target benefit model considering the detection cost of parts, the purchase price of parts, semi-finished products, the assembly cost of finished products, the loss of replacement, semi-finished products, the disassembly cost of finished products, the disassembly of semi-finished products into parts, the disassembly compensation of finished products into semi-finished products, and the market price is established. Then, the genetic algorithm is used to optimize the variables of whether to detect parts, whether to detect semi-finished products, and whether to disassemble finished products ( 0-1 ). Finally, taking an actual production plan as an example, the validity of the model is verified, and the decision-making plan when the profit is the largest is obtained. This paper proposes a genetic algorithm-based dynamic programming model for production decision-making, which comprehensively considers various cost and price factors to optimize decision variables, thereby improving production efficiency and profit margins, and is verified to be valid through an actual production plan.

Institutions

Publication Details

Journal
Journal of Computer Science and Electrical Engineering
Published
2025-03-26
DOI
https://doi.org/10.61784/jcsee3048
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PRODUCTION SCHEDULING OPTIMIZATION MODEL BASED ON DYNAMIC PROGRAMMING AND GENETIC ALGORITHM

Journal of Computer Science and Electrical Engineering
Advanced Manufacturing and Logistics Optimization
article

PRODUCTION SCHEDULING OPTIMIZATION MODEL BASED ON DYNAMIC PROGRAMMING AND GENETIC ALGORITHM

article en

Abstract

In view of the problem that enterprises can not improve their profits due to the difficulty in planning reasonable decision-making schemes in real life, this paper proposes a dynamic programming model of production decision-making based on genetic algorithm. Firstly, a joint target benefit model considering the detection cost of parts, the purchase price of parts, semi-finished products, the assembly cost of finished products, the loss of replacement, semi-finished products, the disassembly cost of finished products, the disassembly of semi-finished products into parts, the disassembly compensation of finished products into semi-finished products, and the market price is established. Then, the genetic algorithm is used to optimize the variables of whether to detect parts, whether to detect semi-finished products, and whether to disassemble finished products ( 0-1 ). Finally, taking an actual production plan as an example, the validity of the model is verified, and the decision-making plan when the profit is the largest is obtained. This paper proposes a genetic algorithm-based dynamic programming model for production decision-making, which comprehensively considers various cost and price factors to optimize decision variables, thereby improving production efficiency and profit margins, and is verified to be valid through an actual production plan.

Journal of Computer Science and Electrical EngineeringVol. 7(2)
Guangdong Ocean University (CN)
Openalex Percentile: Top 93%
Advanced Manufacturing and Logistics Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.