Knowledge-driven two-stage memetic algorithm for energy-efficient flexible job shop scheduling with machine breakdowns

This paper focuses on the multi-objective energy-efficient flexible job shop scheduling problem with machine breakdowns. To mitigate the impact of machine breakdowns, a rescheduling strategy is implemented in the scheduling process. In addition to sequencing the operations, the current problem is to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Expert systems with applications Jg. 235; S. 121149
Hauptverfasser: Luo, Cong, Gong, Wenyin, Lu, Chao
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Ltd 01.01.2024
Schlagworte:
ISSN:0957-4174
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper focuses on the multi-objective energy-efficient flexible job shop scheduling problem with machine breakdowns. To mitigate the impact of machine breakdowns, a rescheduling strategy is implemented in the scheduling process. In addition to sequencing the operations, the current problem is to determine the appropriate allocation of the machine and the proper speed of the machine to minimize both makespan and total energy consumption simultaneously. A mixed integer linear programming model is established to describe the considered problem. With the aim of effectively solving this problem, a knowledge-driven two-stage memetic algorithm (KTMA) is proposed. In the first stage, a hybrid initialization strategy that combines three problem-specific heuristics is applied to generate a high-quality initial population. Then, a knowledge-driven variable neighborhood search approach is designed for quickly converging and fully exploiting the solution space of the KTMA. In the second stage, two energy-saving strategies are designed to further reduce the total energy consumption. Extensive experiments carried out to compare the KTMA with some well-known algorithms confirm that the proposed KTMA can efficiently solve this problem. •A two-stage evolution framework is proposed for EMBFJSP.•A rescheduling strategy is applied for machine breakdowns.•The population is initialized by three problem-specific heuristics.•Four knowledge-driven variable neighborhood search operators are proposed.•Two types of energy-saving strategies are designed.
ISSN:0957-4174
DOI:10.1016/j.eswa.2023.121149