A Discrete Improved Gray Wolf Optimization Algorithm for Dynamic Distributed Flexible Job Shop Scheduling Considering Random Job Arrivals and Machine Breakdowns

Dueto uncertainties in real-world production, dynamic factors have become increasingly critical in the research of distributed flexible job shop scheduling problems. Effectively responding to dynamic events can significantly enhance the adaptability and quality of scheduling solutions, thereby impro...

Full description

Saved in:
Bibliographic Details
Published in:Processes Vol. 13; no. 7; p. 1987
Main Authors: Wang, Chun, Chen, Jiapeng, Xu, Binzi, Liu, Sheng
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.07.2025
Subjects:
Algorithms
Analysis
Arrivals
Breakdown
Decision making
Factories
Genetic algorithms
Job shop scheduling
Manufacturing
Mathematical models
Mathematical optimization
Occupations
Optimization
Stability
Workshops
ISSN:2227-9717, 2227-9717
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Dueto uncertainties in real-world production, dynamic factors have become increasingly critical in the research of distributed flexible job shop scheduling problems. Effectively responding to dynamic events can significantly enhance the adaptability and quality of scheduling solutions, thereby improving the resilience of manufacturing systems. This study addresses the dynamic distributed flexible job shop scheduling problem, which involves random job arrivals and machine breakdowns, and proposes an effective discrete improved gray wolf optimization (DIGWO) algorithm-based predictive–reactive method. The first contribution of our work lies in its dynamic scheduling strategy: a periodic- and event-driven approach is used to capture the dynamic nature of the problem, and a static scheduling window is constructed based on updated factory and workshop statuses to convert dynamic scheduling into static scheduling at each rescheduling point. Second, a mathematical model of multi-objective distributed flexible job shop scheduling (MODDFJSP) is established, optimizing makespan, tardiness, maximal factory load, and stability. The novelty of the model is that it is capable of optimizing both production efficiency and operational stability in the workshop. Third, by designing an efficacious initialization mechanism, prey search, and an external archive, the DIGWO algorithm is developed to solve conflicting objectives and search for a set of trade-off solutions. Experimental results in a simulated dynamic distributed flexible job shop demonstrate that DIGWO outperforms three well-known algorithms (NSGA-II, SPEA2, and MOEA/D). The proposed method also surpasses completely reactive scheduling approaches based on rule combinations. This study provides a reference for distributed manufacturing systems facing random job arrivals and machine breakdowns.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-9717
2227-9717
DOI:10.3390/pr13071987