EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Iterated Tabu Search Enhanced Particle Swarm Optimization for the Multi-Stage Flexible Job Shop Scheduling Problem

Chunyang Jiang, Hengyu Song, Baotong Ma, Shiwen Wang, Chulei Zhang, Peng Zhao, You Zhou

AI · 09.05.2026 · 7 (5) · 165

DOI: 10.3390/ai7050165 ↗

Kurz gefasst

Fachartikel in der Zeitschrift AI, online erschienen am 09.05.2026. Verfasst von Chunyang Jiang und 6 weiteren Autor:innen. Die Arbeit nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Jilin Provincial Department of Science and Technology Project.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In recent years, with the advancement of production technology in the manufacturing industry, the scheduling problems that rely on modeling in real-world scenarios have gradually evolved into complex process flows. Aiming at the limited problem modeling capabilities of existing scheduling problems, this study proposes Multi-Stage Flexible Job Shop Scheduling Problem (MS-FJSP). MS-FJSP alters the fixed operation processing sequence of jobs in conventional scheduling problems and introduces staged processing to incorporate flexible constraints on operation selection. Furthermore, MS-FJSP modifies the constraint of unique machine compatibility, enabling arbitrary adjustments to machine combinations according to processing requirements. To address the complex flexibility and large-scale solution space of MS-FJSP, we propose a particle swarm optimization algorithm based on double neighborhood tabu search (TS-PSO). Specifically, the PSO algorithm determines a superior neighborhood structure for this problem, while the TS algorithm improves and optimizes the solution quality within the neighborhood of this solution structure. We verify the algorithm’s performance using a dataset consisting of 12,000 MS-FJSP instances and an MS-FJSP instance modeled from a real-world scheduling scenario. Experimental results demonstrate that TS-PSO can achieve excellent solution quality within a reasonable time, and MS-FJSP possesses efficient modeling capability for real-world scheduling scenarios.

Förderung

  • Jilin Provincial Department of Science and Technology Project

Zitieren

APA

Jiang, C., Song, H., Ma, B., Wang, S., Zhang, C., Zhao, P., & Zhou, Y. (2026). Iterated Tabu Search Enhanced Particle Swarm Optimization for the Multi-Stage Flexible Job Shop Scheduling Problem. AI, 7(5), 165. https://doi.org/10.3390/ai7050165

Vancouver

Jiang C, Song H, Ma B, Wang S, Zhang C, Zhao P, et al. Iterated Tabu Search Enhanced Particle Swarm Optimization for the Multi-Stage Flexible Job Shop Scheduling Problem. AI. 2026;7(5):165. doi:10.3390/ai7050165

BibTeX
@article{Jiang2026,
  author = {Jiang, Chunyang and Song, Hengyu and Ma, Baotong and Wang, Shiwen and Zhang, Chulei and Zhao, Peng and Zhou, You},
  title = {Iterated Tabu Search Enhanced Particle Swarm Optimization for the Multi-Stage Flexible Job Shop Scheduling Problem},
  journal = {AI},
  year = {2026},
  volume = {7},
  number = {5},
  pages = {165},
  doi = {10.3390/ai7050165}
}
Kostenlos starten →