EUVIMEDEUVIMED entdecken
Crossref

An Iterated Greedy Algorithm With Reinforcement Learning for Distributed Hybrid Flowshop Problems With Job Merging

Xin-Rui Tao, Quan-Ke Pan, Liang Gao

IEEE Transactions on Evolutionary Computation · 2025-06 · 29 (3) · 589-600

DOI: 10.1109/tevc.2024.3443874 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2025-06. Verfasst von Xin-Rui Tao und 2 weiteren Autor:innen. Die Arbeit wurde bisher 60-mal zitiert (Crossref) und nennt 45 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Program of Shanghai Academic Research Leader, Shanghai Key Laboratory of Power Station Automation Technology.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The distributed hybrid flowshop scheduling problems (DHFSPs) widely exist in various industrial production processes, and thus have received widespread attention. However, the existing research mainly focuses on interfactory and intermachine collaboration, but ignores collaborative processing between jobs. Therefore, this article considers rescheduling DHFSP with job merging and reworking (DHFRPJM) and establishes a mixed-integer linear programming model. The objective is to minimize the makespan. Based on problem-specific knowledge, a decoding heuristic and initialization strategy considering job merging are designed. An acceleration strategy based on critical path is adopted to save the computational effort of the iterated greedy algorithm. A local search strategy based on a deep reinforcement learning algorithm further improves the performance of the algorithm. Experimental results based on actual production data show that the proposed algorithm outperforms other algorithms in closely related literature.

Förderung

  • National Natural Science Foundation of China
  • Program of Shanghai Academic Research Leader
  • Shanghai Key Laboratory of Power Station Automation Technology

Zitieren

APA

Tao, X., Pan, Q., & Gao, L. (2025). An Iterated Greedy Algorithm With Reinforcement Learning for Distributed Hybrid Flowshop Problems With Job Merging. IEEE Transactions on Evolutionary Computation, 29(3), 589-600. https://doi.org/10.1109/tevc.2024.3443874

Vancouver

Tao X, Pan Q, Gao L. An Iterated Greedy Algorithm With Reinforcement Learning for Distributed Hybrid Flowshop Problems With Job Merging. IEEE Transactions on Evolutionary Computation. 2025;29(3):589-600. doi:10.1109/tevc.2024.3443874

BibTeX
@article{Tao2025,
  author = {Tao, Xin-Rui and Pan, Quan-Ke and Gao, Liang},
  title = {An Iterated Greedy Algorithm With Reinforcement Learning for Distributed Hybrid Flowshop Problems With Job Merging},
  journal = {IEEE Transactions on Evolutionary Computation},
  year = {2025},
  volume = {29},
  number = {3},
  pages = {589--600},
  doi = {10.1109/tevc.2024.3443874}
}
Kostenlos starten →