.png){kind=icon}
Return
A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2016.06.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a competitive memetic algorithm (CMA) is proposed to solve the multi-objective distributed permutation flow-shop scheduling problem (MODPFSP) with the makespan and total tardiness criteria. Two populations corresponding to two different objectives are employed in the CMA. Some objective-specific operators are designed for each population, and a special interaction mechanism between two populations is designed. Moreover, a competition mechanism is proposed to adaptively adjust the selection rates of the operators, and some knowledge-based local search operators are developed to enhance the exploitation ability of the CMA. In addition, the influence of the parameters on the performance of the CMA is investigated by using the Taguchi method of design-of-experiment. Finally, extensive computational tests and comparisons are carried out to. demonstrate the effectiveness of the CMA in solving the MODPFSP. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Distributed permutation flow-shop scheduling
Makespan
Total tardiness
Multi-objective optimization
Competitive memetic algorithm
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more