EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Flexible job-shop scheduling problem with parallel batch machines based on an enhanced multi-population genetic algorithm

Lirui Xue, Shinan Zhao, Amin Mahmoudi, Mohammad Reza Feylizadeh

Complex & Intelligent Systems · 2024-06 · 10 (3) · 4083-4101

DOI: 10.1007/s40747-024-01374-7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Complex & Intelligent Systems, online erschienen am 02.03.2024. Verfasst von Lirui Xue und 3 weiteren Autor:innen. Die Arbeit wurde bisher 20-mal zitiert (Crossref) und nennt 41 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, the” Belt and Road” Innovative Talents Exchange Foreign Experts Project of China, Research Initiation Fund of Jiangsu University of Science and Technology.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The flexible job-shop scheduling problem (FJSP) with parallel batch processing machine (PBM) is one of those long-standing issues that needs cutting-edge approaches. It is a recent extension of standard flexible job shop scheduling problems. Despite their wide application and prevalence in practical production, it seems that current research on these types of combinatorial optimization problems remains limited and uninvestigated. More specifically, existing research mainly concentrates on the flow shop scenarios in parallel batch machines for job shop scheduling but few literature emphasis on the flexible job shop integration in these contexts. To directly address the above mentioned problems, this paper establishes an optimization model considering parallel batch processing machines, aiming to minimize the maximum completion time in operating and production environments. The proposed solution merges variable neighborhood search with multi-population genetic algorithms, conducting a neighborhood search on the elite population to reduce the likelihood of falling into local optima. Subsequently, its applicability was evaluated in computational experiments using real production scenarios from a partnering enterprise and extended datasets. The findings from the analyses indicate that the enhanced algorithm can decrease the objective value by as much as 15% compared to other standard algorithms. Importantly, the proposed approach effectively resolves flexible job shop scheduling problems involving parallel batch processing machines. The contribution of the research is providing substantial theoretical support for enterprise production scheduling.

Förderung

  • National Natural Science Foundation of China
  • the” Belt and Road” Innovative Talents Exchange Foreign Experts Project of China
  • Research Initiation Fund of Jiangsu University of Science and Technology
  • Graduate Practice Innovation Program Project of Jiangsu Province

Zitieren

APA

Xue, L., Zhao, S., Mahmoudi, A., & Feylizadeh, M. R. (2024). Flexible job-shop scheduling problem with parallel batch machines based on an enhanced multi-population genetic algorithm. Complex & Intelligent Systems, 10(3), 4083-4101. https://doi.org/10.1007/s40747-024-01374-7

Vancouver

Xue L, Zhao S, Mahmoudi A, Feylizadeh MR. Flexible job-shop scheduling problem with parallel batch machines based on an enhanced multi-population genetic algorithm. Complex & Intelligent Systems. 2024;10(3):4083-4101. doi:10.1007/s40747-024-01374-7

BibTeX
@article{Xue2024,
  author = {Xue, Lirui and Zhao, Shinan and Mahmoudi, Amin and Feylizadeh, Mohammad Reza},
  title = {Flexible job-shop scheduling problem with parallel batch machines based on an enhanced multi-population genetic algorithm},
  journal = {Complex & Intelligent Systems},
  year = {2024},
  volume = {10},
  number = {3},
  pages = {4083--4101},
  doi = {10.1007/s40747-024-01374-7}
}
Kostenlos starten →