期刊
MATHEMATICS AND COMPUTERS IN SIMULATION
卷 180, 期 -, 页码 152-178出版社
ELSEVIER
DOI: 10.1016/j.matcom.2020.08.019
关键词
Flexible flow shop scheduling; multi-objective harmony search; Gaussian mutation; Simulation and computational experiments; Sequence-dependent setup times; Response surface methodology
类别
资金
- Czech Science Foundation [R 19-13946S]
An enhanced multi-objective harmony search algorithm is proposed to solve the flexible flow shop scheduling problems, with experimental results demonstrating its effectiveness.
We propose an enhanced multi-objective harmony search (EMOHS) algorithm and a Gaussian mutation to solve the flexible flow shop scheduling problems with sequence-based setup time, transportation time, and probable rework. A constructive heuristic is used to generate the initial solution, and clustering is applied to improve the solution. The proposed algorithm uses response surface methodology to minimize both maximum completion time and mean tardiness, concurrently. We evaluate the efficacy of the proposed algorithm using computational experiments based on five measures of diversity metric, simultaneous rate of achievement for two objectives, mean ideal distance, quality metric, and coverage. The experimental results demonstrate the effectiveness of the proposed EMOHS compared with the existing algorithms for solving multi-objective problems. (C) 2020 International Association for Mathematics and Computers in Simulation (IMACS). Published by Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据