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

M.K. Marichelvam and M. Geetha

International Journal of Industrial and Systems Engineering, 2016, vol. 23, issue 4, 467-481

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.

Keywords: hybrid flowshops; flowshop scheduling; HFS; NP-hard; makespan; metaheuristics; harmony search. (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=77698 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:23:y:2016:i:4:p:467-481

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().