EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Knowledge-driven teaching-learning-based optimization algorithm for bi-objective flexible job-shop scheduling problem with tool allocation

Kuineng Chen, Xiaofang Yuan, Weihua Tan iD

PLOS One · 2026

DOI: 10.1371/journal.pone.0342585 ↗

Kurz gefasst

Fachartikel in der Zeitschrift PLOS One, 2026. Verfasst von Kuineng Chen und 2 weiteren Autor:innen. Beteiligte Einrichtung: Hunan Engineering Research Center of Special Robot Control Technology and Equipment in Complex Environment, Xiangtan, China. Hauptthemen laut MEDLINE: Algorithms. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Hunan Provincial Natural Science Foundation of China, Natural Science Foundation of Hainan Province, Scientific Research Fund of Hunan Provincial Education Department.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

To perform “global” optimization of the machining process in discrete manufacturing, a bi-objective flexible job-shop scheduling problem with tool allocation is proposed. Unlike traditional scheduling problems that treat resources independently, this paper addresses the strong coupling between machine routing, operation sequencing, and finite tool capacity. A mixed-integer programming model is constructed with the objectives of minimizing the tool wear cost and weighted sum of tardiness. Sophisticated constraints that fit actual manufacturing scenarios are considered, specifically the combination of tool magazine capacity, variant job releasing times, and machine/tool compatibility for operations. To address the computational challenge and the discrete nature of the solution space, a knowledge-driven teaching-learning-based optimization algorithm is designed. Specific strategies, including a topology-preserving discrete crossover and a critical-path-based neighborhood search, are developed to prevent premature convergence caused by complex constraints. Simulation experimental results show that the proposed algorithm significantly outperforms the traditional meta-heuristic algorithms in the aspects of quality, spread, and comprehensive metric, and the proposed multi-objective collaborative optimization method obtains better processing decisions than the traditional sequential scheduling methods.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsComputer SimulationSoft ComputingModels, Theoretical

Autor:innen und Institutionen

  • Hunan Engineering Research Center of Special Robot Control Technology and Equipment in Complex Environment, Xiangtan, China.
  • College of Electrical and Information Engineering, Hunan University, Changsha, China.
  • Sanya Institute of Hunan University of Science and Technology, Sanya, China.
  • School of Information and Electrical Engineering, Hunan University of Science and Technology, Xiangtan, China.

ORCID-Profile: Weihua Tan

Förderung

  • Hunan Provincial Natural Science Foundation of China
  • Natural Science Foundation of Hainan Province
  • Scientific Research Fund of Hunan Provincial Education Department

Zitieren

APA

Chen, K., Yuan, X., & Tan, W. (2026). Knowledge-driven teaching-learning-based optimization algorithm for bi-objective flexible job-shop scheduling problem with tool allocation. PLOS One. https://doi.org/10.1371/journal.pone.0342585

Vancouver

Chen K, Yuan X, Tan W. Knowledge-driven teaching-learning-based optimization algorithm for bi-objective flexible job-shop scheduling problem with tool allocation. PLOS One. 2026. doi:10.1371/journal.pone.0342585

BibTeX
@article{Chen2026,
  author = {Chen, Kuineng and Yuan, Xiaofang and Tan, Weihua},
  title = {Knowledge-driven teaching-learning-based optimization algorithm for bi-objective flexible job-shop scheduling problem with tool allocation},
  journal = {PLOS One},
  year = {2026},
  doi = {10.1371/journal.pone.0342585}
}
Kostenlos starten →