Application of novel harmony search algorithm for solving hybrid flow shop scheduling problems to minimise makespan. (2016)

• Record Type: Journal Article
• Authors: Marichelvam, M.K.; Geetha, M.
• Is Part Of: International journal of industrial and systems engineering. Volume 23:Number 4(2016)
• Page Start: 467
• Page End: 481
• Publication Date: 2016
• Subjects: hybrid flowshops -- flowshop scheduling -- HFS -- NP-hard -- makespan -- metaheuristics -- harmony search; Systems engineering -- Periodicals; Industrial engineering -- Periodicals; 620.001171
• Languages: English
• ISSNs: 1748-5037

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.