Research on Flexible Workshop Scheduling Algorithm Based on Improved Genetic Algorithm
preprint
OA: closed
CC-BY-4.0
Abstract
Abstract With the proposal of "Made in China 2025", the manufacturing industry is rapidly integrating with information technology, accelerating the pace of construction of smart factories, and reducing labor costs by establishing factories with few people and no one.Scheduling algorithm of flexible shop is the key technology to realize automatic processing of production line. The limited resources of shop can be allocated rationally through scheduling algorithm to complete automatic production.According to the requirements of automatic production line, this chapter realizes the assignment of processing task and handling task in turn.The classical genetic algorithm is easy to fall into local optimization and slow convergence.An improved genetic algorithm is adopted to introduce dynamic crossover and mutation probability. In addition, when the algorithm performs crossover operation, the individuals are first sorted according to their fitness values, and then cross operation is carried out successively.Through the simulation experiment, it is found that the task completion time obtained by the improved algorithm is 146 units of time, compared with the 198 units of time obtained before the improvement, the task completion time is reduced by 26%, and the improved algorithm has better convergence speed, so the improved algorithm has better optimization performance.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-22T02:00:06.705733+00:00
License: CC-BY-4.0