A heuristic algorithm to minimise the total flowtime of jobs in permutation flowshops

J. Krishnaraj, S. Pugazhendhi, Chandrasekharan Rajendran and S. Thiagarajan

International Journal of Industrial and Systems Engineering, 2014, vol. 17, issue 4, 511-532

Abstract: A heuristic algorithm with six implementations (HA-I to HA-VI) is presented in this paper, and it is used to solve the permutation flowshop scheduling problem to minimise the total flowtime of jobs. These implementations have been evaluated by using the 90 benchmark flowshop scheduling problem instances, and the solutions yielded are compared with the solutions reported in the literature. The comparison shows that the implementations all together have produced better solutions for 28 problem instances and same solutions for 29 problem instances, out of 90 problem instances considered with respect to the solutions by Iterated Local Search algorithm proposed by Dong et al. (2009). They have also produced better solutions for 50 problem instances and the same solutions for 19 problem instances, out of 90 problem instances considered with respect to the solutions by PSOvns algorithm proposed by Tasgetiren et al. (2007), as reported in Dong et al. (2009).

Keywords: flowshop scheduling; permutation flowshops; total flowtime; heuristic algorithms. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=63967 (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:17:y:2014:i:4:p:511-532

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 ().