Journal
MATHEMATICS AND COMPUTERS IN SIMULATION
Volume 180, Issue -, Pages 152-178Publisher
ELSEVIER
DOI: 10.1016/j.matcom.2020.08.019
Keywords
Flexible flow shop scheduling; multi-objective harmony search; Gaussian mutation; Simulation and computational experiments; Sequence-dependent setup times; Response surface methodology
Categories
Funding
- Czech Science Foundation [R 19-13946S]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available