Dynamic scheduling of hybrid flow shop problem with uncertain process time and flexible maintenance using NeuroEvolution of Augmenting Topologies
A hybrid flow shop is pivotal in modern manufacturing systems, where various emergencies and disturbances occur within the smart manufacturing context. Efficiently solving the dynamic hybrid flow shop scheduling problem (HFSP), characterised by dynamic release times, uncertain job processing times,...
Gespeichert in:
Veröffentlicht in: | IET collaborative intelligent manufacturing 2024-09, Vol.6 (3), p.n/a |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A hybrid flow shop is pivotal in modern manufacturing systems, where various emergencies and disturbances occur within the smart manufacturing context. Efficiently solving the dynamic hybrid flow shop scheduling problem (HFSP), characterised by dynamic release times, uncertain job processing times, and flexible machine maintenance has become a significant research focus. A NeuroEvolution of Augmenting Topologies (NEAT) algorithm is proposed to minimise the maximum completion time. To improve the NEAT algorithm's efficiency and effectiveness, several features were integrated: a multi‐agent system with autonomous interaction and centralised training to develop the parallel machine scheduling policy, a maintenance‐related scheduling action for optimal maintenance decision learning, and a proactive scheduling action to avoid waiting for jobs at decision moments, thereby exploring a broader solution space. The performance of the trained NEAT model was experimentally compared with the Deep Q‐Network (DQN) and five classical priority dispatching rules (PDRs) across various problem scales. The results show that the NEAT algorithm achieves better solutions and responds more quickly to dynamic changes than DQN and PDRs. Furthermore, generalisation test results demonstrate NEAT's rapid problem‐solving ability on test instances different from the training set.
The NEAT algorithm is applied to the dynamic hybrid flow shop scheduling problem, using a multi‐agent system with centralised training and distributed execution to learn the scheduling policy, where initial job sorting dictates later stage constraints. The approach involves evolving neural networks through initialisation, interaction, and elitist selection, leading to an optimal scheduling agent. |
---|---|
ISSN: | 2516-8398 2516-8398 |
DOI: | 10.1049/cim2.12119 |