Minimisation of total tardiness in hybrid flowshop scheduling problems with sequence dependent setup times using a discrete firefly algorithm
by M.K. Marichelvam; A. Azhagurajan; M. Geetha
International Journal of Operational Research (IJOR), Vol. 32, No. 1, 2018

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.

Online publication date: Mon, 16-Apr-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com