Joint scheduling of AGVs and parallel machines in an automated electrode foil production factory

In recent years, the automated guided vehicle (AGV) scheduling problem and parallel machine scheduling problem (PMSP) in workshops have become two hot topics in the field of operational research. In practical production, the two problems are closely related and coupled, and both play important roles...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Expert systems with applications Jg. 238; S. 122197
Hauptverfasser: Tian, Mengxi, Sang, Hongyan, Zou, Wenqiang, Wang, Yuting, Miao, Mingpeng, Meng, Leilei
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 15.03.2024
Schlagworte:
Automated electrode foil
Automated guided vehicle
Discrete gray wolf optimization algorithm
Heuristics
Joint scheduling
Automated electrode foil
Joint scheduling
Discrete gray wolf optimization algorithm
Automated guided vehicle
Heuristics
ISSN:0957-4174
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In recent years, the automated guided vehicle (AGV) scheduling problem and parallel machine scheduling problem (PMSP) in workshops have become two hot topics in the field of operational research. In practical production, the two problems are closely related and coupled, and both play important roles in manufacturing systems. However, in the literature, the two problems are often addressed separately, which decreases the efficiency of manufacturing systems to a great degree. Therefore, this paper studies the joint scheduling problem of AGV and parallel machines in a production process of automatic electrode foil. Taking makespan as the optimization objective, a mixed-integer linear programming model is established and verified by the GUROBI solver. A discrete gray wolf optimization algorithm is proposed to solve the AGV-PMSP. An improved NEH heuristic is used to propose the quality of the initial solution. Six neighborhood operators are used to improve the exploration capabilities of the proposed algorithm. A theorem is proved to improve computational efficiency. The performance of the proposed algorithm is verified using comprehensive simulation experiments.
ISSN:0957-4174
DOI:10.1016/j.eswa.2023.122197