A multi-neighborhood-based multi-objective memetic algorithm for the energy-efficient distributed flexible flow shop scheduling problem

This paper focuses on an energy-efficient distributed flexible flow shop scheduling problem (EEDFFSP) with variable machine speed. The EEDFFSP needs to solve four sub-problems: factory assignment, determination of the job sequence at each stage, machine selection, and the speed selection for each jo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Neural computing & applications Ročník 34; číslo 24; s. 22303 - 22330
Hlavní autoři: Shao, Weishi, Shao, Zhongshi, Pi, Dechang
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Springer London 01.12.2022
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Computational Biology/Bioinformatics
Computational Science and Engineering
Computer Science
Data Mining and Knowledge Discovery
Energy consumption
Factories
Image Processing and Computer Vision
Indicators
Industrial plants
Job shop scheduling
Original Article
Permutations
Probability and Statistics in Computer Science
Searching
Multiple neighborhoods
Memetic algorithm
Multi-objective
Energy-efficient distributed flexible flow shop scheduling
ISSN:0941-0643, 1433-3058
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper focuses on an energy-efficient distributed flexible flow shop scheduling problem (EEDFFSP) with variable machine speed. The EEDFFSP needs to solve four sub-problems: factory assignment, determination of the job sequence at each stage, machine selection, and the speed selection for each job on a machine. A multi-neighborhood-based multi-objective memetic algorithm (MMMA) is proposed to optimize total weighted tardiness and energy consumption. The MMMA employs a two-level encoding scheme including a job permutation and a speed matrix. A highly-efficient decoding strategy is utilized to reduce the search space of the sub-problems. In the initial phase, a weighted NEH (Nawaz-Enscore-Ham) based-initial method is developed to generate an initial population. Two genetic global search operators are designed to perform exploration evolution. Then, several multiple neighborhoods including several permutation adjustment operations within or between factories, an energy-saving strategy, and a speed adjustment strategy are integrated to enhance exploitation ability. The comprehensive experiments on extensive instances are performed to test the contribution of the main components and the performance of the MMMA. The average values of Hypervolume and Unary Epsilon indicators obtained by the variants of the MMMA without the initialization method, genetic global search, local search, and energy-saving strategy are worse than the complete MMMA, which demonstrates a significant contribution of these components to the MMMA. The MMMA obtains the best values of indicators among all the compared algorithms within a limited run time, which demonstrates the MMMA is an effective and efficient algorithm for solving the EEDFFSP.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-022-07714-3