EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots

Yiling Lu, Qiuhua Tang, Quanke Pan, Lianpeng Zhao, Yingying Zhu

Sensors · 03.03.2023 · 23 (5) · 2808

DOI: 10.3390/s23052808 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 03.03.2023. Verfasst von Yiling Lu und 4 weiteren Autor:innen. Beteiligte Einrichtung: Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education, Wuhan University of Science and Technology, Wuhan 430081, …. Die Arbeit wurde bisher 22-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.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Owing to the different quantities and processing times of sub-lots, intermingling sub-lots with each other, instead of fixing the production sequence of sub-lots of a lot as in the existing studies, is a more practical approach to lot-streaming flow shops. Hence, a lot-streaming hybrid flow shop scheduling problem with consistent and intermingled sub-lots (LHFSP-CIS) was studied. A mixed integer linear programming (MILP) model was established, and a heuristic-based adaptive iterated greedy algorithm (HAIG) with three modifications was designed to solve the problem. Specifically, a two-layer encoding method was proposed to decouple the sub-lot-based connection. Two heuristics were embedded in the decoding process to reduce the manufacturing cycle. Based on this, a heuristic-based initialization is proposed to improve the performance of the initial solution; an adaptive local search with four specific neighborhoods and an adaptive strategy has been structured to improve the exploration and exploitation ability. Besides, an acceptance criterion of inferior solutions has been improved to promote global optimization ability. The experiment and the non-parametric Kruskal–Wallis test (p = 0) showed the significant advantages of HAIG in effectiveness and robustness compared with five state-of-the-art algorithms. An industrial case study verifies that intermingling sub-lots is an effective technique to enhance the utilization ratio of machines and shorten the manufacturing cycle.

Schlagwörter

Stichwörter der Autor:innen

adaptive strategyconsistent sub-lotsheuristic-basedhybrid flow shop schedulingintermingle

Autor:innen und Institutionen

  • Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education, Wuhan University of Science and Technology, Wuhan 430081, China.
  • Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering, Wuhan University of Science and Technology, Wuhan 430081, China.
  • School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200444, China.

Förderung

  • National Natural Science Foundation of China

Zitieren

APA

Lu, Y., Tang, Q., Pan, Q., Zhao, L., & Zhu, Y. (2023). A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots. Sensors, 23(5), 2808. https://doi.org/10.3390/s23052808

Vancouver

Lu Y, Tang Q, Pan Q, Zhao L, Zhu Y. A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots. Sensors. 2023;23(5):2808. doi:10.3390/s23052808

BibTeX
@article{Lu2023,
  author = {Lu, Yiling and Tang, Qiuhua and Pan, Quanke and Zhao, Lianpeng and Zhu, Yingying},
  title = {A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots},
  journal = {Sensors},
  year = {2023},
  volume = {23},
  number = {5},
  pages = {2808},
  doi = {10.3390/s23052808}
}
Kostenlos starten →