.png){kind=icon}
.png){kind=icon}
Return
Flexible integrated scheduling algorithm based on remaining work probability selection coding
.png){kind=icon}
PRE
AI
DOI：10.1111/exsy.12683.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Aiming at the integrated scheduling problem of tree-structured products with flexible machine selection, this article proposes a flexible integrated scheduling algorithm based on remaining work probability selection coding. The algorithm is based on the framework of a genetic algorithm. First, in order to ensure the diversity and goodness of the initial population, an encoding method based on remaining work probability selection is proposed. Second, two new different crossover and mutation methods are designed based on operation and position respectively, which ensure the legitimacy of the generated offspring individuals. Then, in order to enhance the searchability of the algorithm for an optimal solution of the problem, a local search strategy based on the machine is proposed. Finally, a simple and effective decoding method based on the idle period is given. The algorithm is tested by the existing instance and randomly generated instances. The experimental results show that the proposed algorithm's solving speed and solution quality outperform other comparison algorithms.
Keywords:
flexible machine
genetic algorithm
integrated scheduling algorithm
processing and assembly
tree‐ structured products
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.3
Papers:
2.5K
Citations:
3.8K
Organization
No organization information available