Improved genetic algorithm for optimizing flexible workshop scheduling

In automated production lines, flexible workshop scheduling is essential for optimizing resource allocation and ensuring efficient production. This study develops an efficient scheduling strategy to enhance the distribution of processing and handling tasks. Addressing the issues of local optima and slow convergence in traditional Genetic search algorithms, we introduce an improved Genetic algorithm (GA) that dynamically adjusts the crossover and mutation rates. Additionally, it sorts individuals based on their fitness during the crossover process, significantly improving the quality and efficiency of solutions. Simulation results demonstrate that the improved algorithm significantly outperforms traditional methods in task completion, reducing the time from 198 to 146 unit times, a decrease of 26%. Furthermore, the algorithm exhibits faster convergence and superior optimization capabilities.

Authors

Institutions

Publication Details

Published
2025-01-16
DOI
https://doi.org/10.1117/12.3051800
Citations
1
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
1.24
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved genetic algorithm for optimizing flexible workshop scheduling

Xiaolin Peng, D. W. Wang, Hengfeng Qin
1 citations
Scheduling and Optimization Algorithms
1.24
article

Improved genetic algorithm for optimizing flexible workshop scheduling

Xiaolin Peng, D. W. Wang, Hengfeng Qin
article en
1 citations

Abstract

In automated production lines, flexible workshop scheduling is essential for optimizing resource allocation and ensuring efficient production. This study develops an efficient scheduling strategy to enhance the distribution of processing and handling tasks. Addressing the issues of local optima and slow convergence in traditional Genetic search algorithms, we introduce an improved Genetic algorithm (GA) that dynamically adjusts the crossover and mutation rates. Additionally, it sorts individuals based on their fitness during the crossover process, significantly improving the quality and efficiency of solutions. Simulation results demonstrate that the improved algorithm significantly outperforms traditional methods in task completion, reducing the time from 198 to 146 unit times, a decrease of 26%. Furthermore, the algorithm exhibits faster convergence and superior optimization capabilities.

Xiangtan University (CN)
Openalex Percentile: Top 23%
Scheduling and Optimization Algorithms
1.24
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.