Minimisation of total tardiness in hybrid flowshop scheduling problems with sequence dependent setup times using a discrete firefly algorithm

M.K. Marichelvam, A. Azhagurajan and M. Geetha

International Journal of Operational Research, 2018, vol. 32, issue 1, 114-126

Abstract: In this paper, hybrid flowshop (HFS) scheduling problems with sequence dependent setup times (SDST) are considered. The objective is to minimise the total tardiness. As these problems were proved to be strongly NP-hard (non-deterministic polynomial time hard) type combinatorial optimisation problems, exact methods cannot be used to solve the problems. Hence, many heuristics and meta-heuristics were addressed in the literature to solve the problems. In this paper, discrete version of a recently developed bio-inspired meta-heuristic algorithm called as discrete firefly algorithm (DFA) is proposed to solve the problems. Extensive computational experiments are carried out to validate the performance of the proposed algorithm. Computational results reveal the success of the proposed algorithm.

Keywords: hybrid flowshop; scheduling; total tardiness; set up time; discrete firefly algorithm; DFA. (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=91204 (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:ijores:v:32:y:2018:i:1:p:114-126

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().