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

• Record Type: Journal Article
• Authors: Marichelvam, M.K.; Azhagurajan, A.; Geetha, M.
• Is Part Of: International journal of operational research. Volume 32:Number 1(2018)
• Page Start: 114
• Page End: 126
• Publication Date: 2018
• Subjects: hybrid flowshop -- scheduling -- total tardiness -- set up time -- discrete firefly algorithm -- DFA; Operations research -- Periodicals; 003.05
• Languages: English
• ISSNs: 1745-7645

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.