A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem

详细信息    查看全文

• 作者：Alireza Rahimi-Vahed ; Mostafa Dangchi ; Hamed Rafiei and Ehsan Salimi
• 关键词：Multi ; objective permutation flow shop scheduling ; Earliness ; Tardiness ; Multi ; objective shuffled frog ; leaping algorithm ; Variable neighborhood search
• 刊名：The International Journal of Advanced Manufacturing Technology
• 出版年：2009
• 出版时间：April, 2009
• 年：2009
• 卷：41
• 期：11-12
• 页码：1227-1239
• 全文大小：269.4 KB

文摘

This paper investigates a novel multi-objective model for a permutation flow shop scheduling problem that minimizes both the weighted mean earliness and the weighted mean tardiness. Since a flow shop scheduling problem has been proved to be NP-hard in a strong sense, a new hybrid multi-objective algorithm based on shuffled frog-leaping algorithm (SFLA) and variable neighborhood search (VNS) is devised to find Pareto optimal solutions for the given problem. To validate the performance of the proposed hybrid multi-objective shuffled frog-leaping algorithm (HMOSFLA) in terms of solution quality and diversity level, various test problems are examined. Further, the efficiency of the proposed algorithm, based on various salient metrics, is compared against two well-known multi-objective genetic algorithms: NSGA-II and SPEA-II. Our computational results suggest that the proposed HMOSFLA outperforms the two foregoing algorithms, especially for large-sized problems.