Abstract
This paper addresses the multistage hybrid flow shop (HFS) scheduling problems, which are found in many industries. The HFS scheduling problems are known to be non-deterministic polynomial time hard (NP-hard) problems. The objective is to minimise the makespan. Due to the complexity of the problem, researchers developed many metaheuristics to solve the problem. In this paper, harmony search (HS) algorithm, a recently developed music-based metaheuristic is proposed to solve the problem. Computational experiments are conducted to verify the performance of the proposed algorithm. The results proved that the HS algorithm outperforms many other algorithms addressed in the literature.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
