Research on Flexible Job Shop Scheduling Problem with Handling and Setup Time Based on Improved Discrete Particle Swarm Algorithm
Applied Sciences · 20.03.2024 · 14 (6) · 2586
DOI: 10.3390/app14062586 ↗Kurz gefasst
Fachartikel in der Zeitschrift Applied Sciences, online erschienen am 20.03.2024. Verfasst von Jili Kong und 1 weiteren Autor:innen. Die Arbeit wurde bisher 19-mal zitiert (Crossref) und nennt 32 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Humanities and Social Science Youth foundation of the Ministry of Education of China.
Abstract (Originalsprache)
With the gradual emergence of customized manufacturing, intelligent manufacturing systems have experienced widespread adoption, leading to a surge in research interests in the associated problem of intelligent scheduling. In this paper, we study the flexible job shop scheduling problem (FJSP) with setup time, handling time, and processing time in a multi-equipment work center production environment oriented toward smart manufacturing and make-to-order requirements. A mathematical model with the optimization objectives of minimizing the maximum completion time, the total number of machine adjustments, the total number of workpieces handled and the total load of the machine is constructed, and an improved discrete particle swarm algorithm based on Pareto optimization and a nonlinear adaptive inertia weighting strategy is proposed to solve the model. By integrating the model characteristics and algorithm features, a hybrid initialization method is designed to generate a higher-quality initialized population. Next, three cross-variance operators are used to implement particle position updates to maintain information sharing among particles. Then, the performance effectiveness of this algorithm is verified by testing and analyzing 15 FJSP test instances. Finally, the feasibility and effectiveness of the designed algorithm for solving multi-objective FJSPs are verified by designing an FJSP test example that includes processing time, setup time and handling time.
Förderung
- Humanities and Social Science Youth foundation of the Ministry of Education of China
Zitieren
APA
Kong, J., & Wang, Z. (2024). Research on Flexible Job Shop Scheduling Problem with Handling and Setup Time Based on Improved Discrete Particle Swarm Algorithm. Applied Sciences, 14(6), 2586. https://doi.org/10.3390/app14062586
Vancouver
Kong J, Wang Z. Research on Flexible Job Shop Scheduling Problem with Handling and Setup Time Based on Improved Discrete Particle Swarm Algorithm. Applied Sciences. 2024;14(6):2586. doi:10.3390/app14062586
BibTeX
@article{Kong2024,
author = {Kong, Jili and Wang, Zhen},
title = {Research on Flexible Job Shop Scheduling Problem with Handling and Setup Time Based on Improved Discrete Particle Swarm Algorithm},
journal = {Applied Sciences},
year = {2024},
volume = {14},
number = {6},
pages = {2586},
doi = {10.3390/app14062586}
}
EUVIMED