.png){kind=icon}
Return
A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-021-00354-5.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The distributed manufacturing has become a prevail production mode under the economic globalization. In this article, a memetic discrete differential evolution (MDDE) algorithm is proposed to address the distributed permutation flow shop scheduling problem (DPFSP) with the minimization of the makespan. An enhanced NEH (Nawaz-Enscore-Ham) method is presented to produce potential candidate solutions and Taillard's acceleration method is adopted to ameliorate the operational efficiency of the MDDE. A new discrete mutation strategy is introduced to promote the search efficiency of the MDDE. Four neighborhood structures, which are based on job sequence and factory assignment adjustment mechanisms, are introduced to prevent the candidates from falling the local optimum during the search process. A neighborhood search mechanism is selected adaptively through a knowledge-based strategy which focuses on the adaptive evaluation for the neighborhood selection. The optimal combinations of parameters in the MDDE algorithm are testified by the design of experiment. The computational results and comparisons demonstrated the effectiveness of the MDDE algorithm for solving the DPFSP.
Keywords:
Distributed permutation flow shop scheduling
Neighborhood structures
Differential evolution
Knowledge
Makespan
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.6
Papers:
2.1K
Citations:
6.6K
Organization
Cited Papers
Differential Sensitivity to LPS-Induced Myocardial Dysfunction in the Isolated Brown Norway and DAHL S Rat Hearts.png)
ShockOAAI
ShockIF0
OAAIShareSaveShareSaveShareSaveShareSaveShareSaveA novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
PREAI
ShareSave
View more