Solving tri-objective multistage hybrid flow shop scheduling problems using a discrete firefly algorithm
by M.K. Marichelvam; M. Geetha
International Journal of Intelligent Engineering Informatics (IJIEI), Vol. 2, No. 4, 2014

Abstract: Hybrid flow shop (HFS) scheduling problems turn into a fascinating area of research for the past several decades. However, most of the researchers consider only single objective and makespan is the most vital objective function. The real industrial scheduling problems involve multiple conflicting objectives. The HFS scheduling problems were proved to be NP-hard (non-deterministic polynomial time hard) problems. In this paper, we present a discrete firefly algorithm (DFA) to minimise the makespan, total flow time and machine idle time in a multistage HFS environment consisting of n jobs and k stages with identical parallel machines. The performance of the proposed algorithm is tested with a real industrial case study data and random problem instances. Computational results proved the effectiveness of the proposed algorithm.

Online publication date: Sat, 07-Feb-2015

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 Intelligent Engineering Informatics (IJIEI):
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