EUVIMEDEUVIMED entdecken
Crossref

Dual-GNN-Driven Cooperative Optimization for Makespan-Minimized and Large-Scale 3C Dynamic Job-Shop Scheduling

Jing Bi, Chen Wang, Ziqi Wang, Junqi Zhang, Haitao Yuan, Jia Zhang, Rajkumar Buyya

IEEE Transactions on Automation Science and Engineering · 2026 · 23 · 4350-4364

DOI: 10.1109/tase.2026.3661178 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Automation Science and Engineering, 2026. Verfasst von Jing Bi und 6 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 42 Literaturangaben. Gefördert von: Beijing Natural Science Foundation, National Natural Science Foundation of China, Beihang World Top University Cooperation Program.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A Dynamic Job-shop Scheduling Problem (DJSP) in 3C (i.e., Computer, Communication, and Consumer Electronics) manufacturing requires efficient resource allocation under dynamically changing production conditions where jobs arrive unpredictably. Traditional optimization methods struggle to provide scalable solutions due to the high computational cost of searching for the optimal schedules in large and complex environments. To address this challenge, this work proposes a Dual Graph convolutional networks-driven Dynamic Cooperative Hunting Optimizer (DG-DCHO). It integrates Graph Convolutional Networks (GCN) with metaheuristic optimization to generate high-quality schedules and significantly improve computational efficiency. A GCN generator processes graph representations of job-shop environment, captures complex dependencies among jobs and machines, and constructs high-quality initial schedules for the optimization process. A GCN evaluator estimates makespan values directly from schedule representations and replaces costly fitness evaluation, thereby minimizing computational overhead and improving optimization speed. A Dynamic Cooperative Hunting Optimizer serves as a base optimizer and generates scheduling solutions by balancing global exploration with local exploitation through an adaptive search strategy. Experimental results across various DJSP instances demonstrate that DG-DCHO consistently outperforms advanced scheduling algorithms by producing higher-quality solutions with reduced computational resources, establishing it as a scalable and effective framework for real-time dynamic scheduling of large-scale manufacturing systems. Note to Practitioners—This paper is motivated by the practical need to rapidly generate efficient production schedules for complex job shops. We propose a novel automated approach, DG-DCHO, which uses deep learning to learn the dependencies of the production environment and rapidly generate high-quality initial schedules. DG-DCHO also estimates schedule performance without relying on lengthy simulations, accelerating the optimization process with an adaptive algorithm. To apply this approach, practitioners would provide standard manufacturing data, including the sequence of operations required for each job, the constraints between operations, the list of available machines, the potential machine assignments for each operation, and the processing times. The system uses this information to automatically build the required graph model, where DG-DCHO optimizes and outputs the best scheduling sequence. This results in the faster generation of more efficient production schedules, improving responsiveness and productivity. Although the simulation results are strong, practical implementation requires integration with factory systems and initial training in artificial intelligence models. Our future plans to extend the proposed approach to addressing other dynamic optimization challenges in logistics, intelligent manufacturing, and real-time traffic management.

Förderung

  • Beijing Natural Science Foundation
  • National Natural Science Foundation of China
  • Beihang World Top University Cooperation Program

Zitieren

APA

Bi, J., Wang, C., Wang, Z., Zhang, J., Yuan, H., Zhang, J., & Buyya, R. (2026). Dual-GNN-Driven Cooperative Optimization for Makespan-Minimized and Large-Scale 3C Dynamic Job-Shop Scheduling. IEEE Transactions on Automation Science and Engineering, 23, 4350-4364. https://doi.org/10.1109/tase.2026.3661178

Vancouver

Bi J, Wang C, Wang Z, Zhang J, Yuan H, Zhang J, et al. Dual-GNN-Driven Cooperative Optimization for Makespan-Minimized and Large-Scale 3C Dynamic Job-Shop Scheduling. IEEE Transactions on Automation Science and Engineering. 2026;23:4350-4364. doi:10.1109/tase.2026.3661178

BibTeX
@article{Bi2026,
  author = {Bi, Jing and Wang, Chen and Wang, Ziqi and Zhang, Junqi and Yuan, Haitao and Zhang, Jia and Buyya, Rajkumar},
  title = {Dual-GNN-Driven Cooperative Optimization for Makespan-Minimized and Large-Scale 3C Dynamic Job-Shop Scheduling},
  journal = {IEEE Transactions on Automation Science and Engineering},
  year = {2026},
  volume = {23},
  pages = {4350--4364},
  doi = {10.1109/tase.2026.3661178}
}
Kostenlos starten →