EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Discrete Multi-Objective Grey Wolf Algorithm Applied to Dynamic Distributed Flexible Job Shop Scheduling Problem with Variable Processing Times

Jiapeng Chen, Chun Wang, Binzi Xu, Sheng Liu

Applied Sciences · 20.02.2025 · 15 (5) · 2281

DOI: 10.3390/app15052281 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Applied Sciences, online erschienen am 20.02.2025. Verfasst von Jiapeng Chen und 3 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 47 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Natural Science Research Project of Anhui Educational Committee, Young and Middle-aged Teachers Training Action Project of Anhui Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Uncertainty in processing times is a key issue in distributed production; it severely affects scheduling accuracy. In this study, we investigate a dynamic distributed flexible job shop scheduling problem with variable processing times (DDFJSP-VPT), in which the processing time follows a normal distribution. First, the mathematical model is established by simultaneously considering the makespan, tardiness, and total factory load. Second, a chance-constrained approach is employed to predict uncertain processing times to generate a robust initial schedule. Then, a heuristic scheduling method which involves a left-shift strategy, an insertion-based local adjustment strategy, and a DMOGWO-based global rescheduling strategy is developed to dynamically adjust the scheduling plan in response to the context of uncertainty. Moreover, a hybrid initialization scheme, discrete crossover, and mutation operations are designed to generate a high-quality initial population and update the wolf pack, enabling GWO to effectively solve the distributed flexible job shop scheduling problem. Based on the parameter sensitivity study and a comparison with four algorithms, the algorithm’s stability and effectiveness in both static and dynamic environments are demonstrated. Finally, the experimental results show that our method can achieve much better performance than other rules-based reactive scheduling methods and the hybrid-shift strategy. The utility of the prediction strategy is also validated.

Förderung

  • National Natural Science Foundation of China
  • Natural Science Research Project of Anhui Educational Committee
  • Young and Middle-aged Teachers Training Action Project of Anhui Province
  • Science and Technology Project of Wuhu

Zitieren

APA

Chen, J., Wang, C., Xu, B., & Liu, S. (2025). Discrete Multi-Objective Grey Wolf Algorithm Applied to Dynamic Distributed Flexible Job Shop Scheduling Problem with Variable Processing Times. Applied Sciences, 15(5), 2281. https://doi.org/10.3390/app15052281

Vancouver

Chen J, Wang C, Xu B, Liu S. Discrete Multi-Objective Grey Wolf Algorithm Applied to Dynamic Distributed Flexible Job Shop Scheduling Problem with Variable Processing Times. Applied Sciences. 2025;15(5):2281. doi:10.3390/app15052281

BibTeX
@article{Chen2025,
  author = {Chen, Jiapeng and Wang, Chun and Xu, Binzi and Liu, Sheng},
  title = {Discrete Multi-Objective Grey Wolf Algorithm Applied to Dynamic Distributed Flexible Job Shop Scheduling Problem with Variable Processing Times},
  journal = {Applied Sciences},
  year = {2025},
  volume = {15},
  number = {5},
  pages = {2281},
  doi = {10.3390/app15052281}
}
Kostenlos starten →